MHB Proof by Induction: Solving 34n-1 Divisible by 80

  • Thread starter Thread starter Damo
  • Start date Start date
  • Tags Tags
    Induction Proof
Click For Summary
SUMMARY

The discussion focuses on proving that \(34n - 1\) is divisible by 80 using mathematical induction. Participants highlight the importance of verifying that \(3^{4n} - 1\) is congruent to zero modulo 16 and modulo 5, establishing that \(3^{4n} \equiv 1 \pmod{16}\) and \(3^{4n} \equiv 1 \pmod{5}\). The proof is further simplified by expressing \(3^{4n} - 1\) as \(80(81^{n-1} + 81^{n-2} + \cdots + 1)\), confirming divisibility by 80. The discussion concludes with a participant expressing newfound clarity on communicating these concepts to students.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with modular arithmetic
  • Knowledge of congruences, specifically modulo 16 and modulo 5
  • Basic algebraic manipulation of exponents
NEXT STEPS
  • Study the principles of mathematical induction in detail
  • Learn about modular arithmetic and its applications
  • Explore proofs involving congruences, particularly in number theory
  • Practice problems on divisibility and induction proofs
USEFUL FOR

Mathematics educators, students learning mathematical induction, and anyone interested in number theory and proof techniques.

Damo
Messages
4
Reaction score
0
As a student, proofs always troubled me, now as a teacher they are still causing me grief.
How would you do this one?

Prove 34n - 1 is divisible by 80.

I understand the process, setting the base and writing as n=k, then n=k+1 etc. But this has stumped me.
 
Physics news on Phys.org
Try adding:

$$\left(3^{4(n+1)}-1\right)-\left(3^{4n}-1\right)=80\cdot3^{4n}$$

to your induction hypothesis. :D
 
Hi,

$80=2^4 5$, so you need to check that $3^{4n}-1$ is zero modulo 16 and zero modulo 5 for every $n$.

$3^4=81 \equiv 1 \ (mod \ 16)$ so $3^{4n}\equiv 1 \ (mod \ 16)$.

$3^4=81 \equiv 1 \ (mod \ 5)$ so $3^{4n}\equiv 1 \ (mod \ 5)$.

so it must be divisible by 80.

PS: MarkFL was faster =P
 
Or even more directly:
$$3^{4n} - 1 \equiv \left ( 3^{4} \right )^n - 1 \equiv 81^n - 1 \equiv 1^n - 1 \equiv 1 - 1 \equiv 0 \pmod{80}$$
Alternative proof:
$$3^{4n} - 1 = \left ( 3^{4} \right )^n - 1 = 81^n - 1 = 80 \left ( 81^{n - 1} + 81^{n - 2} + \cdots + 1 \right )$$
Of course, neither uses induction, but still.
 
MarkFL said:
Try adding:

$$\left(3^{4(n+1)}-1\right)-\left(3^{4n}-1\right)=80\cdot3^{4n}$$

to your induction hypothesis. :D

I understand the Left hand side of this equation but where/why is the right hand side $$80\cdot3^{4n}$$?
 
Damo said:
I understand the Left hand side of this equation but where/why is the right hand side $$80\cdot3^{4n}$$?

If follows by simplification:

$$\left(3^{4(n+1)}-1\right)-\left(3^{4n}-1\right)=3^{4(n+1)}-3^{4n}=3^{4n+4}-3^{4n}=81\cdot3^{4n}-3^{4n}=80\cdot3^{4n}$$
 
Thank you guys for your responses. I think I have it now and will now work on how to communicate it to my students. We are doing a brief intro to mathematical induction in class on Thursday and I was feeling underprepared!

Thanks for your help!
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
8
Views
3K