Abstract
A Lucas polynomial sequence is a pair of generalized polynomial sequences that satisfy the Lucas recurrence relation. Special cases include Fibonacci polynomials, Lucas polynomials, and Balancing polynomials. We define the (a,b)-type Lucas polynomial sequences and prove that their Melham’s sums have some interesting divisibility properties. Results in this paper generalize the original Melham’s conjectures.
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.
