Completely $p$-primitive binary quadratic forms
Number Theory
2017-09-08 v2
Abstract
Let be a binary quadratic form with integer coefficients. For a prime not dividing the discriminant of , we say is completely -primitive if for any non-zero integer , the diophantine equation has always an integer solution with whenever it has an integer solution. In this article, we study various properties of completely -primitive binary quadratic forms. In particular, we give a necessary and sufficient condition for a definite binary quadratic form to be completely -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