Let p and q be distinct odd primes such that gcd(p−1, q−1) = 2. Does there exist an integer M such that aM ≡ a-1 (mod p) and aM ≡ a (mod q) for all a ∈ (Z/pqZ)*? What if gcd(p−1, q−1)

Q: 3. Find integers x, y € [0,51] such that (a) 23x= 1(mod52) (b) 23y = 4(mod52)

A:

Q: Given 6x + 2 ≡ 101 (mod 7), find an integer z such that 2x ≡ z (mod 7)

A:

Q: Let p= 2k +1 be an odd prime number. Show that x* – 1 = (X – 1)(X – 2²) - · (X – k²) mod p.

A:

Q: Find all x (mod 1999) such that x³ = 2 (mod 1999).

A: We use primitive roots to solve this problem.

Q: Let a, m € Z+ and (a,m) = (a - 1, m) = 1. Then prove that 1+a+...+ a(m)-1 = 0(modm)

A: For given,       (a,m) = (a -1, m) = 1 We have to show,      1 + a + a 2 + ........ + a φ (m)-1 ≡ 0…

Q: Find the smallest integer a > 1 such that a –1 = 2a (mod 11

A: To find:

Q: Let a and b be positive integers and let b= qa +r, where 0 ≤r <a. Prove that (a) 2b - 1 = 2" - 1…

A: Let  and  be two positive integers.Let  where (a) We  have to prove that      Now, observe that…

Q: If al = b (mod p), then prove that a = b (mod p).

A: (ii) given that                                                ap≡bp   (mod p) we have to prove…

Q: Suppose that a is an odd integer and (a, 91) = 1. Prove that a12 ≡ 1 (mod 1456).

A:

Q: Let a and b be natural numbers, where a,b >= 2, such that gcd(a,b)=1 and ab=(x+y)n for some natural…

A: Given that a and b are natural numbers and  a , b ≥ 2 .  Also, given that gcda,b = 1 and ab = x+yn…

Q: Let p and q be two distinct primes. (a) Prove that if a = b (mod p) and a = b (mod q), then a = b…

A:

Q: Suppose that p is a prime with p = 5 mod 8 . Show that the congruence px2 + 6y = 1 mod 3p has no…

A: Consider the given information.

Q: Let n be a positive integer and let ged(b, n) = 1. Show that bx by (mod n) if and only if x=y(mod…

A:

Q: Let (a,b)=1 with a = c (mod b) and bª = c (mod a) for some integer c. Prove that ab+(b). +ba+(a) = c…

A:

Q: Show that if a ≡ b (mod m) and c ≡ d (mod m), then a + c ≡ b + d (mod m).

A:

Q: Let a and b be relatively prime positive integers. Show that a(b) + b(a) = 1(mod ab).

A: Solution:

Q: Find a number a such that 70a = 1 mod 17.

A:

Q: (a) Prove that 318 = q (mod 19).

A:

Q: Find all x EZ221 such that x2 =97 (mod 221).

A: To find : all x∈ℤ221 such that x2≡97mod 221 Pre-requisite : Properties of Legendre symbol - 1. ap=1,…

Q: Find all integer values of x for which 3x = 4 (mod 8).

A: given congruence equation 3x≡4(mod 8)

Q: Show that y = x (mod p) leads to -y = -x (mod p).

A:

Q: Let a € Z be odd. (a) Prove that a = 1 (mod 4) or a = 3 (mod 4). (b) Prove that a² = 1 (mod 4).

A:

Q: (b) Give an example of a composite integer n such that the congruence x =1 (mod n) pas more than two…

A:

Q: Find all integers sx such that 2x = 5 (mod 7).

A:

Q: e) Let p and q >7 be primes such that 2 +2P +1 =0 mod q. Prove that q = 1+6kp for ome natural number…

A:

Q: Show that if p = 1 (mod 4), then x² = -1 (mod p) has a solution given by the least residue (mod p)…

A: Given: p≡1 mod 4We need to prove that x2≡-1 mod p has a solution given by the least residue mod p of…

Q: Find a number x between 0 and 90, such that x ≡ [4,8] mod [7,13].

A:

Q: Use Wilson's Theorem to prove that for primes p congruent to 1 modulo 4 the quadratic congruence 1'…

A: Given The quadratic congruence x2≡-1(mod p) To prove  x2≡-1(mod p) has a solution if p≡1(mod 4)…

Q: Let p be an odd prime number and let b be an integer with p /| b. Prove that either b has two square…

A: Given:(a) Let be an odd prime number and let be an integer with does not divide . Aim:(a) Prove…

Q: Let A = {1, 2, ..., 12}. Let aRb mean a = b (mod 5). (a) Give [2]R. [3]R, and [5]R. (b) Give [2]…

A: A set of ordered pairs is referred to as a relation in the area of mathematics and computer science.…

Q: Let p be an odd prime and let a and b be integers with ab #0(mod p). Show that ax² = b(mod p) has a…

A: Note that if a=b mod p then (a|p)=(b|p) where (a|p) denotes the Legendre Symbol.