Suppose that (n, e) is an rsa encryption key, with n = pq, where p and q are large primes and gcd(e, (p − 1)(q − 1)) = 1. furthermore, suppose that d is an inverse of e modulo (p − 1)(q − 1). suppose that c ≡ me (mod pq). in the text we showed that rsa decryption, that is, the congruence cd ≡ m (mod pq) holds when gcd(m, pq) = 1. show that this decryption congruence also holds when gcd(m, pq) > 1. [hint: use congruences modulo p and modulo q and apply the chinese remainder theorem.]

dc=6 square root of 3 and ac is 12 square root 3

c and d

step-by-step explanation:

square root of 3/2 = 18/c

cross multiply to get 18*2=√3*c

36/√3 * √3/√3 = c

c= 36*√3/3

c=12√3

i think there was a typo. you wrote pat brings 3 quarts of ice-cream to the party. each serving of ice-cream is 1 6 quart. how many total servings of ice-cream does pat bring to the party? i think the bold is supposed to be 1/6. so 1 quart of ice cream = 6 servings. 6 * 3 = 18.

ur right ive taken the test

step-by-step explanation: