prime powers by lynn

main=mapM print[n|n<-[2..999],gcd(until((<1).mod n)(+1)2^10)n==n]

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page