For each positive integer n, let p(n) be the formula 1+3+5++(2n-1) = n^2. a. write p(1). is p(1) true? b. write p(k). c. write p(k + 1). d. in a proof by mathematical induction that the formula holds for every integer n 2 1. what must be shown in the inductive step?

step-by-step explanation:

given that there are two triangles j'k'l' and jkl>

the former is got by dilating the second one.

when drawn on a grid, (graph paper) coordinates of vertices of first triangle is

(6,12)j, (9,6)k and (12,9)l

side jk has length = distance between j and k

=

side j'k'=distance between j' and k'

=

ie j'k'l' has sides 1/3 of that of corresponding sides of jkl.

hence scale factor of 1/3 is used to get j'k'l'from jkl

you didn't give me the choices, so i will just give you the graph so you can look at your choices and choose the right one.

what

a) 0,0; 1,1; and 2,2

step-by-step explanation:

these have the exact same coordinates, thus they are the correct function.