Questions LLC
Login
or
Sign Up
Ask a New Question
Questions
Math
(19 − 8) mod 5 is the problem. I know nothing about modules, can anyone please help me out? I don't even know the building blocks for mods and what the differences are between them.
1 answer
oops Im sorry its (13-8)mod 6
You can
ask a new question
or
answer this question
.
Related Questions
Prove that a^3 ≡ a (mod 3) for every positive integer a.
What I did: Assume a^3 ≡ a (mod 3) is true for every positive
A round bar 40mm diameter is subjected to an axial pull of 80kN and
reduction in diameter was found to be 0.00775mm. Find
Let f(a;b) & f(c;d) be two affine ciphers s/t
f(a;b)(x) � (a:x + b) mod 26 f(c;d)(x) � (c:x + d) mod 26 Is f(c;d) � f(a;b) a
what is the remainder when the sum 1^5+2^5+3^5+...99^5+100^5 is divided by 4? again a mod problem that I don't know how to work.
A round bar 40 mm dia meter is subjected to an axial pull of 80 kn and reduction in diameter was found to be 0.00775mm.find
What are the 3 solutions? I'm stuck! 6x=15(mod 21)
a=6,m=21,b=15 d=gcd(6,21)=3 solns. 6x=15(mod 21) 2x=5(mod 7) 21=6(3)+3
1. An 7-bit counter is wired as follows: The CLK input to the first stage (LSB) is the system clock. Each stage's output is used
give an example to show that a^2 congruent to b^2 mod n need not imply that a congruent to b mod n.
Let a, b, and m be integers, and m ≥ 2. Prove that:
ab ≡ [ (a mod m) · (b mod m) ] (mod m). So I tried proof by cases:
7.
Which of the following is NOT a benefit of using modules in programming? Modules can help break the problem down into smaller