Question #76366

Prove that for all positive integers n
3^n +7^n −2 is divisible by 8

Expert's answer

Answer on Question #76366 – Math – Discrete Mathematics

Question

Prove that for all positive integers nn 3n+7n23^n + 7^n - 2 is divisible by 8.

Proof

For n=1n = 1 the statement is true, since 31+712=83^1 + 7^1 - 2 = 8 is divisible by 8.

Let n>1n > 1. Then we can assume that n=2kn = 2k (an even integer) or n=2k+1n = 2k + 1 (an odd integer) for some positive integer kk.

1) Let first n=2kn = 2k for some positive integer kk. Consider


3n+7n2=32k+72k2=9k+49k2.3^n + 7^n - 2 = 3^{2k} + 7^{2k} - 2 = 9^k + 49^k - 2.


By Newton binomial we have that


9k=(8+1)k=8A+19^k = (8 + 1)^k = 8A + 1


and


49k=(68+1)k=8B+149^k = (6 * 8 + 1)^k = 8B + 1


for some positive integers AA and BB.

Therefore, we have that


3n+7n2=8A+1+8B+12=8(A+B) is divisible by 8.3^n + 7^n - 2 = 8A + 1 + 8B + 1 - 2 = 8(A + B) \text{ is divisible by 8}.


2) Let now n=2k+1n = 2k + 1 for some positive integer kk (in general, the integer kk in this case does not coincide with the previous integer kk in the case 1). Consider


3n+7n2=32k+1+72k+12=39k+749k2.3^n + 7^n - 2 = 3^{2k+1} + 7^{2k+1} - 2 = 3 * 9^k + 7 * 49^k - 2.


Similarly to case 1) from Newton binomial there exists positive integers CC and DD, such that


9k=(8+1)k=8C+19^k = (8 + 1)^k = 8C + 1


and


49k=(68+1)k=8D+1.49^k = (6 * 8 + 1)^k = 8D + 1.


Therefore, we have that


3n+7n2=3(8C+1)+7(8D+1)2=8(3C+7D+1) is divisible by 8.3^n + 7^n - 2 = 3(8C + 1) + 7(8D + 1) - 2 = 8(3C + 7D + 1) \text{ is divisible by 8}.


All even and odd numbers were analyzed in cases 1), 2), they form the set of integers.

The proof is completed.

Answer provided by https://www.AssignmentExpert.com

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS