Floor function 2

Number Theory Level pending

Let \( a_{n} = \left\lfloor \frac{n^{2}}{104} \right\rfloor, \) where \( \left\lfloor x \right\rfloor \) gives the largest integer less than or equal to \( x.\) Then how many distinct numbers are there in the sequence \( a_{1} , a_{2}, a_{3}, \cdots a_{103}? \)

×

Problem Loading...

Note Loading...

Set Loading...