ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

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

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

p∤∑j=1p−1j!.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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.