ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p≥5p\geq 5 be a prime, and let En(1,x)E_n(1,x) denote the reversed Dickson polynomial of the second kind. A complete permutation polynomial (CPP) is a polynomial ff such that both f(x)f(x) and f(x)+xf(x)+x permute Fp\mathbb{F}_p. Reversed Dickson second-kind complete permutation conjecture. En(1,x)E_n(1,x) is a CPP of Fp\mathbb{F}_p if and only if

n≡3(modp(p2−1)).n\equiv 3\pmod{p(p^2-1)}.

This is the complete-mapping analogue of the preceding permutation conjecture and is presented without a proof; its general validity remains open.

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.