For each positive integer $n$ let \[x_n=p_1+\cdots+p_n\] where $p_1,\ldots,p_n$ are the first $n$ primes. Prove that for each positive integer $n$, there is an integer $k_n$ such that $x_n<k_n^2<x_{n+1}$
Source:
Tags: number theory unsolved, number theory
For each positive integer $n$ let \[x_n=p_1+\cdots+p_n\] where $p_1,\ldots,p_n$ are the first $n$ primes. Prove that for each positive integer $n$, there is an integer $k_n$ such that $x_n<k_n^2<x_{n+1}$