hard · GMAT Quant
A cryptographic protocol generates tokens V(n) = n(n+1)(n+2)(n+3)(n+4)(n+5) for positive integers n ≤ 80. A verification check requires V(n) to be divisible by 256.
How many positive integers n ≤ 80 satisfy the requirement that V(n) is a multiple of 256?
- 6
- 8
- 10
- 12
- 16
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?