Brocard's problem asks to find integer values of n for which(adsbygoogle = window.adsbygoogle || []).push({});

n! + 1 =m^2 .

where n! is the factorial.Probably I got a proof that there is no solution if n! contains a prime with power exactly 2 & n>7.....looking for error....anyone else with any result?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Brocard's problem.

Loading...

Similar Threads - Brocard's problem | Date |
---|---|

Least Square basic problem | Jan 20, 2018 |

A Eigenvalue Problem and the Calculus of Variations | Jan 8, 2018 |

A Possible Proof for Brocard's Problem | Jul 9, 2012 |

Paradox for the existence of 4,5 and 7 using Brocard's problem | Jul 6, 2011 |

Conjectures by Legendre and Brocard made stronger. | Apr 4, 2011 |

**Physics Forums - The Fusion of Science and Community**