in reply to Re^3: Rotationally Prime Numbers Revisited
in thread Rotationally Prime Numbers Revisited
It's already very fast, but you can improve it somewhat by doing your rotations with
$num = chop($num) . $num; Rate s chop s 258/s -- -14% chop 299/s 16% --
the lowliest monk
|
---|