QUESTION 17 \(a + 5 \equiv 5 \pmod{9}\), which of the following is true? \(9 | a\) \(5 | 9\) \(5 | a\) \(a | 9\) QUESTION 18 Solve the following congruence (give the smallest nonnegative solution): \(a + 6 \equiv 2 \pmod{7}\)
Added by James B.
Close
Step 1
To do this, we can start by finding the remainder when a + 55 is divided by 9. Let's assume a = x (where x is a positive integer). So, a + 55 = x + 55. Now, we need to find the remainder when x + 55 is divided by 9. We can rewrite x + 55 as (9k + r), Show more…
Show all steps
Your feedback will help us improve your experience
Robert Fox 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
6 a. Solve the congruence x^53 ≡ 75 mod 101. b.Solve the simultaneous congruences x ≡ 3 mod 17, x ≡ 5 mod 23, x ≡ 8 mod 35
Sri K.
Question 6 (a) Determine which of the following numbers are congruent to each other, explain your answer. i. 31 ≡ 1 (mod 10) ii. 43 ≡ 22 (mod 7) iii. 8 ≡ -8 (mod 3) iv. 91 ≡ 18 (mod 6) (b) What is -17 (mod 10)? (c) Find the remainder when the difference between 60002 and 601 is divided by 6.
Solve the congruence 17x + 57 ≡ 22 (mod 100).
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD