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?

0.85 or 85%

step-by-step explanation:

1) divide 23 by 27

2) round the decimal to the nearest 10

3) so your answer would be 0.85 or 85%

n=9

step-by-step explanation:

7 times a number = 7n

decreased by 13 = 7n-13

same as is =

5 times the number = 5n

increased by 5 = 5n+5

7n-13 = 5n+5

2n=18

n=9

hello from mrbilldoesmath!

answer:

25x^2 + 90x + 84

discussion:

mn(x) = m(n(x)) = m( 5x + 9) =

(5x + 9)^2 + 3 =>

25x^2 + 90x + 9^2 + 3 =

25x^2 + 90x + 84                 (as 9^2 = 9*9 = 81)

which is the second choice

regards,  

mrb

p.s.   i'll be on vacation from friday, dec 22 to jan 2, 2019. have a great new year!