ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M(2,n)\mathfrak{M}(2,n) denote planar integral point sets with nn points. An integral point set is prime when it cannot be obtained by scaling a smaller integral point set while preserving its power and structure. Prime-set distance conjecture. For every n≥3n\geq 3 and d≥1d\geq 1, there exists a prime set M∈M(2,n)M\in\mathfrak{M}(2,n) containing points M1M_1 and M2M_2 whose distance is exactly dd. The source presents this as the final and apparently most approachable conjecture; it follows earlier constructive results in higher dimensions but is not proved in the supplied text.

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.