Answer:
you basically make boxes and have arrows connecting them, then you'll add the information on them.
Step-by-step explanation:
it's basically like a pedigree table but less complicated. if you need help on what a flowchart looks like just go to google
Answer:
(d) (7, -5)
Step-by-step explanation:
The x-coordinate is listed first in an ordered pair. It is found on the horizontal scale. The point is on the grid line halfway between 6 and 8, so is presumed to have an x-coordinate of 7.
The y-coordinate is listed second in an ordered pair. It is found on the vertical scale. The point is on the grid line halfway between -4 and -6, so is presumed to have a y-coordinate of -5.
The coordinates of point A are (x, y) = (7, -5).
__
<em>Additional comment</em>
As in the case here, you will often run across graphs that don't have markings on every grid line You are expected to be able to figure out the value of a grid line based on the spacing of the marked lines.
It is a good idea to get familiar with reading coordinates of a point on a graph, as you will be doing it a lot.
Answer:
2 pounds
Step-by-step explanation:
1 pound = 1/2 hour (30 minutes)
x pound(s) = 1 hour (60 minutes)
Equation:
1 pound · (2) = 1/2 hour · (2)
2 = 1 hour
Proof by induction
Base case:
n=1: 1*2*3=6 is obviously divisible by six.
Assumption: For every n>1 n(n+1)(n+2) is divisible by 6.
For n+1:
(n+1)(n+2)(n+3)=
(n(n+1)(n+2)+3(n+1)(n+2))
We have assumed that n(n+1)(n+2) is divisble by 6.
We now only need to prove that 3(n+1)(n+2) is divisible by 6.
If 3(n+1)(n+2) is divisible by 6, then (n+1)(n+2) must be divisible by 2.
The "cool" part about this proof.
Since n is a natural number greater than 1 we can say the following:
If n is an odd number, then n+1 is even, then n+1 is divisible by 2 thus (n+1)(n+2) is divisible by 2,so we have proved what we wanted.
If n is an even number" then n+2 is even, then n+1 is divisible by 2 thus (n+1)(n+2) is divisible by 2,so we have proved what we wanted.
Therefore by using the method of mathematical induction we proved that for every natural number n, n(n+1)(n+2) is divisible by 6. QED.
2 is correct, because:
1) we have a close interval
2)we must have node on x=-5
