Question
Show that if $a=b(\bmod N)$ and if $M$ divides $N$ then $a=b(\bmod M)$
Step 1
We are given that $a \equiv b \pmod{N}$. This means that $N$ divides $a-b$, or in other words, there exists an integer $k$ such that $a-b = kN$. Show more…
Show all steps
Your feedback will help us improve your experience
Nick Johnson and 88 other AP CS 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
Let a, b, d, m, n be integers. Prove that if d divides n and d divides m, then d divides an - bm.
Prove that if $a_{n} \rightarrow L$ and $b_{n} \rightarrow M,$ then $a_{n}+b_{n} \rightarrow L+M$.
Sequences; Indeterminate Forms; Improper Integrals
Limit of a Sequence
Prove that if $a_{n} \rightarrow L$ and $b_{n} \rightarrow M,$ then $a_{i}+b_{n} \rightarrow L+M$
Sequences; Inderminate Forms; Improper Integrals
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD