Kurepa's left-factorial conjecture

For each integer n2n\geq 2, let the left factorial !n\mathbf{!n} be the sum of the factorials below nn, and let n!n! denote the usual factorial. Kurepa's conjecture. The two factorials have greatest common divisor

gcd(!n,n!)=2.\gcd(\mathbf{!n},n!)=2.

This is a classical divisibility conjecture concerning the arithmetic relationship between the left factorial and the ordinary factorial; its resolution is not established in the supplied source.

Sources & referencesView supporting material

Primary source

Francis Atta Howard, “Partition Functions and Kurepa Decomposition I: Algebraic computation and some physical Applications”, arXiv:2509.06077 (2025).

Additional references

2 papers in this index state this conjecture (2013–2025). The statement above is taken from the most recent of them; the others are arXiv:1312.7037.

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.