Referring to terry tao's latest paper on arxiv "UNDECIDABILITY OF TRANSLATIONAL MONOTILINGS" > From the domino problem to a decorated p1 × p2-adic Sudoku puzzl

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)