Sharp bounds on the number of squares in recurrence sequences and solutions of X2-( a2+b ) Y4=-b

Abstract

We obtain best possible results for the number of coprime positive integer solutions of the equation in the title when a is a positive integer, b=pm, 2pm or 4pm, where m is a non-negative integer, p is prime, ( a2, b ) is squarefree and X2- ( a2+b ) Y2=-4 has a solution in positive integers. We prove our results by establishing best possible bounds for the number of distinct squares in certain binary recurrence sequences, including those associated with such equations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…