No label defined (Q4668068)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2158229
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2158229

      Statements

      0 references
      0 references
      18 April 2005
      0 references
      representation problems
      0 references
      computer solution of Diophantine equations
      0 references
      A very well-known Diophantine equation is the equation \[ n! + 1 = y^2, \] called the Brocard-Ramanujan equation. The only known solutions to this equation are \((n,x) = (4,5),(5,11),(7,71).\) \textit{M. Overholt} proved [Bull. Lond. Math. Soc. 25, No. 2, 104 (1993; Zbl 0805.11030)] that the weak form of Szpiro's conjecture (a special case of the \(abc\)-conjecture) implies that the Brocard-Ramanujan equation has only finitely many solutions. Many extensions of the Brocard-Ramanujan equation have been studied. That is the case in this paper. In fact, the authors first consider the equation \[ P(n) n! + x^q = y^q, \] where \(y\) is odd and \(P \in \mathbb Z [X]\) is a polynomial of any degree. They use a \(p\)-adic linear form in logarithms to prove that any solution \((n,x,y)\) to this equation verifies \[ \frac{2^n}{n+1} < y^{4000\log^2(2) \log^2(q)}. \] In the second part of the paper, the authors use a computational method to prove that, for \(n \leq 10^5\), the equation \[ \prod_{\substack{ k=1\\ k \neq n}}^n k + 1 = y^2 \] has no solutions, except for \(n = 4,5\).
      0 references

      Identifiers