SAT1000 - P873

Algebra Level pending

If there exists tRt \in \mathbb R, so that the following system of nn equations all holds:

{t=1t2=2t3=3tn=n\begin{cases} \begin{aligned} \lfloor t \rfloor & = 1 \\ \lfloor t^2 \rfloor & = 2 \\ \lfloor t^3 \rfloor & = 3 \\ & \vdots \\ \lfloor t^n \rfloor & = n \end{aligned} \end{cases}

Then find the maximum of positive integer nn.


Have a look at my problem set: SAT 1000 problems

×

Problem Loading...

Note Loading...

Set Loading...