*f*(*m*) = *m ^{e}* mod

which is used for the RSA algorithm,
is plotted for 0 *m* < *n*
(More is not necessary, for everything repeats modulo n!).
Please insert integer values for *e* and *n*
(terminate your input with the return key):