Suppose a, b ? ?, and n ? ?. If 12a ? 12b mod(n) then n ? 12.
Added by Stephen M.
Close
Step 1
Since $12a \not\equiv 12b \pmod{n}$, we can say that $12(a - b) \not\equiv 0 \pmod{n}$. This means that $n$ does not divide $12(a - b)$. Show more…
Show all steps
Your feedback will help us improve your experience
Madhur L and 82 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Suppose that a and b are integers, such that: а ≡ 4 (mod 13); b ≡ 9 (mod 13) The integer c, 0 ≤ c ≤ 12 and such that c ≡ a + b (mod 13), equals to:
Craig W.
Let A = {1, 2, ..., 12}. Let aRb mean a ≡ b (mod 5). (a) Give [2]R, [3]R, and [5]R. (b) Give [2]R ∩ [12]R.
Vincenzo Z.
Suppose b is an integer. If b mod 11 = 3 what is 4b mod 11? Show your working.
Abraham O.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD