On big primitive divisors of Fibonacci numbers
Abstract
In this note, we prove that for any given positive integer , when n is bigger than a constant explicitly depending on , the n-th Fibonacci number has a primitive divisor not less than (+1)n-1.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.