Discrete Math Quiz
14 questions · no time limit
0:00
NUMBER THEORY AND CRYPTOGRAPHY
Question 1 of 14
No time limit
Current
Answered
Flagged
Not seen
Consider solving x≡3(mod8)x ≡ 3 \pmod{8} and x≡7(mod12)x ≡ 7 \pmod{12} using CRT. Since gcd⁡(8,12)=4\gcd(8,12) = 4, we first check compatibility. Given that the system has a solution, what is x mod 6x \bmod{6}?
YOUR PROGRESS
14
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end