Abstract
Let f(x,y)=ax2+bxy+cy2 be a binary quadratic form with integer coefficients. For a prime p not dividing the discriminant of f, we say f is completely p-primitive if for any non-zero integer N, the diophantine equation f(x,y)=N always has an integer solution (x,y)=(m,n) with (m,n,p)=1 whenever it has an integer solution. In this article, we study various properties of completely p-primitive binary quadratic forms. In particular, we give a necessary and sufficient condition for a definite binary quadratic form f to be completely p-primitive.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
