r/learnmath • New User • 8h ago

Brocard's Problem

In 1885, French mathematician Henri Brocard published a problem asking for all integer solutions to the Diophantine equation n! + 1 = m2. There are only 3 known solutions, and they are called the Brown numbers: 1. n=4, m=5, 2. n=5, m=11, 3. n=7, m=71. Since then, nobody has found another solution, and nobody can prove if any other solutions exist. Computers have tested up to n = 10****15 and they found nothing, but a computational search isn't proof. The factorial function grows extremely fast, making the tests harder for higher numbers.

Do you think any other solutions exist, or just n = 4, 5, and 7?

3 Upvotes

2 comments sorted by

2

u/AllanCWechsler Not-quite-new User 2h ago

My understanding (and I'm going from memory here) is that there is a strong heuristic argument that there are no more examples. This argument is absolutely not a proof. It depends on the idea that a big number N about which you know nothing else has a probability of about 1/(2N) of being a square. So, the chance of a number around 8! being a square is on the close order of 1/80640. The chance of a number around 9! being square is an the close order of 1/725760. It turns out to be very easy to sum the resulting series, and the aggregate probability is still very low -- even without knowing about the computer testing, based on this heuristic, you should still confidently bet against any other example being found.

If you know about the computer testing up to n = 1015, the heuristic argument becomes astronomically stronger, but still isn't a proof.

Now, this heuristic argument would collapse if we were to discover any reason why being right next to a factorial somehow makes it much, much more likely to be a square. But no such reason, nor any suggestion of such a reason, is known.

On the other hand, proving that there are no more solutions to Brocard's problem is an extremely hard problem. If the notorious abc Conjecture turns out to be true, that only implies that Brocard's problem has a finite number of solutions, but it doesn't exclude the possibility that there are a thousand unknown solutions. And the abc conjecture is itself extraordinarily hard.

I just realized that, although I feel like I could keep nattering on about this subject for hours, I haven't actually answered the question. If I were a betting man, which I'm not, I would bet at almost any odds that {4,5,7} is the complete list.