RoseCode

Problem #337

Multiplicative Order
 Public ★(x15) 07/01/16 by Philippe_57721 7xp Programming 55.6%

The multiplicative order $o(g,p)$ of a number g modulo p, (g and p coprime), is the smallest integer k such as:
$g^k = 1 \textrm{ modulo p}$

For instance, $o(10,73) = 8$

For how many prime numbers p $\lt 4 \times 10^8$ the multiplicative order $o(10,p) < 100$?

Example: 55,11573 for a limit of 1000

[My timing: 70 sec]

You need to be a member to keep track of your progress.
Register

Time may end, but hope will last forever.

## Contact

elasolova
[64][103][109][97][105][108][46][99][111][109]