prime powers by Nikolai

n=1000;p=sorted([i**j for i in [n for n in range(2, n) if all(n % d for d in range(2,int(n**.5)+1))] for j in range(1,10) if i**j<n])\x0d
for i in p:\x0d

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)


return to the top page