Abstract
A generalization of the Fibonacci sequence is the k-generalized Fibonacci sequence (F () )n ≥ 2 − k with some fixed integer k ≥ 2 whose first k terms are 0,…, 0, 1 and each term afterward is the sum of the preceding k terms. Carmichael’s primitive divisor theorem ensures that all members after the twelfth of the Fibonacci sequence are multiplicatively independent. Although there is no version of this theorem for k-generalized Fibonacci sequences with k > 2, here we find all the pairs of k-Fibonacci numbers that are multiplicatively dependent.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.