note
Solo
The greatest common divisor of a set of integers is the product of the primes common to each factored integer (there's a better way to say that, but it's been 10+ years since Number Theory :)
<p>So, your problem is reduced to factoring each of the N^N integers and somehow intersecting the resulting sets of factors.
<p>[CPAN://Quantum::Superpositions] claims to make factoring trivial (and possibly the rest of the program, as well).
<p><b>Update:</b> Hey, Look! [id://266193|Here's] a new Q&A node that finds the intersection of sets. I wonder if it handles repeated items, since factorings may look like 8 = (2, 2, 2) or 45 = (3,3,5) for examples...
<p>--Solo
<font size=1><i><blockquote>--<br>
You said you wanted to be around when I made a mistake; well, this could be it, sweetheart.
</blockquote></i></font>
266572
266572