Find sum of all positive integers such that there exist a sequence of positive integers satisfying for every with
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.
This is from IMO 2009 Short List and is quite hard to solve.
The sequence exists for n = 1 , 2 , 3 , 4 .For n = 1 , 2 , 3 , a sequence can be easily constructed.But for n = 4 , its a bit tough to construct a sequence.For n = 4 ,a sequence can be a 1 = 4 , a 2 = 3 3 , a 3 = 2 1 7 and a 4 = 1 3 8 4 .
I will now give a brief sketch of the solution:
Proving that there exist no sequence for n = 5 is enough.The proof is by contradiction. Assume such a sequence exist.
At first,prove that a 1 cannot be odd,which will be comparatively easy to show.
So, assume a 1 is even.Now,you have to show it is also not possible,which is a bit tough.In this case,at first,show that a 2 cannot be odd.(which is easy).
So,then you can assume a 2 is even.One have to show that it is also impossible.
See that if a 2 is even,then a 4 and a 5 are also even. Note that a 2 + 1 ∣ a 3 2 + 1 and a 3 + 1 ∣ a 2 2 + 1 .Now, you have to show a more general statement:"there exist no even x and y such that x + 1 ∣ y 2 + 1 and y + 1 ∣ x 2 + 1 "To do this first show, both ( x + 1 ) and ( y + 1 ) divides ( x 2 + y 2 ) .Also show that g c d ( x + 1 , y + 1 ) = 1 . So,you can find integer k such that k ( x + 1 ) ( y + 1 ) = x 2 + y 2 . Now,use Vieta root jumping to show this equation has no solution.