The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
On the Diophantine Equation n(n + d) · · · (n + (k − 1)d) = byl
Open accessAbstract
We show that the product of four or five consecutive positive terms in arithmetic progression can never be a perfect power whenever the initial term is coprime to the common difference of the arithmetic progression. This is a generalization of the results of Euler and Obláth for the case of squares, and an extension of a theorem of Győry on three terms in arithmetic progressions. Several other results concerning the integral solutions of the equation of the title are also obtained. We extend results of Sander on the rational solutions of the equation in n, y when b = d = 1. We show that there are only finitely many solutions in n, d, b, y when k ≥ 3, l ≥ 2 are fixed and k + l > 6.
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
Cites
Modular Elliptic Curves and Fermat's Last Theorem
Wiles, A. (1995) · The Annals of Mathematics · doi:10.2307/2118559 · Cited by 2,060 · cited 4×
“In [18], Saradha and Shorey gave the following result on a more general Fermat equation by using the contributions of Wiles [26], Ribet [13] and others.”
MethodResultInfluentialUnsolved Problems in Number Theory
Guy, R. K. (1994) · Problem Books in Mathematics · doi:10.1007/978-1-4899-3585-4 · Cited by 1,175
Ternary Diophantine Equations via Galois Representations and Modular Forms
Bennett, M. A., & Skinner, C. M. (2004) · Canadian Journal of Mathematics · doi:10.4153/cjm-2004-002-2 · Cited by 200
Winding quotients and some variants of Fermat's Last Theorem.
(1997) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1997.490.81 · Cited by 169
Exponential Diophantine Equations Involving Products of Consecutive Integers and Related Equations
Shorey, T. N. (2000) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-7023-8_22 · Cited by 34
Exponential Diophantine Equations Involving Products of Consecutive Integers and Related Equations
Shorey, T. N. (2000) · Hindustan Book Agency · doi:10.1007/978-93-86279-02-6_22 · Cited by 20
Cited by
Bugeaud, Y., Mignotte, M., & Siksek, S. (2006) · Annals of Mathematics · doi:10.4007/annals.2006.163.969 · Cited by 386
Modular Forms, a Computational Approach
Stein, W. (2007) · Graduate Studies in Mathematics · doi:10.1090/gsm/079 · Cited by 297
Metadata
- Authors
- Győry, K., Hajdu, L., & Saradha, N.
- Venue
- Canadian Mathematical Bulletin
- Publisher
- Canadian Mathematical Society
- Published
- 2004-09-01
- Volume
- 47
- Issue
- 3
- Pages
- 373-388
- ISSN
- 0008-4395 (ISSN-L)
- 1496-4287
- OpenAlex
- W2284242454
- Cited by
- 330
- References
- 6
- FWCI
- 23.32
- Type
- journal article
- Language
- en
- Open access
- bronze
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 the Diophantine Equation n(n + d) · · · (n + (k − 1)d) = byl. https://app.cochat.ai/papers/10.4153/cmb-2004-037-1
- The paper
- Győry, K., Hajdu, L., & Saradha, N. (2004). On the Diophantine Equation n(n + d) · · · (n + (k − 1)d) = byl. Canadian Mathematical Bulletin. https://doi.org/10.4153/cmb-2004-037-1
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.