Assume m and n are co-prime positive integers, and x and y any pair of integers. If x ≡ y mod mn, then x ≡ y mod m and x ≡ y mod n
Added by James H.
Step 1
In other words, (x - y) = kmn for some integer k. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Nick Johnson and 63 other Algebra 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 m and n be positive, relatively prime integers, and r and s be integers such that mr ≡ 1 mod n and ns ≡ 1 mod m. For integers a, b, find an integer value of x in terms of a, b, m, n, r, s satisfying x ≡ a mod n and x ≡ b mod m.
Nick J.
Number Theory m>=2, an integer; a and b are integers each: Gcd(a, m) =Gcd(b, m) = 1; a^n (mod m)= h b^n (mod m)=k gcd(h, k) = 1. In this case, show that: (a-b)^n (mod m)= h-k
Adi S.
Let m >= 2 be an integer. We say that the integer x has an inverse modulo m if there is an integer y such that xy is congruent to 1 (mod m). Find an integer x that is not a multiple of 100 and does not have an inverse modulo 100.
Madhur L.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD