Multiplicative Order
C_K_Yang czp001 liuguangxi a_forsteri Min_25 Philippe_57721 gerrob mathpseudo sinan hervas lesnik7 R2D2 Buri nielkh elasolova
Public  07/01/16  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 $?
Answer format: count,sum
Example: 55,11573 for a limit of 1000
[My timing: 70 sec]
$ 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 $?
Answer format: count,sum
Example: 55,11573 for a limit of 1000
[My timing: 70 sec]
Fresh Problems

Polygons ratio 1d:19h
solved by 7 
Best Matrices Multiplication 1w:1d
solved by 9 
Equations 1w:5d
solved by 10 
First semiprime 2w:1d
solved by 10 
Triangles ratio 2w:6d
solved by 12