ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, let D(n)={τ∈Sn:τ(j)≠j for all j=1,…,n}D(n)=\{\tau\in S_n:\tau(j)\ne j\text{ for all }j=1,\ldots,n\} be the set of derangements, and let sign⁡(τ)\operatorname{sign}(\tau) denote the sign of a permutation. Derangement congruences. For any odd prime pp,

∑τ∈D(p−1)∏j=1p−11j−τ(j)≡(−1p)(modp2)\sum_{\tau\in D(p-1)}\prod_{j=1}^{p-1}\frac{1}{j-\tau(j)}\equiv\left(\frac{-1}{p}\right)\pmod{p^2}

and

∑τ∈D(p−1)sign⁡(τ)∏j=1p−11j−τ(j)≡1(modp2).\sum_{\tau\in D(p-1)}\operatorname{sign}(\tau)\prod_{j=1}^{p-1}\frac{1}{j-\tau(j)}\equiv1\pmod{p^2}.

These congruences concern derangement-restricted permanent- and determinant-type sums; the supplied text gives no resolution.

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.