# Welcome to the Number Theory and Finite Fields MCQs Page

Dive deep into the fascinating world of Number Theory and Finite Fields with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Number Theory and Finite Fields, a crucial aspect of Cryptography and Network Security. In this section, you will encounter a diverse range of MCQs that cover various aspects of Number Theory and Finite Fields, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Cryptography and Network Security.

Check out the MCQs below to embark on an enriching journey through Number Theory and Finite Fields. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Cryptography and Network Security.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Number Theory and Finite Fields. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

### Number Theory and Finite Fields MCQs | Page 1 of 10

Q1.
If a|b and b|c, then a|c.
Q2.
GCD(a,b) is the same as GCD(|a|,|b|).
Q3.
Calculate the GCD of 1160718174 and 316258250 using Euclidean algorithm.
Q4.
Calculate the GCD of 102947526 and 239821932 using Euclidean algorithm.
Q5.
Calculate the GCD of 8376238 and 1921023 using Euclidean algorithm.
Q6.
What is 11 mod 7 and -11 mod 7?
Q7.
Which of the following is a valid property for concurrency?
Q8.
[(a mod n) + (b mod n)] mod n = (a+b) mod n
Q9.
[(a mod n) – (b mod n)] mod n = (b – a) mod n
Q10.
11^7 mod 13 =

a.

3

b.

7

c.

5

d.

15