WorksheetsTAC3121-Quiz 2
Total questions: 10
Worksheet time: 10mins
Name
Class
Date
1.
Two numbers a, b are relatively prime if they have only 1 as their common divisor.
a)
True
b)
False
2.
Given p = 17, then every number from 1 to 16 is relatively prime to p and has exactly one inverse mod p .
a)
True
b)
False
3.
GCD(15, 60) = 5
a)
True
b)
False
4.
Extended Euclidean algorithm is used to compute the greatest common divisor GCD.
a)
True
b)
False
5.
The multiplicative inverse of 4 mod 7 is 3.
a)
True
b)
False
6.
Following Fermat’s Theorem, 312 = 1 mod 13.
a)
True
b)
False
7.
Euler Totient Function Φ(9) = 4.
a)
True
b)
False
8.
Following Euler's Theorem, 74 = 1 mod 10.
a)
True
b)
False
9.
Discrete Logarithm problem is a more difficult problem than Computational Diffie-Hellman problem.
a)
True
b)
False
10.
Chinese Remainder Theorem works on mi separately which provides faster computation than working in the full modulus M.
a)
True
b)
False
100 %
