Three Sums

Algebra Level 5

For a positive integer k k , let x k x_k be the largest positive real solution to the equation 2 x + 1 k ( k + 1 ) x 2 1 = 1. \frac{2}{x}+\frac{1}{\sqrt{k(k+1)x^2-1}}=1. Let S n = k = 1 n 1 2 + 2 x k , T n = k = 1 n 1 1 + 2 + 2 S k S_n=\sum_{k=1}^n\frac{1}{\sqrt{2+2x_k}}, \quad T_n=\sum_{k=1}^n\frac{1}{1+\sqrt{2}+2S_k}
and U n = k = 1 n ( T k 2 + k 2 T k 2 ) . U_n=\sum_{k=1}^n\left(T_k^2+\frac{k^2}{T_k^2}\right). Find the least positive integer n n such that U n > 201600 U_n>201600 .


The answer is 240.

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.

1 solution

Matt Janko
Apr 5, 2020

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 , r_kx^4 - 4r_kx^3 + (4r_k - 2)x^2 + 4x - 4 = 0, where r k = k ( k + 1 ) r_k = k(k + 1) , and this can be factored as ( x 2 2 x 2 k ) ( r k x 2 2 r k x + 2 k ) = 0. \left( x^2 - 2x - \frac 2k \right)(r_kx^2 - 2r_kx + 2k) = 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 + 2 k x k = 1 + 1 + 2 k . x = 1 \pm \sqrt{1 + \frac 2k} \implies x_k = 1 + \sqrt{1 + \frac 2k}. Using this expression for x k x_k , we can compute all the values of S n S_n , T n T_n , and U n U_n directly (e.g., using a script like the one below). When n = 239 n = 239 , we have U n 200100.099 U_n \approx 200100.099 , and when n = 240 n = 240 , we have U n 202172.735 U_n \approx 202172.735 . Therefore, the desired value of n n is 240 \boxed{240} .

def x(n):
    return 1 + (1 + 2/n)**(1/2)
def s(n):
    if n == 1:
        return 1/(2 + 2*x(1))**(1/2)
    return s(n - 1) + 1/(2 + 2*x(n))**(1/2)
def t(n):
    if n == 1:
        return 1/(1 + 2**(1/2) + 2*s(1))
    return t(n - 1) + 1/(1 + 2**(1/2) + 2*s(n))
def u(n):
    if n == 1:
        return t(1)**2 + 1/t(1)**2
    return u(n - 1) + t(n)**2 + n**2/t(n)**2
print(u(239))
print(u(240))

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...