Prove that it is divisible by 8.

  • Thread starter Thread starter Michael_Light
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on proving that the expression 9n - 1 is divisible by 8 for positive integers n. Participants suggest using mathematical induction as a method to demonstrate this property. The conversation highlights the importance of modular arithmetic, specifically examining the behavior of 9 modulo 8 and the implications of multiplying by powers of 9. The conclusion emphasizes that understanding these modular relationships is crucial for the proof.

PREREQUISITES
  • Understanding of modular arithmetic, specifically modulo 8
  • Familiarity with mathematical induction techniques
  • Basic knowledge of exponents and their properties
  • Ability to manipulate algebraic expressions
NEXT STEPS
  • Study the principles of mathematical induction in depth
  • Learn about modular arithmetic and its applications
  • Explore the properties of exponents, particularly in modular contexts
  • Practice proving divisibility rules using induction and modular arithmetic
USEFUL FOR

Students in mathematics, educators teaching number theory, and anyone interested in proofs involving divisibility and modular arithmetic.

Michael_Light
Messages
112
Reaction score
0

Homework Statement



Prove 9n-1 is divisible by 8 such that n is positive integer.

Homework Equations





The Attempt at a Solution



It looks simple and i tried to apply everything i know but yet i can't prove it. Any hints?
 
Physics news on Phys.org
Do you know modular (clock) arithmetic? What is 9 modulo 8? What about 92? What happens each time you multiply by another factor of 9?

(If you aren't familiar with this device, think about a clock with "hours" from 0 to 7 [eight positions]. Start at "0" and count 9 "hours" forward; where do you end up? What happens for multiples of 9? Where is 92? What happens with higher powers of 9?

Also, where are all multiples of 8 located on the clock?)
 
Last edited:
Michael_Light said:

Homework Statement



Prove 9n-1 is divisible by 8 such that n is positive integer.

Homework Equations


The Attempt at a Solution



It looks simple and i tried to apply everything i know but yet i can't prove it. Any hints?

Hi Michael. It's very easy if you use induction.

Consider how you could write (9^{n+1} - 1) in terms of (9^n-1).
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
5K
Replies
3
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
17
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
14
Views
5K
  • · Replies 21 ·
Replies
21
Views
4K