The Diophantine Equation n ! + 1 = m2
From MaRDI portal
Publication:4294029
DOI10.1112/BLMS/25.2.104zbMATH Open0805.11030OpenAlexW1968867302MaRDI QIDQ4294029FDOQ4294029
Authors: Marius Overholt 
Publication date: 5 February 1995
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/25.2.104
Recommendations
Cited In (21)
- Title not available (Why is that?)
- Title not available (Why is that?)
- k-Diophantine m-tuples in finite fields
- On the finiteness of solutions for polynomial-factorial Diophantine equations
- Sums or products of double factorials in Lucas sequences
- On factorials which are products of factorials
- On the finiteness of solutions for certain Diophantine equations
- On polynomial-factorial diophantine equations
- Variants of the Brocard-Ramanujan equation
- A common approach to three open problems in number theory
- Existence of the solutions to the Brocard–Ramanujan problem for norm forms
- A note on a problem of Brocard-Ramanujan
- Variants of the Diophantine equation \(n! + 1 = y^2\)
- A weak effective \(abc\)-conjecture
- Some observations on the Diophantine equation \(y^2=x!+A\) and related results
- Variations on the Brocard-Ramanujan equation
- Product of factorials equal another product of factorials
- On the variant \(Q(n!)=P(x)\) of the Brocard-Ramanujan Diophantine equation
- Power savings for counting solutions to polynomial-factorial equations
- The equation \(1^p+2^p+3^p+\ldots+n^p=m^q\)
- On a conjecture of Erdős and Stewart
This page was built for publication: The Diophantine Equation n ! + 1 = m2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294029)
