Thursday, 30 October 2014

divisibility - power of ten modulo prime

In a mathematical quiz (that I solved by computational means), I came across the problem of finding powers k of ten with a given congruence to a given prime number,
10kq mod (p)
as eg
10k46 mod (47)
and I wonder if there is a generic approach to this problem.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...