Divisibility problem cant use module just induction

Click For Summary

Discussion Overview

The discussion revolves around proving that 5 divides \(8^n - 3^n\) for natural numbers \(n\) using mathematical induction, without employing modular arithmetic. Participants explore the induction process and share their reasoning and approaches.

Discussion Character

  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • William initiates the discussion by stating the problem and noting that he can prove it for \(n = 1\) but struggles with the induction step for \(n = k + 1\).
  • One participant suggests that if 5 divides \(X\) and \(Y - X\), then 5 should divide \(Y\), prompting William to consider how to apply this to his proof.
  • Another participant points out that the relationship \(8 = 5 + 3\) could be useful in the proof.
  • William presents his induction hypothesis, assuming \(5\) divides \(8^k - 3^k\), and attempts to show that \(5\) divides \(8^{k+1} - 3^{k+1}\) through algebraic manipulation.
  • He breaks down the expression into two parts, indicating that one part is divisible by \(5\) by the induction hypothesis and the other part is \(5\) itself.
  • William expresses uncertainty about his reasoning and asks for feedback on potential errors or hints for improvement.
  • A participant expresses confidence in William's approach, suggesting he has successfully demonstrated the proof.

Areas of Agreement / Disagreement

There is no explicit consensus reached among participants, but some express confidence in William's reasoning while others seek clarification or further hints.

Contextual Notes

Participants do not fully resolve the mathematical steps or assumptions involved in the proof, leaving some aspects of the discussion open to interpretation.

Willy_Will
Messages
15
Reaction score
0
Hi all,

Great forum, I have been reading some cool stuff here for about a month.

Heres my question:
Using induction prove that 5 divides 8^n - 3^n, n Natural Number.

I know its true for n = 1, but I get stuck on the n = k+1. I don't know how to proceed from here: 8(8^k) - 3(3^k)

Also, I KNOW this is very easy using mod 5 but I can't do it here, I HAVE to prove it using only induction.

Any hints?

Thanks,

-William
 
Physics news on Phys.org
If 5 divides X and you show that 5 divides Y-X, does 5 divide Y?
 
I think so, but how can I use that in my problem?
 
The fact that 8= 5+ 3 is very useful here!
 
I think I've got it.

Suppose that 5 divides 8^k - 3^k ---> 8^k - 3^k = 5x, for some integer x.

case n = k +1
= 8^k+1 - 3^k+1
= 8(8^k) - 3(3^k)
= 8(8^k) - (3^k)(8) + (3^k)(8) - (3)(3^k)
= 8(8^k - 3^k) + 3^k(8 - 3)
(1) (2)

(1) by hypotesis 5 divides the expresion.
(2) 5 = 8 - 3, 5 divides 5.

= 8(5x) + 3^k(5)
= 5(8x + 3^k)

5 divides the expresion

Please tell me its that way, if not, point the errors and some hints.

Thanks, really.

-William
 
Last edited:
I think I've got it.

Suppose that 5 divides 8^k - 3^k ---> 8^k - 3^k = 5x, for some integer x.

case n = k +1
= 8^k+1 - 3^k+1
= 8(8^k) - 3(3^k)
= 8(8^k) - (3^k)(8) + (3^k)(8) - (3)(3^k)
= 8(8^k - 3^k) + 3^k(8 - 3)
(1) (2)

(1) by hypotesis 5 divides the expresion.
(2) 5 = 8 - 3, 5 divides 5.

= 8(5x) + 3^k(5)
= 5(8x + 3^k)

5 divides the expresion

Please tell me its that way, if not, point the errors and some hints.

Thanks, really.

-William
 
sorry for the double post.

(1) = (8^k - 3^k)
(2) = (8 - 3)

(1) by hypotesis 5 divides the expresion.
(2) 5 = 8 - 3, 5 divides 5.

= 8(5x) + 3^k(5)
= 5(8x + 3^k)

5 divides the expresion
 
By George, I think he's got it!
 
Thanks guys, I really appreciate it!
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
Replies
8
Views
5K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
Replies
21
Views
3K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 9 ·
Replies
9
Views
3K