Prove if a = b mod n and the integers a, b, n are all divisible by d > 0 then a/d = b/d mod n/d.
Added by Nathan B.
Step 1
We are given that a = b mod n. This means that a and b have the same remainder when divided by n, or equivalently, n divides (a - b). Mathematically, this can be written as: n | (a - b) Show more…
Show all steps
Close
Your feedback will help us improve your experience
Sri K and 54 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
(a) Let p be a prime. Prove that if the integers a, b satisfy a ≡ b mod p then a^p ≡ b^p mod p2. (b) Let Give an example of an even positive integer n and an integer a such that a^n!≡ a mod n. By the Little Fermat Theorem we must have n > 2.
Adi S.
Shaiju T.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD