Abstract
Let P(m) denote the largest prime factor of an integer m ≥ 2, and put P(0) = P(1) = 1. For an integer k ≥ 2, let [Formula: see text] be the k-generalized Fibonacci sequence which starts with 0, …, 0, 1 (k terms) and each term afterwards is the sum of the k preceding terms. Here, we show that if n ≥ k+2, then [Formula: see text]. Furthermore, we determine all the k-Fibonacci numbers [Formula: see text] whose largest prime factor is less than or equal to 7.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
