Help with Mathematical Induction

AI Thread Summary
The discussion focuses on proving by mathematical induction that the expression (2^(n+1) + 9(13^n)) is divisible by 11 for all positive integers. Participants emphasize the importance of establishing a base case and assuming the proposition holds for n = k to demonstrate it for n = k+1. There is a suggestion to utilize modular arithmetic to simplify the proof process. The conversation includes some confusion about identities, with one participant clarifying their intent to assist. Overall, the key steps in the induction process are highlighted as essential for solving the problem.
SeattleScoute
Messages
2
Reaction score
0

Homework Statement



Prove by matematical induction that (2^(n+1)+9(13^n)) divides by by 11 for all positive intergers


Homework Equations





The Attempt at a Solution



I really have no idea where to start...
 
Physics news on Phys.org
The problem outright tells you a place to start!
 
Is P1 true? If so, then if I say Pk is true is Pk+1 also true?
 
jegues said:
Is P1 true? If so, then if I say Pk is true is Pk+1 also true?
Are you also SeattleScoute?

That's basically what is needed. Establish a base case. Assume the proposition is true for n = k. Show that P(k) being true implies that P(k+1) is also true.
 
Are you also SeattleScoute?

No I'm not, I thought I'd help :S
 
you may use modular arithmetic to lighten your job .
 
Back
Top