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,
$$10^k \equiv q \text{ mod } (p)$$
as eg
$$10^k \equiv 46 \text{ mod } (47)$$
and I wonder if there is a generic approach to this problem.
Thursday, 30 October 2014
divisibility - power of ten modulo prime
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment