On the equation x2-Dy2=n

Abstract

We propose a method to determine the solvability of the diophantine equation x2-Dy2=n for the following two cases: (1) D=pq, where p,q 1 4 are distinct primes with (qp)=1 and (pq)4(qp)4=-1. (2) D=2p1p2... pm, where pi 1 8,1≤ i≤ m are distinct primes and D=r2+s2 with r,s 3 8.

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…