Scribd
Upload
1K views2 pages

1 - Sem Module 5 Modular - Arithmetic QB PDF

This document contains a question bank with 20 multiple choice questions related to modular arithmetic and number theory. The questions cover topics like linear congruences, Chinese Remainder Theorem, solutions to systems of congruences, Euler's theorem, Fermat's theorem, and RSA cryptography. They are from the Department of Mathematics at Dayananda Sagar College of Engineering in Bengaluru, India.

Uploaded by

rishi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1K views2 pages

1 - Sem Module 5 Modular - Arithmetic QB PDF

This document contains a question bank with 20 multiple choice questions related to modular arithmetic and number theory. The questions cover topics like linear congruences, Chinese Remainder Theorem, solutions to systems of congruences, Euler's theorem, Fermat's theorem, and RSA cryptography. They are from the Department of Mathematics at Dayananda Sagar College of Engineering in Bengaluru, India.

Uploaded by

rishi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DAYANANDA SAGAR COLLEGE OF ENGINEERING

(An Autonomous Institute Affiliated to VTU, Belagavi)

Shavige Malleshwara Hills, Kumaraswamy Layout, Bengaluru-560078

DEPARTMENT OF MATHEMATICS
COURSE: Essential Mathematics I - CSE Stream
Course Code: 22MATS11
Module – 5: Modular Arithmetic
QUESTION BANK

Q.No. Questions

1. a. Find the linear congruences of 14𝑥 ≡ 12(𝑚𝑜𝑑 18)


b. Solve the congruences 9𝑥 ≡ 6(𝑚𝑜𝑑 15)
2. a. Find the linear congruences of 8𝑥 ≡ 12(𝑚𝑜𝑑 28)
b. Solve the congruences 10𝑥 ≡ 15(𝑚𝑜𝑑 45)
3. a. Solve the congruences 6𝑥 ≡ 15(𝑚𝑜𝑑 21)
b. Solve the following equation using CRT 𝑥 ≡ 6(𝑚𝑜𝑑 7) , 𝑥 ≡ 4(𝑚𝑜𝑑 8)
4. a. Solve the following equation using CRT 𝑥 ≡ 2(𝑚𝑜𝑑 3) , 𝑥 ≡ 3(𝑚𝑜𝑑 5) , 𝑥 ≡ 2(𝑚𝑜𝑑 7)
b. Solve the following equation using CRT 𝑥 ≡ 8(𝑚𝑜𝑑 9) , 𝑥 ≡ 3(𝑚𝑜𝑑 20)
5. a. Monica breeds some pets. She does not know the exact number of pets she has. So she told that
when she takes rounds, she observed some things. In the morning there are five pets in each group
except one group which has only two pets. In the afternoon there are seven pets in each group except
one group which has six pets. In the evening, there are eleven pets in each group. Monica is sure
that there are fewer than 150 pets. Find out, the smallest number of pets does she have.
b. Solve the following equation using CRT 𝑥 ≡ 4(𝑚𝑜𝑑 11) , 𝑥 ≡ 5(𝑚𝑜𝑑 7) , 𝑥 ≡ 6(𝑚𝑜𝑑 13)
6. a. Solve 𝑓(𝑥) = 𝑥 2 + 2𝑥 − 3 ≡ 0(𝑚𝑜𝑑 5)
b. Solve 𝑓(𝑥) = 4𝑥 4 − 3𝑥 3 + 2𝑥 2 + 5𝑥 − 4 ≡ 0(𝑚𝑜𝑑 6)
7. a. Solve 𝑓(𝑥) = 26𝑥 4 − 31𝑥 3 + 46𝑥 2 − 76𝑥 + 57 ≡ 0(𝑚𝑜𝑑 8)
b. Solve 𝑓(𝑥) = 2𝑥 3 − 𝑥 2 + 3𝑥 + 1 ≡ 0(𝑚𝑜𝑑 5)
8. a. Find the particular and general solutions to the equation 21x+14y=35
b. Find the particular and general solutions to the equation 25x+10y=15
9. a. Find the particular and general solutions to the equation 19x+13y=20
b. Find the particular and general solutions to the equation 14x+21y=77
10. a. Find the solutions of the system of congruences 3x+4y≡5(mod 13), 2x+5y≡7(mod 13)
b. Solve the system of linear congruences 7𝑥 + 3𝑦 ≡ 10(𝑚𝑜𝑑 16) 𝑎𝑛𝑑 2𝑥 + 5𝑦 ≡ 9 (𝑚𝑜𝑑 16)
11. a. Solve 5𝑥 + 3𝑦 ≡ 2(𝑚𝑜𝑑 14) 𝑎𝑛𝑑 − 3𝑥 + 4𝑦 ≡ 7 (𝑚𝑜𝑑 14)
b. Solve 4𝑥 + 5𝑦 ≡ 8(𝑚𝑜𝑑 9) 𝑎𝑛𝑑 2𝑥 + 6𝑦 ≡ 3 (𝑚𝑜𝑑 9)
12. a. Find the result of 499 𝑚𝑜𝑑 35 using Euler’s theorem.
b. (i) Prove that 1 + 11 + 112 + 113 +. . . 1131 ≡ 0(𝑚𝑜𝑑 51) using Euler’s theorem
(ii) Solve 624 (𝑚𝑜𝑑 35) using Euler’s theorem.
13. a. Evaluate using Euler’s theorem 3302 (𝑚𝑜𝑑 13).

