hard · GMAT Quant
An inventory routing module processes sets of five consecutive positive integers n, n+1, n+2, n+3, n+4.
What is the smallest positive integer n such that the product n(n+1)(n+2)(n+3)(n+4) is divisible by 1800?
- 5
- 10
- 15
- 21
- 25
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?
- What is the final price of the jacket?
- How many total ways can the traveler get from City X to City Z?
- What is the speed of the current?
- Which of the following includes the number 0?
- If the child picks one letter at random, what is the probability that it is a consonant?
- Which of the following expressions must result in a positive value?
- Which of the following must also be an even integer?