For a positive integer
k
, let
x
k
be the largest positive real solution to the equation
x
2
+
k
(
k
+
1
)
x
2
−
1
1
=
1
.
Let
S
n
=
k
=
1
∑
n
2
+
2
x
k
1
,
T
n
=
k
=
1
∑
n
1
+
2
+
2
S
k
1
and
U
n
=
k
=
1
∑
n
(
T
k
2
+
T
k
2
k
2
)
.
Find the least positive integer
n
such that
U
n
>
2
0
1
6
0
0
.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Problem Loading...
Note Loading...
Set Loading...
The given equation can be rewritten as the quartic r k x 4 − 4 r k x 3 + ( 4 r k − 2 ) x 2 + 4 x − 4 = 0 , where r k = k ( k + 1 ) , and this can be factored as ( x 2 − 2 x − k 2 ) ( r k x 2 − 2 r k x + 2 k ) = 0 . The solutions obtained from the second quadratic factor turn out to be extraneous. The solutions from the first quadratic factor are x = 1 ± 1 + k 2 ⟹ x k = 1 + 1 + k 2 . Using this expression for x k , we can compute all the values of S n , T n , and U n directly (e.g., using a script like the one below). When n = 2 3 9 , we have U n ≈ 2 0 0 1 0 0 . 0 9 9 , and when n = 2 4 0 , we have U n ≈ 2 0 2 1 7 2 . 7 3 5 . Therefore, the desired value of n is 2 4 0 .