SOLUTION: using mathematicsl induction prove that 3^n+7^n-2 is divisible by 8

Algebra.Com
Question 982823: using mathematicsl induction prove that 3^n+7^n-2 is divisible by 8
Answer by Edwin McCravy(20056)   (Show Source): You can put this solution on YOUR website!
using mathematicsl induction prove that is divisible by 8

 is divisible by 8.

We only need to show that the difference f(n+1)-f(n) is divisible by 8. 
For if that difference is divisible by 8 then the assumption that f(n) 
is divisible by 8 will show that f(n+1) is divisible by 8 because the 
sum of the difference and f(n) will be f(n+1) and the sum of two 
multiples of 8 is a multiple of 8. 



}






But we must now show that 

 is divisible by 4 
 is divisible by 4

As above, we only need to show that the difference g(n+1)-g(n) is divisible by
4. For if that is divisible by 4 then the assumption that g(n) is divisible
by 4 will show that g(n+1) is divisible by 4 because the sum of two
multiples of 4 is a multiple of 4.










The expression in parentheses is even, because
all products and powers of odd numbers are odd numbers,
and the difference of two odd numbers is an even number.
Therefore  is a multiple of 4.

Therefore  is a multiple of 8.

Edwin

RELATED QUESTIONS

Prove using math induction 2^n + (-1)^n+1 is divisible by... (answered by math_helper)
Using math of induction show that 2^n + (-1)^n+1 is divisible by... (answered by math_helper)
use mathematical induction to prove 7^n-3^n is divisible by... (answered by Edwin McCravy)
prove n^3 + 2n is divisible by 3... (answered by ikleyn)
Prove by mathematical induction that: 2^2n - 1 is divisible by 3 for all positive... (answered by Edwin McCravy)
prove that the sum of all natural numbers divisible by 5 is equal to 5n(n+1)/2 using... (answered by Edwin McCravy)
Prove that 5^{3^n} + 1 is divisible by 3^{n + 1} for all nonnegative integers n. Prove... (answered by CPhill)
How to prove {{{n^2-n+14}}} is divisible by 2 using mathematical induction given it's... (answered by Edwin McCravy)
Prove n!>n^2 for n>=4 and n!>n^3 for n>=6 by using Principle of Mathematical... (answered by Edwin McCravy)