Mathmatical Induction Problem (Divisibility)

Click For Summary
The discussion revolves around using Mathematical Induction to prove that the expression 12^n + 2(5^{n-1}) is divisible by 7 for all positive integers n. The initial step confirms the base case for n = 1, showing it is divisible by 7. The user then attempts to assume the statement holds for n = k and seeks to prove it for n = k + 1 but struggles with the algebraic manipulation. After some back-and-forth, a realization occurs that simplifies the process, leading to a clearer path for the proof. The user expresses frustration with induction problems but ultimately finds clarity in the next steps.
Kb1jij
Messages
19
Reaction score
0

Homework Statement


Use Mathematical Induction to prove that 12^n + 2(5^{n-1}) is divisible by 7 for all n \in Z^+

Homework Equations


The Attempt at a Solution



First, show that it works for n = 1:
12^1 + 2 \cdot 5^0 = 14 , 14/7 = 2

Next assume:
12^k + 2(5^{k-1}) = 7A

Then, prove for k + 1:
12^{k+1} + 2(5^k)

I can't figure out how to prove this. I know that this can be changed to:
12 \cdot 12^{k} + 2 \cdot 5 (5^{k-1})
But that doesn't seem to help me much.

I also tried substituting values for 12^k and 5^(k-1) from above:
12^k = 7A - 2(5^{k-1})
2(5^{k-1}) = 7A - 12^k

This doesn't seem too help either, I can reduce it to:
189A - (12 \cdot 2(5^{k-1})+5(12^k))

Any suggestions?
Thanks,
Tom
 
Physics news on Phys.org
Actually, having come till

12.12^k + 2.5(5^{k-1}),

the next step should have been

7.12^k + 5.12^k + 2.5(5^{k-1}).
 
Ah, got it now. Thank you. I don't like these induction problems...
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
3
Views
3K
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K