Get reliable answers to your questions at Westonci.ca, where our knowledgeable community is always ready to help. Our Q&A platform offers a seamless experience for finding reliable answers from experts in various disciplines. Get immediate and reliable solutions to your questions from a community of experienced professionals on our platform.

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

Sagot :

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.

Thanks for stopping by. We strive to provide the best answers for all your questions. See you again soon. We hope you found what you were looking for. Feel free to revisit us for more answers and updated information. We're glad you visited Westonci.ca. Return anytime for updated answers from our knowledgeable team.