1. Two integers a and b are said to be congruent modulo n, if (a mod n)(b mod n)

Question

1. Two integers a and b are said to be congruent modulo n, if (a mod n)(b mod n). 2. If bla we say that b is a divisor of a. T P 3. Two integers are if their only common positive integer factor is 1. ? B) congruent modulo D) residual A) relatively prime C) polynomials 4. The of two numbers is the largest integer that divides both numbers B) prime polynomial D) integral divisor A) greatest common divisor C) lowest common divisor 5. Two numbers are relatively prime if they have prime factors in common B) no D) all A) some c) multiple 6. The congruence relation is used to define A) finite groups B) greatest common divisor D) residue classes C) lowest common divisor 7. As a remainder with respect to a given modulus. A) finite C) congruence relation, mod expresses that two arguments have the same B) monic D) cyclic 8. The remainder r in the division algorithm is often referred to as a 9. One of the basic techniques of number theory is the algorithm which is a simple procedure for determining the greatest commorn divisor of two positive integers. 10. If a is an integer and n is a positive integer, we define a mod n to be the remainder when a is divided by n. The integer n is called the

Explanation / Answer

Question 1 True

Question 2 True

Question 3 Option A)

Question 4 Option A)

Question 5 Option B)

Question 6 Option D)

Question 7 Option C)

Question 9 Euclidean

Question 10 divisor

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.