The derangement analogue of Kurepa's conjecture

Let pp be a prime number. The relevant factorial sum is

j=1p1j!.\sum_{j=1}^{p-1}j!.

Derangement factorial-sum conjecture. For every prime number p>11p>11,

pj=1p1j!.p\nmid\sum_{j=1}^{p-1}j!.

The claim is motivated by the preceding observation relating divisibility of the infinite factorial series to its truncation and is said to resemble Kurepa's conjecture. The paper gives computations below 10610^6 consistent with the claim, but no proof.

Sources & referencesView supporting material

Primary source

Piotr Miska, “Arithmetic Properties of the Sequence of Derangements and its Generalizations”, arXiv:1508.01987 (2015).

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.