As written, it's obviously false. Try n=2
Did you mean 7n^2+4n+1? Nope; false for n=2
Got some error here
Ah; that's a lot nicer.
it's true for n=1.
So, assume it's true for n=k.
7^(k+1) + 4^(k+1) + 1
= 7*7^k + 4*4^k + 1
= (1+6)*7^k + (1+3)*4^k + 1
= (7^k+4^k+1) + 6*7^k + 3*4^k
obviously, 6*7^k is divisible by 6
4^k is even, so 3*4^k is divisible by 6
So, since we're adding three items which are all multiples of 6, the whole is a multiple of 6.
Thus, the induction step holds.
Calculus - Use mathematical induction to prove that the statement holds for all ...
math - Prove by mathematical induction that : E (3r-5)= 3n^2-7n /2 r=1
AP Calc - Use mathematical induction to prove that the statement holds for all ...
MATHS - prove by mathematical induction that 7^n+4^n+1 is divisible by 6
Math - Mathematical Induction - 3. Prove by induction that∑_(r=1)^n▒...
Mathematical induction. I'm stuck. So far I have.. - For all integers n ≥ ...
Math - Use Mathematical Induction to show that the statement 2 + 6 + 10...
math - use mathematical induction to prove -1/2^n = 1/2^n - 1
Math - Prove by induction that 9^(n+2)- 4n is divisible by 5 for n greater than ...
Algebra - Prove by mathematical induction that 3^(3n+1) + 2^(n+1) is divisible ...