hard · GMAT Quant
A secure hash function uses a modulus equal to 14^10.
What is the smallest positive integer n such that n! is a multiple of this modulus?
A secure hash function uses a modulus equal to 14^10. What is the smallest positive integer n such that n! is a multiple of this modulus?
- 14
- 63
- 70
- 140
- 49
Sign up free to see the explanation and track your rank →
More GMAT Quant practice
- Including both endpoints, how many distinct integer price points are in this range?
- Which of the following expressions must result in a positive value?
- Which property of arithmetic justifies that first step?
- Which of the following must also be an even integer?
- Which of the following inequalities correctly represents this range?
- Which of the following includes the number 0?
- How many unique meal combinations can a customer create?
- What is the probability that the lightbulb is functional?