1. If a|b and b|c, then a|c.

a) True

b) False

### View Answer

2. GCD(a,b) is the same as GCD(|a|,|b|).

a) True

b) False

### View Answer

3. Calculate the GCD of 1160718174 and 316258250 using Euclidean algorithm.

a) 882

b) 770

c) 1078

d) 1225

### View Answer

4. Calculate the GCD of 102947526 and 239821932 using Euclidean algorithm.

a) 11

b) 12

c) 8

d) 6

### View Answer

5. Calculate the GCD of 8376238 and 1921023 using Euclidean algorithm.

a) 13

b) 12

c) 17

d) 7

### View Answer

6. What is 11 mod 7 and -11 mod 7?

a) 4 and 5

b) 4 and 4

c) 5 and 3

d) 4 and -4

### View Answer

7. Which of the following is a valid property for concurrency?

a) a = b (mod n) if n|(a-b)

b) a = b (mod n) implies b = a (mod n)

c) a = b (mod n) and b = c (mod n) implies a = c (mod n)

d) All of the mentioned

### View Answer

8. [(a mod n) + (b mod n)] mod n = (a+b) mod n

a) True

b) False

### View Answer

9. [(a mod n) – (b mod n)] mod n = (b – a) mod n

a) True

b) False

### View Answer

10. 11^{7} mod 13 =

a) 3

b) 7

c) 5

d) 15

### View Answer

11. The multiplicative Inverse of 1234 mod 4321 is

a) 3239

b) 3213

c) 3242

d) Does not exist

### View Answer

12. The multiplicative Inverse of 550 mod 1769 is

a) 434

b) 224

c) 550

d) Does not exist

### View Answer

13. The multiplicative Inverse of 24140 mod 40902 is

a) 2355

b) 5343

c) 3534

d) Does not exist