English

On the equation $x^2-Dy^2=n$

Number Theory 2011-02-21 v1

Abstract

We propose a method to determine the solvability of the diophantine equation x2Dy2=nx^2-Dy^2=n for the following two cases: (1)(1) D=pqD=pq, where p,q1mod4p,q\equiv 1 \mod 4 are distinct primes with (qp)=1(\frac{q}{p})=1 and (pq)4(qp)4=1(\frac{p}{q})_4(\frac{q}{p})_4=-1. (2)(2) D=2p1p2...pmD=2p_1p_2... p_m, where pi1mod8,1imp_i\equiv 1 \mod 8,1\leq i\leq m are distinct primes and D=r2+s2D=r^2+s^2 with r,s±3mod8r,s \equiv \pm 3 \mod 8.

Keywords

Cite

@article{arxiv.1102.3811,
  title  = {On the equation $x^2-Dy^2=n$},
  author = {Dasheng Wei},
  journal= {arXiv preprint arXiv:1102.3811},
  year   = {2011}
}

Comments

19pp

R2 v1 2026-06-21T17:28:23.704Z