{"paper":{"title":"Completely $p$-primitive binary quadratic forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Byeong-Kweon Oh, Hoseog Yu","submitted_at":"2017-05-11T16:53:32Z","abstract_excerpt":"Let $f(x,y)=ax^2+bxy+cy^2$ 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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04283","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}