Prime Modular Inverse by mitchs (alt)

#!ruby -na
f=->n{n<2?1:P/n*-f[P%n]%P}
eval'N,P='+$F*?,
p f[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