Freeflows

Square List Count

In a particular list of three-digit perfect squares, the first perfect square can be turned into each of the others by rearranging its digits. What is the largest number of distinct perfect squares that could be in the list?

1
2
3
+
4
5
6
-
7
8
9
$\frac{a}{b}$
.
0
=
%

$a^n$
$a^{\circ}$
$a_n$
$\sqrt{}$
$\sqrt[n]{}$
$\pi$
$\ln{}$
$\log$
$\theta$
$\sin{}$
$\cos{}$
$\tan{}$

$($
$)$
$[$
$]$
$\cap$
$\cup$
$,$
$\infty$

Report a mistake in this question