The hexagonal versus the square lattice

Schmutz Schaller’s conjecture regarding the lengths of the hexagonal versus the lengths of the square lattice is shown to be true. The proof makes use of results from (computational) prime number theory. Using an identity due to Selberg, it is shown that, in principle, the conjecture can be resolved without using computational prime number theory. By our approach, however, this would require a huge amount of computation.