If a = b (mod 5), then... Choose all correct statements. O 2(a – b) = 0 (mod 20) O a³ = b3 (mod 5) O a +7 = b+ 12 (mod 5) O a +b = 0 (mod 10) O ab = b? (mod 5)

Q: Prove that if ca = cb (mod n), then a = b (mod n/d) , where d = gcd(c,n). %3D

A:

Q: if a equiv b (mod n) , then a⁴ equiv b⁴ (mod n) for any positive integer 4.

A:

Q: If a = b (mod m) and a = b (mod n) then a = b (mod mn)

A:

Q: If a= b (mod n) and gcd (a, n) = d, then gcd (b, n) = d :Select one True False

A:

Q: 9. Let a and b be integers. Prove that if a =7 (mod 8) and b = 3 (mod 8), then: (a) a + b = 2 (mod…

A: Your questions solution below in images

Q: 2. Give an example to show that a? = b2 (mod n) need not imply that a =b (mod n). 3. If

A: Given below the detailed solution

Q: (a) Show that if n 7 mod 8, then n + 6n 3 mod 8.

A: If, n = 7 (mod 8) So, n² = 7² (mod 8) So, n² = 49 (mod 8) So, n² = 1 (mod 8)

Q: What are the FOUR values of x that will satisfy: x ≡ 4 mod 5 & x ≡ 3 mod 7 please show your…

A:

Q: 2. If a = 1 (mod p), then a=1 (mod p). Select one: True False

A: If , then . The truthfulness of the given statement can be proved by taking an arbitrary value for…

Q: consider the statement: for all n∈N , x∈Z , x^2 ≡ 1 mod n (        ) x ≡ 1 mod n or x≡ -1 mod n a)…

A:

Q: 5- If a = b mod(n), then ac = bc mod(n). 6- If a b mod (n), then ak = b*mod(n) for every positive…

A:

Q: 5- If a = b mod (n), then ac = bc mod (n). 6- If a = b mod(n), then ak = bkmod(n) for every positive…

A:

Q: Let p be a prime with p ≡ 3 (mod 4), and suppose that q = 2q + 1 is also prime. Determine if 2 is a…

A: let p be a prime with p≡3mod 4 and suppose that q=2p+1 is also prime determine if 2 is a square mod…

Q: The set {0,5,6} is closed under Mod(10)

A: To check if { 0 5, 6} is closed under mod(10)

Q: Prove or disprove If ac = bc(mod m), then a = b(mod m). If n | m and a = b(mod m), then a = b(mod…

A: According to the given information, it is required to prove or disprove the given statement:

Q: If x = 2 (mod 5) and y = 4 (mod 5) then 2x – 3y =? (mod 5)

A:

Q: 3. Use Wilson's Theorem to prove 6(k - 4)! = 1 (mod k:), if k is prime.

A: Wilson's Theorem: Let k be a prime number, then by Wilson's theorem, (k-1)!=-1(modk)

Q: 4. If x mod 7 = 3, then x27 mod 7 is O 3 0 6 O 5 O 4

A: Given :- x mod 7 = 3

Q: 2. In Section 3.1, we defined congruence modulon where n is a natural number. If a and b are…

A:

Q: Let P be a prime, if ac = bc (mod p) and p does not divide c, then a = b (mod p) Select one: O True…

A: Given  gcd(c, p) = 1 and ac ≡ bc(mod p). (We may assume p > 1 so that c  ≠  0.) Then ac − bc =…

Q: 1. Show that an integer n is divisible by 2 if and only if its last digit is even. (Hint: For each i…

A:

Q: you Prove the " of 25nY-18n +7 =0 (mod4), then statement contradiction. is by "even

A:

Q: 4. (a) Solve the set of congruences х 1(mod 3), x= 2(mod 4), x = 3(mod 5).

A: We  will solve it by Chinese Remainder Theorem Given  x≡1(mod3)x≡2(mod4)x≡3(mod5) Compare it with…

Q: 9. Show that if p is an odd prime and p = 3 mod 4 then p is not the sum of the squares of two…

A: In the given question we have to prove that if p is an odd prime and…

Q: For all integers a and b, if a = 7 ( mod 8)and b = 3 ( mod 8), then (a + b) = 2( mod 8).

A:

Q: If a = 1 (mod n) and b = 1 (mod n) then a - b = 0 (mod n) اختر واحدا: 2 3

A: True.

Q: Prove that for all integers x, if x is not divisible by 7, then x^3 ≡ 1 mod 7 or x^3 ≡−1 mod 7

A: We will prove the given statement.

Q: 6), then the congruence has a unique solution modulo p. 11. Show that the congruence x³ = 3 (mod 19)…

A: 11. To prove that the congruence x3≡3 mod 19 has no solutions, whereas x2≡11(mod 19) has three…

Q: Prove that min (a) If a = b (mod n) and mln ,then a = b (mod m) (b) If a = b (mod n) and c =d (mod…

A:

Q: mod n, then x ≡ 0 mod n or

A:

Q: (4) Let p be a prime number. Then r = 1 mod p has exactly two solutions modulo p.

A: 4) To prove, x2≡1mod p has exactly 2 roots such that p is a prime number.

Q: If a+c=b+c (mod m) then a =b (mod m) Select one: True False

A:

Q: Show that: if a = b(mod n) and C = d\modn), then a +c =b+d\mod n)!

