# math/computers

posted by .

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

## Similar Questions

Could someone explain what multiplication comparisons are?
2. ### progamming JAVA

1.Write an algorithm, in English, to solve the following problem. Be sure to include pre- and post-conditions! 2.Problem: Solve X mod Y for all positive integers. Do so without using multiplication or division. 3.What is (7 / 3) + …
3. ### Discrete Math

Let a, b, c, and d be integers, and let n be a positive integer. Prove that if a is congruent to c mod n and b is congruent to d mod n, then (a-b) is congruent to (c-d) mod n
4. ### math

Which two is true as i'm confused A) 3+7 ß 10 mod 15 17 + 9 ß 4 mod 21 12 + 14 ß 0 mod 26 B) 4+11 ß 2 mod 13 9+7 ß 4 mod 12 13 + 13 ß 1 mod 25 C) 5+9 ß 4 mod 10 16 + 13 ß 3 mod 26 12 + 7 ß 6 mod 14 d)2+7 …
5. ### Math

Which Statements of congruence are true and which are false and why?
6. ### math

Which Statements of congruence are true and which are false and why?
7. ### Math

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?
8. ### Math

Which Statements of congruence are true and which are false and why?
9. ### Math

If 360 workers called in sick and 240 went to work, how many workers work at the company all together?
10. ### math

Find the sum of the first one thousand positive integers. Explain how you arrived at your result. Now explain how to find the sum of the first n positive integers, where n is any positive integer, without adding a long list of positive …

More Similar Questions