The prime divisibility embedding conjecture
Let be a prime. Let be a set of points such that the distances between any two points of are integer and divisible by .
Prime divisibility embedding conjecture. There is a Euclidean motion such that
This is the prime-divisor version of the divisibility embedding conjecture. The source gives no resolution of this claim.
References
Primary source
Jan Fricke, “On Heron Simplices and Integer Embedding”, arXiv:math/0112239 (2001).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.