In this note, we prove that for any given positive integer κκ, when nn is bigger than a constant explicitly depending on κκ, the nn-th Fibonacci number has a primitive divisor not less than (κ+1)n−1(κ+1)n−1.
生成讲解博客的中文版本
生成AI智能校验的中文版本