The DOI matches its Crossref record.
The Least Quadratic Non Residue
Abstract
This, the problem of the least quadratic non residue, has often been investigated. The best result is due to Vinogradov, who proved that (1) n(k) = O(k1I(2Ve) where n(k) denotes the least positive quadratic non residue of the prime k. Also, several interesting results about n(k) have been obtained by A. Brauer through elementary methods. It has been conjectured that n(k) ko(E). This was first proved by Linnik on the assumption of the extended Riemann Hypothesis (E.R.H.). Recently, with the same hypothesis, S. Chowla and P. Erdds have improved Linnik's result to n(k) = O(exp ((log k)i+e)) In this paper I prove on the basis of the E.R.H. (2) n(k) = O((log k)2) S. Chow-la has proved that there exist infinitely many primes k where the first cl log k residues (mod k) are all quadratic residues. Hence, the upper bound on (2) cannot be improved beyond O(log k). The two results, the upper and lower bounds, are now not too far apart. The best possible bound for n(k) is probably not the bound in (2). One COuld(1 improve the bound in (2) by methods in this paper if one could derive any non trivial estimate in terms of k on
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Riemann's hypothesis and tests for primality
Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Metadata
- Authors
- Ankeny, N. C.
- Venue
- The Annals of Mathematics
- Publisher
- JSTOR
- Published
- 1952-01
- Volume
- 55
- Issue
- 1
- Pages
- 65
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W2040296694
- Cited by
- 211
- References
- 0
- FWCI
- 1.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Least Quadratic Non Residue. https://app.cochat.ai/papers/10.2307/1969420
- The paper
- Ankeny, N. C. (1952). The Least Quadratic Non Residue. The Annals of Mathematics. https://doi.org/10.2307/1969420
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.