Achilles numbers: Difference between revisions

m
(J: add some comments)
Line 79:
Explanation of the code:
 
<tt>(1{__&q:)</tt> is a function which returns the non-zero powerpowers of the prime factors of a positive integer. (<tt>__&q:</tt> returns both the primes and their factors, but here we do not care about the primes themselves.)
 
<tt>+./</tt> returns the greatest common divisor of a list, and <tt>1=+./</tt> is true if that gcd is 1 (0 if it's false).
 
<tt>*/ .>&1</tt> is true if all the values in a list are greater than 1 (0 if not).
6,962

edits