Select Page

# Understand the problem

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
##### Source of the problem
SMO (senior)-2014 stage 2 problem 4

Number Theory
Medium
##### Suggested Book
Excursion in Mathematics

# Start with hints

Do you really need a hint? Try it first!

We have $P_1 = 2 , P_=3 , P_3=5 , P_4 =7 , P_5 = 11 \ and \ so \ on ….$. Now to understand the expression   $x_n  ,  observe .   $For \ n=1 \ , \ 2 < 2^2 < 2+3$  $For \ n=2 \ , \ 2+3 < 3^2 < 2+3+5$ $For \ n=3 \ , \ 2+3+5 < 4^2 < 2+3 +5+7$ $For \ n=4 \ , \ 2+3 +5+7 < 5^2 <2+3 +5+7 +11$ Now proceed to prove $\forall n \geq 5$ .
Observe  $\forall n \geq 5$ we have $P_n > (2n-1)$. [where $n \in Z^+$] Then try to use  $x_n = P_1 + P_2 + …+P_5+….. +P_n > 1 +3 + ….+ 9 +… (2n-1) = n^2 \\ \Rightarrow x_n > n^2 , \forall n \geq 5[where \ n \in Z^+]$ .
Think if $x_n=P_1 + P_2 + …. + P_5 +…P_n = b^2 for \ some \ n , b \in Z^+$ , then we are done . If not so , then think $m$ be the largest non negative integer such that  $(n+m)^2 < x_n$ . Now note that the next perfect square is $(n+m+1)^2$ . Observe that if we can prove that   $(n+m+1)^2 – (n+m)^2 = (2n+ 2m +1) \geq P_{n+1}$  , then we are done . Now try to verify this claim .

Suppose our claim is not true  i.e. $P_n < 2n + 2m +1$ . So,   $P_n < 2n + 2m +1 \\ \Rightarrow 2n+ 2m \geq P_n , \forall n \in Z^+ \\ \Rightarrow (2n +2m-2)+(2n+ 2m -4)+…..2m \geq P_n + P_{n-1}+……+P_1 \\ \Rightarrow n^2 + 2mn -n \geq P_n + P_{n-1}+……+P_1 \\ \Rightarrow n^2 + 2mn -n \geq x_n \\ \Rightarrow n^2 + 2mn +m^2 > n^2 + 2mn -n\geq x_n \\ \Rightarrow (n+m)^2 > x_n$ .  Contradiction!  since we have assumed $x_n = P_1 + P_2+……+P_{n-1} > (n+m)^2$ . Thus ,$(n+m+1)^2 \in (x_n , x_{n+1})$  .

# Connected Program at Cheenta

#### Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

# Similar Problems

## Lines and Angles | PRMO 2019 | Question 7

Try this beautiful problem from the Pre-RMO, 2019 based on Lines and Angles. You may use sequential hints to solve the problem.

## Logarithm and Equations | AIME I, 2012 | Question 9

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2015 based on Logarithm and Equations.

## Cross section of solids and volumes | AIME I 2012 | Question 8

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2012 based on Cross section of solids and volumes.

## Angles of Star | AMC 8, 2000 | Problem 24

Try this beautiful problem from GeometryAMC-8, 2000 ,Problem-24, based triangle. You may use sequential hints to solve the problem.

## Unit digit | Algebra | AMC 8, 2014 | Problem 22

Try this beautiful problem from Algebra about unit digit from AMC-8, 2014. You may use sequential hints to solve the problem.

## Problem based on Integer | PRMO-2018 | Problem 6

Try this beautiful problem from Algebra based on Quadratic equation from PRMO 8, 2018. You may use sequential hints to solve the problem.

## Number counting | ISI-B.stat Entrance | Objective from TOMATO

Try this beautiful problem Based on Number counting .You may use sequential hints to solve the problem.

## Area of a Triangle | AMC-8, 2000 | Problem 25

Try this beautiful problem from Geometry: Area of the triangle from AMC-8, 2000, Problem-25. You may use sequential hints to solve the problem.

## Trapezium | Geometry | PRMO-2018 | Problem 5

Try this beautiful problem from Geometry based on Trapezium from PRMO , 2018. You may use sequential hints to solve the problem.

## Probability Problem | AMC 8, 2016 | Problem no. 21

Try this beautiful problem from Probability from AMC-8, 2016 Problem 21. You may use sequential hints to solve the problem.