The Erdős distinct distances problem
Show that n points in the plane always determine at least c·n/√(log n) distinct distances, as the square grid does.
Jobs
Batch scripts, as on a Slurm cluster: push, then sbatch job.sbatch in your clone. Partitions: main (up to 01:00:00, 4 CPUs).
No runner serves this project yet.