niamhcomer7 niamhcomer7
  • 03-02-2022
  • Mathematics
contestada

prove by induction that 7^2n+1 +1 is divisible by 8, for all nEN

Respuesta :

freckledspots freckledspots
  • 03-02-2022

Answer:

See below.

Step-by-step explanation:

Base case:

Replace n with 1.

7^(2×1+1)+1

7^3+1

343+1

344

8 is a factor of 344 since 344=8(43).

Induction hypothesis:

Assume there is some integer n such that 7^(2k+1)+1=8n for positive integer k.

7^(2[k+1]+1)+1

7^(2k+3)+1

7^(2k+1+2)+1

7^(2k+1)7^2+1

49×7^(2k+1)+1

Induction step:

49×(8n-1)+1

49(8n)-49+1

49(8n)-48

8[49n-6]

This means 8 is a factor of 7^(2(k+1)+1)+1.

Thus, this proves for all positive integer n that 8 is a factor of 7^(2n+1)+1.

Answer Link

Otras preguntas

Draw 10 coins to show an amount between 50cent and $1.00
Show how to multiply 6 x 298 using properties and mental math
Water molecules are polar, with Select one: a. the oxygen side being slightly positive and the hydrogen side being slightly negative. b. the oxygen and hydrogen
what are the two general types of energy that can be used to classify many forms of energy?
What methods did colonists use to protest actions by parliament between 1765 and 1775?
Which of the following is perpendicular to the line y= -1/2x+8
round 141.999 to the nearest tenth
The only haploid cells in an organism are _____. parent cells gametes homologous
Is the relationship between the cost of equal-priced DVDs and the number purchased linear
How does syntax affect setting?