🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← All topics

Quiz: Number Theory: questions with answers

9 questions, each with the answer and a short explanation.

Take the timed quiz + get a certificate →
  1. Q1. What is gcd(252, 105)?
  2. Q2. Why do programming problems ask for answers "modulo 10^9 + 7"?
  3. Q3. When does a modulo m have a multiplicative inverse?
  4. Q4. In the toy RSA, what does the security of real RSA rely on?
  5. Q5. What is the prime factorisation of 360?
  6. Q6. To test whether 97 is prime by trial division, which divisors must you try?
  7. Q7. What does this print? (code)
  8. Q8. What is the inverse of 7 modulo 26?
  9. Q9. In toy RSA with p = 3, q = 11 and e = 3, what is the private key d?