2 problems

Beasley–Laffey's maximal-rank conjecture. The maximal possible rank of an $n\times n$ Euclidean distance matrix is $n$.

Let $M$ be a random linear Euclidean distance matrix of dimension $n$, so that $M$ is an $n\times n$ matrix of pairwise squared distances generated by randomly chosen points on a l…