Brocard's problem: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

21 April 2009

  • curprev 22:2322:23, 21 April 2009‎ Vipul talk contribs‎ 546 bytes +546‎ 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...'
Retrieved from "https://number.subwiki.org/wiki/Brocard%27s_problem"