MathCastle
Number TheoryChallengeHard Number Theory

Hard Number Theory · Challenge problem

For how many positive integers n≤1000n \le 1000 does ⌊n2⌋+⌊n3⌋+⌊n6⌋=n\left\lfloor \dfrac n2 \right\rfloor + \left\lfloor \dfrac n3 \right\rfloor + \left\lfloor \dfrac n6 \right\rfloor = n?