The DOI matches its Crossref record.
On Some Sequences of Integers
Abstract
Abstract. An infinite sequence a1 <a2 <·· · is d-complete if every sufficiently large integer is the sum of ai such that no one divides the other. We investigate d-completeness of sets of the form {p α q β} and {p α q β r γ} with α, β, γ nonnegative. 1.
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
New applications of the polynomial method: The cap set conjecture and beyond
Grochow, J. (2018) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1648 · Cited by 16
“This conjecture is often attributed to Erdős and Turán’s 1936 paper [48], but the conjecture does not appear there in print—even as a question— and in his later writings, including a touching tribute to Turán [41, p. 40], although Erdős raises the problem in connection with his work on the primes with Turán, he r…”
BackgroundInfluentialLenstra, A. K., Kleinjung, T., & Thomé, E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42001-6_9 · Cited by 13
Metadata
- Authors
- Erdös, P., & Turán, P.
- Venue
- Journal of the London Mathematical Society
- Publisher
- Wiley
- Published
- 1936-10
- Volume
- s1-11
- Issue
- 4
- Pages
- 261-264
- ISSN
- 0024-6107 (ISSN-L)
- OpenAlex
- W2009196521
- Cited by
- 310
- References
- 0
- FWCI
- 0.00
- 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: On Some Sequences of Integers. https://app.cochat.ai/papers/10.1112/jlms/s1-11.4.261
- The paper
- Erdös, P., & Turán, P. (1936). On Some Sequences of Integers. Journal of the London Mathematical Society. https://doi.org/10.1112/jlms/s1-11.4.261
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.
