Scribd
Upload
12 views2 pages

DMS Tutorial 8

The document outlines a core B.Tech course in Discrete Mathematical Structures for the School of Computer Science Engineering and Technology, covering integer arithmetic and congruences. It includes a CO-mapping table, course objectives, and a set of nine questions related to the topics taught. The questions involve operations in modular arithmetic, properties of congruences, the Euclidean algorithm, and applications in cryptography.

Uploaded by

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

DMS Tutorial 8

The document outlines a core B.Tech course in Discrete Mathematical Structures for the School of Computer Science Engineering and Technology, covering integer arithmetic and congruences. It includes a CO-mapping table, course objectives, and a set of nine questions related to the topics taught. The questions involve operations in modular arithmetic, properties of congruences, the Euclidean algorithm, and applications in cryptography.

Uploaded by

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

School of Computer Science Engineering and Technology

Course-B.Tech Type- Core


Course Code- CSET106 Course Name- Discrete Mathematical Structures

Year- 2024 Semester- Even


Date- 28/03/2024 Batch- 2023-2027

CO-Mapping
Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9
CO1
CO2         
CO3  

Objectives
1. Students will be able to understand the integer arithmetic.
2. Students will be able to recognize the theory of congruences.
3. Students will be able to understand the applications related to congruence and inverse congruence.

Questions:
9
1. Find the last two digits of the number 9 9 .

2. If a is an odd integer, then prove that a 2 ≡1 ( mod 8 ) .

3. Perform the following operations in Zn:

a. Add 9 to 8 in Z10.

b. 85-28 (mod 20)

c. 91*89 (mod 30) (Note: Try to use congruence properties to simplify. )

4. Let n>1 be fixed and a, b, c, d be arbitrary integers then prove the following properties:
a. If a ≡ b(mod n) , then a+ c ≡ b+c (mod n) and ac ≡bc (mod n)

b. If a ≡ b(mod n) , then a k ≡ bk (mod n) for any positive integer k.

5. Using Euclidean algorithm find the GCD of the following:


a. 1475, 1200
b. 766, 1235

6. Use the Euclidean Algorithm to obtain integer x and y satisfying the following:
a. GCD(119, 272) = 119 x + 272 y.
b. GCD(1769, 2378) = 1769 x + 2378 y.

7. Solve the following linear congruence:


a. 18 x ≡ 30 (mod 42)
b. 9 x ≡ 21 (mod 30)
School of Computer Science Engineering and Technology

8. Find the multiplicative inverse of each of the elements of Z15 (if possible).

9. In a multiplicative cipher, ciphertext is calculated from plaintext by using the relation


C ≡ P*k (mod 26). What is the ciphertext for “India” by using key k=5? Here, alphabets are denoted
as A = 1, B = 2, …, Y = 25, Z = 0.

Integral numbers are the fountainhead of all mathematics.


- H. MINKOWSKI

You might also like