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

  • Thread starter Thread starter evinda
  • Start date Start date
AI Thread Summary
To prove that 30290 divides the Fibonacci number F_m, where m=n^13-n and n>1, it is essential to first establish that a^13 ≡ a (mod 2730). This is shown using Fermat's Little Theorem for the prime factors of 2730, confirming that 2730 divides a^13-a. The next step involves leveraging the relationship that if n divides m, then F_n divides F_m. Participants suggest that additional hints or properties may be necessary to connect the established modular equivalence to the divisibility of F_m by 30290. The discussion emphasizes the need for further exploration of Fibonacci properties in relation to divisibility.
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)
 
Thread 'Video on imaginary numbers and some queries'
Hi, I was watching the following video. I found some points confusing. Could you please help me to understand the gaps? Thanks, in advance! Question 1: Around 4:22, the video says the following. So for those mathematicians, negative numbers didn't exist. You could subtract, that is find the difference between two positive quantities, but you couldn't have a negative answer or negative coefficients. Mathematicians were so averse to negative numbers that there was no single quadratic...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top