Every (Nonzero) Integer Divides Some Fibonacci Number

Explanations 6

• We denote the Fibonacci sequence as (Fn)(F_n)(Fn​) where F1=F2=1F_1=F_2=1F1​=F2​=1 and Fn+2=Fn+1+FnF_{n+2}=F_{n+1}+F_nFn+2​=Fn+1​+Fn​ for n≥1n\ge 1n≥1. What we want to prove is …

  By Kada Williams

• Prove that there is a Fibonacci number with 201520152015 zeros at its tail.

  By amaterasu, Moor Xu

• Prove that, there is a Fibonacci number which has 201520152015 zeros in its tail.

  By amaterasu

• Prove that for any integer m≥2m\ge 2m≥2 and for any integer aaa relatively prime to mmm, there exists a positive integer exponent kkk for which m∣ak−1m\mid a^k-1m∣ak−1.

  By Kada Williams

• Prove the estimate π(m)≤m2−1\pi(m)\le m^2-1π(m)≤m2−1.

  By Kada Williams

• Prove that there is a Fibonacci number whose base 101010 representation ends with 999999999999999999.

  By Kada Williams