The prime power conjecture for perfect difference sets
Statement
Let be a perfect difference set if every nonzero can be written uniquely as the difference of two elements of . A perfect difference set has order when and . The prime power conjecture. An integer is the order of a perfect difference set if and only if 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 up to 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.