Brocard's problem

From Number
Revision as of 22:23, 21 April 2009 by Vipul (talk | contribs) (Created page with '{{non-polynomial diophantine}} ==Statement== Brocard's problem asks for all pairs of positive integers <math>(n,m)</math> such that: <math>n! + 1 = m^2</math>. The only known...')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Template:Non-polynomial diophantine

Statement

Brocard's problem asks for all pairs of positive integers (n,m) such that:

n!+1=m2.

The only known solutions are (4,5),(5,11),(7,71). The ns that occur as part of such solution pairs are termed Brown numbers. It is conjectured that there are no other solutions.

Related facts