prime powers by Dingledooper

for(n=t=2;n<1e3;)t=t<n?n%k?++k:t*k:k=t>n++?2:print(t)|2

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