Posted by **sally** on Friday, April 16, 2010 at 9:56pm.

Problem: Solve X mod Y for all positive integers. Do so without using multiplication or division.

## Answer This Question

## Related Questions

- progamming JAVA - 1.Write an algorithm, in English, to solve the following ...
- Math - If 360 workers called in sick and 240 went to work, how many workers work...
- 5th grade math - Could someone explain what multiplication comparisons are? An ...
- Discrete Math - Let a, b, c, and d be integers, and let n be a positive integer...
- math - Find the sum of the first one thousand positive integers. Explain how you...
- math - Which two is true as i'm confused A) 3+7 ß 10 mod 15 17 + 9 ß 4 mod 21 ...
- Math - Using 10^n = x (mod 9). Given that d=2935107 =2*10^6 + 9*10^5 + 3*10^4 + ...
- 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 ...

More Related Questions