Melham's Conjecture on Odd Power Sums of Fibonacci Numbers

preprint2015arXivOpen access

Abstract

Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative both vanish at 11, and will be an integer polynomial after multiplying it by a product of the first consecutive Lucas numbers of odd order. This presents an affirmative answer to a conjecture of Melham.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.