A Note on Integer Solutions of the Diophantine Equation x2-dy2=1
J. A. H. Hunter
Abstract
Open-access reader
J. A. H. Hunter
Abstract
Open-access reader
In the equation dis any positive integer which is not a perfect square. For convenience we shall consider only those solutions of (1) for which x and yare both positive. All the others can be obtained from these. In fact, it is well known that if (x0, y0) is the minimum positive integer solution of (1), then all integer solutions (x, y) are given by and, in particular, all positive integer solutions are given by
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In the equation dis any positive integer which is not a perfect square. For convenience we shall consider only those solutions of (1) for which x and yare both positive. All the others can be obtained from these. In fact, it is well known that if (x0, y0) is the minimum positive integer solution of (1), then all integer solutions (x, y) are given by and, in particular, all positive integer solutions are given by
Key concepts: Integer (computer science), Diophantine equation, Mathematics, Half-integer, Radical of an integer, Square (algebra), Combinatorics, Discrete mathematics