Claims

../

1991_08_01_brindza_erdos: Brindza and Erdős prove that every solution of the equation has p, a and k below one effectively computable absolute constant, so there are finitely many solutions in all; a refereed paper credited by the site's curator.

1996_01_01_le: Le determines every solution of the equation for odd primes p, the three cases 2!+1^2=3, 2!+5^2=3^3 and 4!+1^4=5^2, in a refereed paper of 1996 independent of Yu and Liu's; the site does not credit it.

1996_09_01_yu_liu: Yu and Liu determine every solution of the equation for odd primes p: the three cases 2!+1^2=3, 2!+5^2=3^3 and 4!+1^4=5^2; a refereed paper credited by the site's curator, with a third-party Lean proof of the list.

---