A:

Q: If mx = 1 (mod n) has a solution, then nx= 1 (mod m) has a solution. Select one: O True False

A:

Q: Find all integers X satisfying X ≡ 1 mod 6, X ≡ 3 mod 8, X ≡ 7 mod 9

A: First divide 1 i.e. the dividend by 6 i.e. the divisor 1/6 = 0.16667 Then multiple the whole part of…

Q: Prove that if a = b mod n and c= d mod n, then ac bd mod n.

A: Given if a≡bmodn and c≡dmodn We have to show that ac≡bdmodn. Now, a≡bmodn…

Q: 3. If x mod 4 = 1 and y mod 4 = 3, then xy could be O 901 O 299 O 508 O 113

A: We shall use the division algorithm

Q: If a = b (mod 5), then... Choose all correct statements. O a3 = b³ (mod 5) O a + b = 0 (mod 10) O a…

A: Option (a), (c), and (d) are correct options.

Q: True or False Let n > 0 be fixed and a, b, c and d are arbitrary integers, then, if a ≡ b(mod n)…

A: We have to check whether the statement, "Let n>0 be fixed and a, b, c and d are arbitrary…

Q: Show that if x mod 8 = 1, then (3x −5) mod 6 = 4.

A: Solution

Q: If ab = 0 (mod m), then either a = 0 (mod m) or D=0 (mod m). Select one: O True False

A:

Q: If a # 0 (mod m) and b # 0 (mod m), then ab# 0 (mod m). Select one: O True False

A: justification is given in step 2)

Q: 12.ifa b(mod n) and b a c(mod n) then ab m be(mod n)

A: We can proove in the following way:-

Q: 20. If a e Z and a = 1 (mod 5), then a² = 1 (mod 5). If a - h (mod n) then a3 = h3 (mod n)

A: Notation: a|b  means a divides b or                   a|b means b is divisible by a.

Q: Let P be a prime, if ac ≡ bc (mod p) and p does not divide c, then a ≡ b (mod p) Select one: True…

A:

Q: Prove the above property. That is, prove that if a mod n = k and b mod n = j, then (a + b) mod n =…

A: If a mod n =k and b mod n=j show that a+b mod n =j+k mod n. Definition: If x mod y=z, then y | x-z.…

Q: (2) If a = b modn and a = b mod m and ged(m, n): 1. then a =b mod mn.

A: The greatest common divisor of two or more integers, which are not all zero, is the largest positive…

Q: For any integers m and n, if m mod 11 is 6 and n mod 11 is 7, what is m+n mod 11? 13 9 42

A:

Q: Show that if p is a prime number then xy ≡ 0 mod p implies that x ≡ 0 mod p or y ≡ 0 mod p

A: