Friday

August 1, 2014

August 1, 2014

Posted by **Timofey** on Saturday, August 11, 2012 at 11:21am.

(7*n) - 1 is divisible by 6.

I have that it is divisble when n=1, but not n=2 and so on. How should I write the inductive proofs?

- Calculus -
**Steve**, Saturday, August 11, 2012 at 12:50pmIt's obviously not true.

7*2-1 = 13 which is not divisible by 6

I think you mean 7^n-1 is divisible by 6

when n=1, 7^1-1 = 7-1 = 6 is divisible by 6

assume for n=k

when n=k+1,

7^(k+1)-1 = 7*7^k - 1

= 7*7^k -7 + 6

= 7(7^k-1) + 6

but, 7^k-1 is divisible by 6, and 6 is divisible by 6, so 7(7^k-1)+6 is divisible by 6

since 6a+6b = 6(a+b)

**Related Questions**

Math - Use mathematical induction to prove that 5^(n) - 1 is divisible by four ...

Calculus - Use mathematical induction to prove that each proposition is valid ...

Discrete Math - Use mathematical induction to prove the truth of each of the ...

Algebra - Prove by mathematical induction that 3^(3n+1) + 2^(n+1) is divisible ...

MATHS - prove by mathematical induction that 7^n+4^n+1 is divisible by 6

maths - prove by mathematical induction that 7n+4n+1 is divisible by 6

Discrete Math - Use mathematical induction to prove the truth of each of the ...

Math - Use mathematical induction to prove that 2^(3n) - 3^n is divisible by 5 ...

Calculus - Use mathematical induction to prove that the statement holds for all ...

Mathematical induction. I'm stuck. So far I have.. - For all integers n ≥ ...