Posted by **Anonymous** on Friday, October 26, 2012 at 11:54am.

Using 10^n = x (mod 9).

Given that

d=2935107

=2*10^6 + 9*10^5 + 3*10^4 + 5*10^3 + 1*10^2 + 0*10^1 + 7^10^0

Then d = kx (mod 9).

What is the smallest positive value of k?

- Math -
**Steve**, Friday, October 26, 2012 at 2:36pm
well, there may be something missing here, but taking it as written,

since 10^n = 1 (mod 9)

d = 2+0+3+5+1+0+7 (mod 9) = 0 mod 9

k=9 would fit the bill, since k=0 is not positive.

## Answer This Question

## Related Questions

- math - Which two is true as i'm confused A) 3+7 10 mod 15 17 + 9 4 mod 21 ...
- Math - Which Statements of congruence are true and which are false and why? 177 ...
- math - Which Statements of congruence are true and which are false and why? 177 ...
- Math - Which Statements of congruence are true and which are false and why? 177 ...
- Math - Find all numbers $r$ for which the system of congruences: x == r mod 6 x...
- Discrete Math - Let a, b, c, and d be integers, and let n be a positive integer...
- math - how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)
- math - how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)
- Math - What are the 3 solutions? I'm stuck! 6x=15(mod 21) a=6,m=21,b=15 d=gcd(6,...
- probability - how do we find the least residue of 1789 (mod 4), (mod 10), (mod ...

More Related Questions