A232802 Number of solution pairs (x,y) for x <= 11 such that x! + n = y^2 (Brocard-Ramanujan Diophantine equation) is soluble over the integers.

3, 1, 2, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 1, 1, 1, 0

Offset

1,1

Comments

The Mathematica program will find the number of integer pairs (x,y) solving x!+n = y^2 for each n from 1 to 200 with x not exceeding 11. Dabrowski showed that the abc conjecture implies only finite solutions for each n. Berndt and Galway found that 11 was the highest value that x reached for a solution with n in the range 1 to 2500 and could find no further solution pairs (x,y) in that range even when x was increased to 10^5.

For n = 1 the number of solutions and arbitrary x is Brocard's problem, and it is conjectured - but verified only in the range x <= 10^12 - that there are 3 solution pairs (x,y): (4,5), (5,11), (7,71). - Georg Fischer, Nov 27 2020

Links

Table of n, a(n) for n=1..82.

Bruce Berndt and William Galway, On the Diophantine equation n! + 1 = m^2

Andrzej Dabrowski, On the Diophantine equation x! + A = y^2, Nieuw Archief voor Wiskunde, Vierde serie Deel 14 No. 3 (Nov. 1996) pp. 321-324.

Wikipedia, Brocard's problem

Wikipedia, abc conjecture - some consequences

Mathematica

Table[Length@Select[Sqrt[Range[11]!+n], IntegerQ[#] &], {n, 1, 200}]

Crossrefs

Cf. A085692, A146968, A216071 (Brocard's problem; all essentially the same sequence).

Cf. A038202, A068869.

Sequence in context: A172093 A294402 A145738 * A245201 A211358 A211356

Adjacent sequences: A232799 A232800 A232801 * A232803 A232804 A232805

Keyword

nonn

Author

Frank M Jackson, Nov 30 2013

Extensions

Definition narrowed by Georg Fischer, Nov 27 2020

Status

approved