Let denote a subset of such that no two elements of add up to . Find the maximum number of elements that can have .
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.
There are total 56 elements in set P.
P[1] + P[56] = 552
P[2] +P[55] = 552
'' " " " " " " " " " " " "
P[28] + P[29] = 552 ;
If I delete first 28's elements from set P then the another 28's elements are our required answer.
So, answer = 28 .