Hacker News Reader

Referring to terry tao's latest paper on arxiv "UNDECIDABILITY OF TRANSLATIONAL MONOTILINGS"

> From the domino problem to a decorated p1 × p2-adic Sudoku puzzle

> In this section we will prove Theorem 3.2. We will need two distinct primes p1, p2 obeying (4.3); for instance, we can take

> p1 = 53; p2 = 57

> although the precise values of these primes will not be of significance to our arguments as long as they satisfy the largeness condition (4.3).

In chess we would mark that line with ?? (a blunder)

57 is called the "Grothendieck Prime" after another eminent mathematician who erroneously said it was prime.

Maybe Terry was making an inside joke?

"57 is not a prime" is not the title.

The referenced piece is the comment which does not have a title as such; I hope the title I gave it accurately summarises the content.

I would change the title to "Terry, 57 is not a prime."

That's a better title -- thanks!

Right, I didn't notice that. I apologize.