Documentation

FormalConjectures.ErdosProblems.«398»

Erdős Problem 398 #

References:

theorem erdos_398 :
{n : | ∃ (m : ), n.factorial + 1 = m ^ 2} = {4, 5, 7} sorry

Brocard's Problem Does $n! + 1 = m^2$ have integer solutions other than $n = 4, 5, 7$?