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,
10k≡q mod (p)
as eg
10k≡46 mod (47)
and I wonder if there is a generic approach to this problem.
Thursday, 30 October 2014
Subscribe to:
Post Comments (Atom)
real analysis - How to find limhrightarrow0fracsin(ha)h
How to find limh→0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Ok, according to some notes I have, the following is true for a random variable X that can only take on positive values, i.e P(X \int_0^...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
I use Euclidean Algorithm: 4620 = 101 * 45 + 75. long story short. I get 3 = 2 * 1 + 1. After that 2 = 1 * 2 + 0. gcd(101,4620) = 1. So I us...
No comments:
Post a Comment