Using CUDA to Find the World’s Largest Square Palindromes

In October 2022, Professor David Griffeath of UW-Madison approached me with an interesting recreational mathematics question: how efficiently could a computer find square palindromes, i.e. numbers which are perfect squares and which also read the same forwards and backwards (when written in base 10)? There are certain infinite families of square palindromes which are well-known. For example, , ,…