Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 93 tok/s
Gemini 2.5 Pro 35 tok/s Pro
GPT-5 Medium 28 tok/s
GPT-5 High 30 tok/s Pro
GPT-4o 81 tok/s
GPT OSS 120B 439 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

Completely $p$-primitive binary quadratic forms (1705.04283v2)

Published 11 May 2017 in math.NT

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$ has always 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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.