Brocard’s problem is to find values of m and n such that n!+1 = m2
For example, a pair (4, 5) solves the above equation. We have n = 4, m = 5. 4! + 1 = 24 + 1 = 25 = 52.
A pair (n, m) that solves above is called Brown Number. There are only three known pairs (4, 5), (5, 11), and (7, 71)
This article is contributed by Shivam Pradhan (anuj_charm). If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
- GFact 22 | (2^x + 1 and Prime)
- Can C++ reference member be declared without being initialized with declaration?
- Facts and Question related to Style of writing programs in C/C++
- Storage of integer and character values in C
- Vantieghems Theorem for Primality Test
- Cauchy's Mean Value Theorem
- G-Fact 17
- fseek() vs rewind() in C
- G-Fact 16
- G-Fact 13
- G-Fact 12
- G-Fact 9
- What is evaluation order of function parameters in C?
- How are variables scoped in C - Static or Dynamic?