Timeline for A trivial application of Wilson's theorem to Brocard's Problem
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 6, 2016 at 16:40 | comment | added | Maaz-ul-Haq | It is true that it solves for a very few $n$. But it strikes me as a surprise that the statement that "no solution exists for any non-Wilson prime less one." is not reported even if it is obvious. | |
| Jan 6, 2016 at 16:22 | comment | added | user41593 | Just because this is not very interesting, as it solves the problem for very few $n$'s. Even assuming the $abc$ conjecture, the best we can prove is that there are $\gg \log x/\log \log x$ non-Wilson primes up to $x$. But it has long been known unconditionally that there are $o(x)$ solutions, by diophantine methods. Your argument is probably just so obvious that no one ever bothered to write it down. | |
| Jan 6, 2016 at 15:10 | history | asked | Maaz-ul-Haq | CC BY-SA 3.0 |