Brocard's problem
Brocard's problem is the Diophantine problem of finding an integer, whose factorial plus one is a perfect square.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2570889987
- Described as
- the Diophantine problem of finding an integer, whose factorial plus one is a perfect square
- Other names
- Brocard–Ramanujan diophantine equation, Brocard–Ramanujan equation, Brocard–Ramanujan problem
- What it is
- polynomial–factorial diophantine equation
- Wikipedias with a page
- 21
Wikidata item Q1052622 (wikidata.org/wiki/Q1052622), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1385397333
Brocard's problem is a problem in mathematics that seeks integer values of n such that n!+1 is a perfect square, where n! is the factorial. Only three values of n are known — 4, 5, 7 — and it is not known whether there are any more. Though research has extended far beyond n > 7, no additional solutions to the equation n! + 1 = m2 are known.
More formally, it seeks pairs of integers n and m such thatn!+1=m2.The problem was posed by Henri Brocard in a pair of articles in 1876 and 1885, and independently in 1913 by Srinivasa Ramanujan.
From the Wikipedia article “Brocard's problem” (en.wikipedia.org/wiki/Brocard's_problem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
