Penholodigital squares: Difference between revisions
m
→{{header|Wren}}: Changed to Wren S/H
(Created Nim solution.) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
Line 1,922:
Although I'm not quite sure why, it appears that a necessary condition for a number to be a penholodigital square is for its square root to be exactly divisible by the highest prime factor of (base - 1).
<syntaxhighlight lang="
import "./fmt" for Conv, Fmt
| |||