ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D⊂Z/mZD\subset \mathbb{Z}/m\mathbb{Z} be a perfect difference set if every nonzero a∈Z/mZa\in\mathbb{Z}/m\mathbb{Z} can be written uniquely as the difference of two elements of DD. A perfect difference set has order nn when m=n2+n+1m=n^2+n+1 and ∣D∣=n+1|D|=n+1. The prime power conjecture. An integer n≥2n\geq 2 is the order of a perfect difference set if and only if nn is a prime power.

Singer constructed perfect difference sets of every prime power order, and the conjecture asserts that no other orders occur. It has been verified computationally for all nn up to 22 billion, but remains open in general.

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.