English

Completely $p$-primitive binary quadratic forms

Number Theory 2017-09-08 v2

Abstract

Let f(x,y)=ax2+bxy+cy2f(x,y)=ax^2+bxy+cy^2 be a binary quadratic form with integer coefficients. For a prime pp not dividing the discriminant of ff, we say ff is completely pp-primitive if for any non-zero integer NN, the diophantine equation f(x,y)=Nf(x,y)=N has always an integer solution (x,y)=(m,n)(x,y)=(m,n) with (m,n,p)=1(m,n,p)=1 whenever it has an integer solution. In this article, we study various properties of completely pp-primitive binary quadratic forms. In particular, we give a necessary and sufficient condition for a definite binary quadratic form ff to be completely pp-primitive.

Keywords

Cite

@article{arxiv.1705.04283,
  title  = {Completely $p$-primitive binary quadratic forms},
  author = {Byeong-Kweon Oh and Hoseog Yu},
  journal= {arXiv preprint arXiv:1705.04283},
  year   = {2017}
}

Comments

10 pages

R2 v1 2026-06-22T19:44:24.239Z