Abstract
Let be the sequence of Fibonacci numbers and let be a prime. For an integer we write for the number of distinct representations of as with and . We prove that .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.