Prove by Induction: 13n - 6n Divisible by 7

  • Context: Undergrad 
  • Thread starter Thread starter pauliedangerous
  • Start date Start date
  • Tags Tags
    Induction
Click For Summary
SUMMARY

The discussion focuses on proving by induction that for every positive integer n, the expression 13n - 6n is divisible by 7. The base case is established with n = 1, yielding 7, which is divisible by 7. The inductive step involves demonstrating that if the expression holds for n = k, it also holds for n = k + 1. The user struggles with the transition from the inductive hypothesis to the next step, particularly in manipulating the expressions correctly.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with algebraic manipulation of expressions
  • Knowledge of divisibility rules
  • Basic experience with sequences and series
NEXT STEPS
  • Study the principles of mathematical induction in detail
  • Practice algebraic manipulation techniques for complex expressions
  • Explore examples of divisibility proofs in number theory
  • Learn about recursive sequences and their properties
USEFUL FOR

Students in mathematics, particularly those studying number theory or discrete mathematics, as well as educators looking for examples of induction proofs.

pauliedangerous
Messages
4
Reaction score
0
can anyone help me with this - my notes make this slightly confusing and struggling to finsih it.

prove by induction that fo0r every positive integer (n) that 13n - 6n is divisible by 7

ive got so far:

(n = 1) = 13(1) - 6(1) = 7 which is divisible by 7

n(k+1) = 13(k+1) - 6(k+1)
= 13(1).13(k) - 6(1).6(k)
= 13.13k - 6.6k

then stuck as my notes with examples give calculations tht i don't usnderstand where they come from il post them if you can explain it.

example from my notes:

Question 8: Where n is an integer prove that the expression 7n – 2n is exactly divisible by 5.
Hint: 7k+1 – 2k+1 can be written as 7k.71 – 2k.21 i.e. 7k.7 – 2k.2

Question 8: It holds for P(1) = 71 – 21 = 5 which is exactly divisible by 5.
Inductive step: Consider P(k+1) assuming P(k) is true.
P(k +1) = 7k+1 – 2k+1
= 71.7k - 21.2k
= 7.7k - 2.2k
= 7k + 6.7k - 2k - 2k splitting up the terms 7.7k and 2k
= (7k - 2k) + 6.7k - 2k and (7k - 2k) = P(k)
= P(k) + 6.7k - 2k
= P(k) + 5.7k + 7k - 2k splitting up the term 6.7k
= P(k) + 5.7k + P(k) 7k - 2k is P(k)
This expression and thus P(k+1) is exactly divisible by 5 since both expressions P(k) and 5.7k are exactly divisible by 5.

P(1) is true and P(k)→P(k+1), so by the principle of induction P(n) holds for all n.


thanks for any help
 
Physics news on Phys.org
You have:
p(k+1) = 13(k+1) - 6(k+1)
= 13(1).13(k) - 6(1).6(k)
= 13.13k - 6.6k

Note 13x = 12x + x and 6y = 5y + y. Let x = 13k and y = 6k.

You can continue as:
p(k+1) = 12 13k + 13k - (5 6k + 6k) = 12 13k - 5 6k + (13k - 6k) = 156k - 30k + p(k)
...

You should pay attention to your parentheses, e.g. 7k + 1 is different from 7(k+1).
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 5 ·
Replies
5
Views
2K