Question

Find - 50 mod 7

Find - 50 mod 7

Homework Answers

Answer #1

#include <stdio.h>

int main()
{
int rem;// variable rem to store mod of 50 and 7
int N = 50;
int M = 7;
rem = N % M; // % is modulo operator.
printf("mod of 50 and 7 is : %d",rem);

return 0;
}

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
find the following square roots. A. √8( mod 41) B. √7(mod 41) C. √7 (mod 19)...
find the following square roots. A. √8( mod 41) B. √7(mod 41) C. √7 (mod 19) D. √7 (mod 29) E. √5 (mod 29)
find an integer x such that 3x=2 mod 5, and 4x=5 mod 7
find an integer x such that 3x=2 mod 5, and 4x=5 mod 7
find all the primitive roots is mod 7
find all the primitive roots is mod 7
Find a solution to this system of congruences: a ≡ 7 mod 12 a ≡ 36...
Find a solution to this system of congruences: a ≡ 7 mod 12 a ≡ 36 mod 41
Find all solutions to each congruence. (a) 2x − 3 ≡ 2 (mod 7) (b) 3x...
Find all solutions to each congruence. (a) 2x − 3 ≡ 2 (mod 7) (b) 3x + 4 ≡ 1 (mod 5) (c) 3x ≡ 6 (mod 9) (d) 14x ≡ 11 (mod 15)
Find all solutions to the system: 2x ≡ 4 (mod 5) 3x ≡ 5 (mod 7)...
Find all solutions to the system: 2x ≡ 4 (mod 5) 3x ≡ 5 (mod 7) 7x ≡ 2 (mod 13) need help with discrete math HW, please write solutions clearly, and please don't just answer wrong solution, cus then i will need to post the same question twice. i appreciate every help i can get but please let someone else help me solve the question if you're not sure about any part to avoid reposting. thanks, will rate best...
(a) Solve x ≡ 11 (mod 12), x ≡ 4 (mod 5), x ≡ 0 (mod...
(a) Solve x ≡ 11 (mod 12), x ≡ 4 (mod 5), x ≡ 0 (mod 7) (b) Find all the solutions of the following system: x ≡ 5 (mod 6), x ≡ 4 (mod 11), x ≡ 3 (mod 17).
Solve the linear congruence x = 2 mod (7) x = 1 mod (3)
Solve the linear congruence x = 2 mod (7) x = 1 mod (3)
7. a. Verify the following congruences: 105 ≡ 5 (mod 20) 189 ≡ 9 (mod 15)...
7. a. Verify the following congruences: 105 ≡ 5 (mod 20) 189 ≡ 9 (mod 15) b. Verify that ( 105 + 30 ) ≡ ( 5 + 10 ) (mod 20) c. Try to show that in general, if M≡a (mod L) and N≡b (mod L) then M+N≡a+b (mod L)
Verify that(50!)2≡−1 (mod 101).
Verify that(50!)2≡−1 (mod 101).