Number Theory: Mathematical Problems and Solutions: Multiple Choice
Questions (MCQs) on Prime Numbers, Divisibility, GCD, and LCM
1. What is the smallest prime number greater than 100?
a) 101
b) 103
c) 107
d) 109
Steps:
1. Start with 101 and check if it's prime.
2. A number is prime if it's only divisible by 1 and itself.
3. Check divisibility by prime numbers up to its square root (10 in this case).
4. 101 is not divisible by 2, 3, 5, or 7.
5. Therefore, 101 is prime.
Answer: a) 101
2. How many prime numbers are there between 1 and 20?
a) 6
b) 7
c) 8
d) 9
Steps:
1. List all numbers from 1 to 20.
2. Cross out 1 as it's not prime.
3. Circle 2 and cross out its multiples.
4. Circle 3 and cross out its multiples.
5. Continue this process.
6. The remaining circled numbers are: 2, 3, 5, 7, 11, 13, 17, 19.
7. Count the circled numbers.
Answer: c) 8
3. What is the greatest common divisor (GCD) of 48 and 18?
a) 3
b) 6
c) 9
d) 12
Steps:
1. List the factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
2. List the factors of 18: 1, 2, 3, 6, 9, 18
3. Identify the common factors: 1, 2, 3, 6
4. Choose the greatest among the common factors.
Answer: b) 6
4. What is the least common multiple (LCM) of 12 and 18?
a) 24
b) 36
c) 48
d) 72
Steps:
1. Find the prime factorization of 12: 2² × 3
2. Find the prime factorization of 18: 2 × 3²
3. Take each prime factor to the highest power in which it occurs in either number.
4. LCM = 2² × 3² = 4 × 9 = 36
Answer: b) 36
5. Which of the following numbers is divisible by both 3 and 4?
a) 24
b) 32
c) 40
d) 48
Steps:
1. A number divisible by 3 has a sum of digits divisible by 3.
2. A number divisible by 4 has its last two digits divisible by 4.
3. Check each option:
24: 2+4=6 (divisible by 3), 24 is divisible by 4
32: 3+2=5 (not divisible by 3)
40: 4+0=4 (not divisible by 3)
48: 4+8=12 (divisible by 3), 48 is divisible by 4
Answer: d) 48
6. What is the sum of the first 10 prime numbers?
a) 99
b) 109
c) 119
d) 129
Steps:
1. List the first 10 prime numbers: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29
2. Add these numbers: 2+3+5+7+11+13+17+19+23+29 = 129
Answer: d) 129
7. What is the smallest composite number?
a) 1
b) 2
c) 4
d) 6
Steps:
1. Recall that a composite number has factors other than 1 and itself.
2. 1 is neither prime nor composite.
3. 2 is prime.
4. 4 = 2 × 2, so it's the first number with factors other than 1 and itself.
Answer: c) 4
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
8. How many factors does the number 36 have?
a) 6
b) 8
c) 9
d) 12
Steps:
1. Find the prime factorization of 36: 2² × 3²
2. For each prime factor, add 1 to its exponent: (2+1) × (2+1)
3. Multiply these numbers: 3 × 3 = 9
Answer: c) 9
9. What is the prime factorization of 60?
a) 2² × 3 × 5
b) 2 × 3² × 5
c) 2² × 3² × 5
d) 2³ × 3 × 5
Steps:
1. Divide 60 by the smallest prime number that divides it evenly, continue until the quotient is 1.
60 ÷ 2 = 30
30 ÷ 2 = 15
15 ÷ 3 = 5
5 ÷ 5 = 1
2. The divisors used are the prime factors: 2, 2, 3, 5
3. Write in exponential form: 2² × 3 × 5
Answer: a) 2² × 3 × 5
10. What is the remainder when 17 is divided by 5?
a) 1
b) 2
c) 3
d) 4
Steps:
1. Divide 17 by 5: 17 = 3 × 5 + 2
2. The remainder is the number added to the product: 2
Answer: b) 2
11. Which of the following is a Mersenne prime?
a) 7
b) 31
c) 61
d) 127
Steps:
1. Recall that Mersenne primes are of the form 2ⁿ - 1, where n is prime.
2. Check each option:
7 = 2³ - 1 (n = 3, which is prime)
31 = 2⁵ - 1 (n = 5, which is prime)
61 is not of the form 2ⁿ - 1
127 = 2⁷ - 1 (n = 7, which is prime)
3. Both 7 and 31 are Mersenne primes, but 31 is listed in the options.
Answer: b) 31
12. What is the GCD of 0 and 5?
a) 0
b) 1
c) 5
d) undefined
Steps:
1. Recall that for any number n, GCD(0, n) = n.
2. This is because any number divides 0, so the greatest divisor of 0 and n is n itself.
Answer: c) 5
13. How many prime factors does 100 have?
a) 2
b) 3
c) 4
d) 5
Steps:
1. Find the prime factorization of 100:
100 = 2² × 5²
2. Count the unique prime factors: 2 and 5
Answer: a) 2
14. What is the LCM of 15 and 25?
a) 45
b) 60
c) 75
d) 90
Steps:
1. Find prime factorizations:
15 = 3 × 5
25 = 5²
2. Take each prime to the highest power in which it appears:
LCM = 3 × 5² = 3 × 25 = 75
Answer: c) 75
15. Which of the following numbers is a perfect square?
a) 72
b) 81
c) 90
d) 99
Steps:
1. A perfect square is the product of an integer with itself.
2. Check each number:
72 = 8 × 9 (not a perfect square)
81 = 9 × 9 = 9² (a perfect square)
90 = 9 × 10 (not a perfect square)
99 = 9 × 11 (not a perfect square)
Answer: b) 81
16. What is the largest prime factor of 42?
a) 2
b) 3
c) 6
d) 7
Steps:
1. Find the prime factorization of 42:
42 = 2 × 3 × 7
2. Identify the largest prime in this factorization.
Answer: d) 7
17. How many prime numbers are there between 20 and 40?
a) 4
b) 5
c) 6
d) 7
Steps:
1. List all prime numbers between 20 and 40:
23, 29, 31, 37
2. Count these numbers.
Answer: b) 5
18. What is the sum of the factors of 28?
a) 48
b) 52
c) 56
d) 60
Steps:
1. List all factors of 28: 1, 2, 4, 7, 14, 28
2. Add these factors: 1 + 2 + 4 + 7 + 14 + 28 = 56
Answer: c) 56
19. Which of the following is a twin prime pair?
a) (3, 5)
b) (5, 7)
c) (11, 13)
d) (17, 19)
Steps:
1. Recall that twin primes are consecutive odd numbers that are both prime.
2. Check each pair:
(3, 5): Both prime, but not consecutive odd numbers
(5, 7): Both prime, but not consecutive odd numbers
(11, 13): Both prime and consecutive odd numbers
(17, 19): Both prime and consecutive odd numbers
Answer: c) (11, 13)
20. What is the smallest number that is divisible by all numbers from 1 to 5?
a) 30
b) 40
c) 60
d) 120
Steps:
1. Find the LCM of 1, 2, 3, 4, and 5:
1 = 1
2 = 2
3 = 3
4 = 2²
5 = 5
2. Take each prime factor to its highest power: 2² × 3 × 5 = 60
Answer: c) 60
21. What is the GCD of 36 and 54?
a) 6
b) 9
c) 12
d) 18
Steps:
1. Use the Euclidean algorithm:
54 = 1 × 36 + 18
36 = 2 × 18 + 0
2. The last non-zero remainder is the GCD.
Answer: d) 18
22. How many numbers between 1 and 100 are coprime to 30?
a) 40
b) 48
c) 56
d) 64
Steps:
1. Numbers coprime to 30 are not divisible by 2, 3, or 5.
2. Use the principle of inclusion-exclusion:
100 - (50 + 33 + 20) + (16 + 10 + 6) - 3 = 48
Answer: b) 48
23. What is the smallest prime number greater than 50?
a) 51
b) 53
c) 57
d) 59
Steps:
1. Start with 51 and check for primality:
51 is divisible by 3
2. Check 53:
53 is not divisible by any number up to its square root
3. 53 is prime
Answer: b) 53
24. What is the LCM of 8, 12, and 16?
a) 24
b) 48
c) 72
d) 96
Steps:
1. Find prime factorizations:
8 = 2³
12 = 2² × 3
16 = 2⁴
2. Take each prime to its highest power:
LCM = 2⁴ × 3 = 48
Answer: b) 48
25. Which of the following is a Fermat prime?
a) 3
b) 5
c) 17
d) 257
Steps:
1. Recall that Fermat primes are of the form 2^(2^n) + 1
2. Check each option:
3 = 2² + 1
5 = 2² + 1
17 = 2⁴ + 1
257 = 2⁸ + 1 (but this is not prime)
Answer: c) 17
