Prime factorization conjecture for factorials plus one
Let . A natural number is square-free if no perfect square other than divides it.
Prime factorization conjecture for factorials plus one. For every , the number is square-free.
The conjecture predicts that the displayed set contains all exceptions to square-freeness for numbers of the form . Numerical evidence is reported through , while the further exceptions and are explicitly identified in the source; no proof that these are the only exceptions is given.
References
Primary source
William Gerst, “A conjecture on the prime factorization of n!+1”, arXiv:1809.07360 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.