Part B Assume the statement is true for n=k. Prove that it must be true for n=k+1, therefore proving it true
for all natural numbers, n.
Hint: Since the total number of dots increases by n each time, prove that d(k) + (k + 1) = d (k+1).

just find the gcf and solve the gcf's until you get each answer i have a really good feeling somethings missing xd (like the dimensions of the fence) *cough *cough *hint *hint

step-by-step explanation:

1. minimum

2. 6400

3. eight

hope this !

c. side angle side. u shares the same sides

"image"

step-by-step explanation:

in most of these problems, the notation is that the point with a "prime" is the image of the point without. that is, b' is the image of b.

here, there is no dilation or reflection. there is simply translation (with no direction shown). which figure you call the "preimage" and which one you call the "image" is up to you. as a matter of convention, the naming is as described above.