1
DAYANANDA SAGAR COLLEGE OF ENGINEERING
(An Autonomous Institute Affiliated to VTU, Belagavi)

Shavige Malleshwara Hills, Kumaraswamy Layout, Bengaluru-560078

DEPARTMENT OF MATHEMATICS
b. (i) Find the result of 2062 (𝑚𝑜𝑑 77) using Euler’s theorem
(ii) Using Euler’s theorem calculate 7133 (𝑚𝑜𝑑 26).
14. a. If a=7, p=19, Solve using Fermat’s theorem
b. Find the remainder when 241947 is divided by 17 using Fermat’s theorem
15. a. Find the remainder when 151976 is divided by 23 using Fermat’s theorem.
b. Evaluate using Fermat’s theorem (i) 9794 mod 73 (ii) 4634 mod 19
16. a. (i) Solve 𝑥 86 congruent to 6 mod 29 using Fermat’s theorem
(ii) Find the remainder when 31,00,000 is divided by 53 using Fermat’s theorem
b. Show that 18!+1 is divisible by 437
17. a. (i) Verify that 4(29!)+5! divisible by 31.
(ii) Using Wilson’s theorem, show that 21! ≡1(mod 23)
b. Show that 63! ≡-1(mod 71)
18. a. Show that 17 is a prime by showing that 16! ≡ −1(mod 17)
b. (i) Find the remainder when 2(26)! Is divided by 29.
(ii) Find the remainder when 2(28)! is divided by 31
19. a. In a public key cryptosystem using RSA algorithm user uses two prime numbers 17 and 11. He
chooses 7 as encryption key. Find out decryption key. What will be the ciphertext, if the plaintext
is 88? Decrypt the ciphertext, what will be the value of plaintext?
b. Let p and q are two prime numbers, p=13, q=11. Take public key e=13. If plain text value is 13,
then what will be cipher text value according to RSA algorithm? Again, calculate plain text value
for ciphertext.
20. a. In a public key cryptosystem using RSA algorithm user uses two prime numbers 5 and 7. He chooses
11 as encryption key. Find out decryption key. What will be the ciphertext, if the plaintext is 2?
Decrypt the ciphertext, what will be the value of plain text?
b. In a public key cryptosystem using RSA algorithm user uses two prime numbers 3 and 11. He
chooses 7 as encryption key. Find out decryption key. What will be the ciphertext, if the plaintext
is 5? Decrypt the ciphertext, what will be the value of plain text?

You might also like