Factor to count divisors; remainders follow cycles.
Méthode pas à pas
Write numbers as products of primes.
Pièges fréquents
Off-by-one errors when counting endpoints.
Exemples de questions
Essayez de répondre avant d'ouvrir le corrigé. Les questions sont dans la langue de l'examen.
Question 1
Difficulté: facile≈ 2 min
How many prime numbers are there between 30 and 60, inclusive?
AA. 8
BB. 6
CC. 9
DD. 15
EE. 7
Voir la réponse et l'explication
Bonne réponse: E. 7
Explication
Test each odd number against primes up to its square root. The primes in the range are 31, 37, 41, 43, 47, 53, 59, so there are 7.
Question 2
Difficulté: moyenne≈ 2 min
How many trailing zeros does 30! have?
AA. 8
BB. 7
CC. 6
DD. 3
EE. 9
Voir la réponse et l'explication
Bonne réponse: B. 7
Explication
Each trailing zero comes from a factor pair 2 × 5, and factors of 2 are plentiful, so count the factors of 5: 6 multiples of 5, plus 1 multiples of 25, for 7. Counting only n/10 misses the higher powers of 5.
Question 3
Difficulté: difficile≈ 2 min
How many trailing zeros does 100! have?
AA. 25
BB. 23
CC. 10
DD. 24
EE. 26
Voir la réponse et l'explication
Bonne réponse: D. 24
Explication
Each trailing zero comes from a factor pair 2 × 5, and factors of 2 are plentiful, so count the factors of 5: 20 multiples of 5, plus 4 multiples of 25, for 24. Counting only n/10 misses the higher powers of 5.