Find the smallest
and largest hexadecimal integers such
that each of their squares contains
each of the 16 hexadecimal digits (0
through 9 and A through F) once and
only once. A leading zero is not allowed.
Since this is a somewhat computationally intensive task, we might need to explore hexadecimal numbers systematically. The smallest hexadecimal integer that satisfies this condition could be tested first, then we search for larger ones,
tunnel rush.
No Subject
