Difference between revisions of "Brocard's problem"

Latest revision as of 18:15, 12 March 2020

Given $n!+1=m^2$ which pairs $(n,m)$ are the solutions to the given equation.

$(n,m)=(4,5),(5,11),(7,71)$

Are the known solutions, and it was a conjecture of Paul Erdös, that these are the only solutions.

- If $n>3$ then $n^2<n!$ therefore $m>n$

- If $n>2p$ LHS is 1 mod $p^2$ so $m$ is likely $\pm 1$ mod $p^2$ making $m$ spread out as $n$ increases.

This article is a stub. Help us out by expanding it.

@@ Line 8: / Line 8: @@
 Are the known solutions, and it was a conjecture of Paul Erdös, that these are the only solutions.
+==Heuristic arguments==
+- If <math>n>3</math> then <math>n^2<n!</math>  therefore <math>m>n</math>
+- If <math>n>2p</math> LHS is 1 mod <math>p^2</math> so <math>m</math> is likely <math>\pm 1</math> mod <math>p^2</math> making <math>m</math> spread out as <math>n</math> increases.
 {{stub}}
+[[Category:Number theory]]