Scribd
Upload
30 views2 pages

4th Module QB

The document is a question bank for a Mathematics course focused on Computer Science and Engineering, covering various topics in number theory and linear Diophantine equations. It includes problems related to remainders, congruences, the Chinese Remainder Theorem, and RSA encryption and decryption. The questions are designed to test students' understanding and application of mathematical concepts in practical scenarios.

Uploaded by

deekshasn18
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
30 views2 pages

4th Module QB

The document is a question bank for a Mathematics course focused on Computer Science and Engineering, covering various topics in number theory and linear Diophantine equations. It includes problems related to remainders, congruences, the Chinese Remainder Theorem, and RSA encryption and decryption. The questions are designed to test students' understanding and application of mathematical concepts in practical scenarios.

Uploaded by

deekshasn18
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

Global Academy of Technology

Department of Mathematics
Mathematics I for Computer Science and Engineering Stream (Integrated) (BMATS24101)

Question Bank
MODULE-4
1. Find the remainders when 1! + 2! + 3! + ⋯ + 100! is divided by 15.

2. Find the remainders when 1653 is divided by 7.

3. Use congruence theory to show that 7|52𝑛 + 3 ∙ 25𝑛−2 , for any integer 𝑛 ≥ 1.

4. Use congruence theory to establish 43|6𝑛+2 + 72𝑛+1 , for 𝑛 ≥ 1.

5. Find the solution of the linear Diophantine equation 15𝑥 + 6𝑦 = 7.

6. Find the solution of the linear Diophantine equation 21𝑥 + 14𝑦 = 70.

7. Find the solution of the linear Diophantine equation 2𝑥 + 5𝑦 = 11.

8. Solve 60𝑥 + 18𝑦 = 97.

9. Solve 70𝑥 + 112𝑦 = 168.

10. Solve 18𝑥 ≡ 30 (𝑚𝑜𝑑 42).

11. Solve 9𝑥 ≡ 21 (𝑚𝑜𝑑 30).

12. Solve 980𝑥 ≡ 1500 (𝑚𝑜𝑑 1600).

13. Solve 3𝑥 ≡ 6 (𝑚𝑜𝑑 9).

14. Solve 9𝑥 ≡ 12 (𝑚𝑜𝑑 15).

15. Solve 𝑥 ≡ 1 (𝑚𝑜𝑑 3), 𝑥 ≡ 2 (𝑚𝑜𝑑 5), 𝑥 ≡ 1 (𝑚𝑜𝑑 7) by using Chinese Remainder

Theorem (CRT).

16. Solve 𝑥 ≡ 2 (𝑚𝑜𝑑 3), 𝑥 ≡ 3 (𝑚𝑜𝑑 5), 𝑥 ≡ 2 (𝑚𝑜𝑑 7) by using Chinese Remainder

Theorem (CRT).
17. Solve 𝑥 ≡ 5 (𝑚𝑜𝑑 6), 𝑥 ≡ 4 (𝑚𝑜𝑑 11), 𝑥 ≡ 3 (𝑚𝑜𝑑 17) by using Chinese Remainder

Theorem (CRT).

18. Solve 𝑥 ≡ 1 (𝑚𝑜𝑑 2), 𝑥 ≡ 2 (𝑚𝑜𝑑 3), 𝑥 ≡ 3 (𝑚𝑜𝑑 5) by using Chinese Remainder

Theorem (CRT).

19. Find the remainder when 241947 is divided by 17.

20. Find the least positive residue of 3201 modulo 11.

21. Using Fermat’s theorem solve 15𝑥 ≡ 7 (𝑚𝑜𝑑 13).

22. Using Fermat’s theorem solve 7𝑥 ≡ 12 (𝑚𝑜𝑑 17).

23. Using Fermat’s theorem solve 4𝑥 ≡ 11 (𝑚𝑜𝑑 19).

24. Using Fermat’s theorem solve 43𝑥 ≡ 17 (𝑚𝑜𝑑 23).

25. Find the remainder when 302020 is divided by 19.

26. Find the remainder when 435555 is divided by 31.

27. Encrypt the message GOLD MEDAL using the RSA algorithm with key (2561,5).

28. Encrypt the message ANIMAL using the RSA algorithm with key (55,3).

29. Decrypt the cipher text 10301511 that was created using RSA algorithm with key

(𝑛, 𝑒) = (2623,869).

30. Cryptanalyze BZEKP TMZPT EZN generated by an affine cipher.

You might also like