Big Prime Factors of Linear Recurrent Sequences
- A+
：Haojie Hong (University of Bordeaux)
： 2024-11-01 11:00
：Conference Room C503 at Administration Building at Haiyun Campus
Speaker：Haojie Hong (University of Bordeaux)
Time：2024-11-1, 11:00
Location：Conference Room C503 at Administration Building at Haiyun Campus
Abstract:
Lucas sequences $U_n$ are the second-order simple non-degenerated linear recurrent sequences with the first two terms being $U_0=0$ and $U_1=1$. A typical example is the Fibonacci sequence. The divisibility properties of such sequences have been studied a lot. Let $P_n$ be the largest prime factor of $U_n$. In 2013, Stewart proved that $P_n$ grows faster than $n$. In this talk, I will present Stewart's theorem and some related results we have obtained.
