How can we use hints to prove divisibility of Fibonacci numbers?

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
Click For Summary
SUMMARY

This discussion focuses on proving that if \( m = n^{13} - n \) for \( n > 1 \), then \( 30290 \mid F_m \), where \( F_m \) is the \( m \)-th Fibonacci number. The initial step involves demonstrating that \( a^{13} \equiv a \mod{2730} \), which is derived using Fermat's Little Theorem across the prime factors of 2730: 2, 3, 5, 7, and 13. The participants suggest leveraging the property \( n \mid m \Rightarrow F_n \mid F_m \) to further establish the divisibility of Fibonacci numbers.

PREREQUISITES
  • Understanding of Fibonacci numbers and their properties
  • Fermat's Little Theorem and modular arithmetic
  • Knowledge of prime factorization, specifically of 2730
  • Basic concepts of divisibility in number theory
NEXT STEPS
  • Research the properties of Fibonacci numbers related to divisibility
  • Study the implications of Fermat's Little Theorem in modular arithmetic
  • Explore the relationship between Fibonacci numbers and their indices
  • Investigate advanced number theory concepts such as Lucas sequences
USEFUL FOR

Mathematicians, number theorists, and students interested in advanced properties of Fibonacci numbers and modular arithmetic.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

I want to show that if $m=n^{13}-n$ and $n>1$ then $30290 \mid F_m$. (Hint: Show first that $a^{13} \equiv a \mod{2730}$.)

$F_m$ is the $m$-th Fibonacci number.I have shown the hint as follows:

$2730=2 \cdot 3 \cdot 5 \cdot 7 \cdot 13$.

Using Ferma's little theorem, we deduce that $a^{13}\equiv a \pmod{5}$, $a^{13}\equiv a \pmod{2}$, $a^{13}\equiv a \pmod{3}$, $a^{13}\equiv a \pmod{7}$ and $a^{13}\equiv a \pmod{13}$.Since $2,3,6,7,13$ are all relatively prime, we deduce that $2730 \mid a^{13}-a$.

But how can we use the fact that $a^{13} \equiv a \mod{2730}$ in order to deduce that $30290 \mid F_m$ ? (Thinking)
 
Mathematics news on Phys.org
Hey evinda! (Wave)

I think we need another hint.
Something like $n\mid m \Rightarrow F_n \mid F_m$.
Can we use that? Or something else? (Wondering)
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
9
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K