Probably combinatorics and algebra

P = { 1 , 11 , 21 , 31 , 41 , . . . . . . . . , 521 , 531 , 541 , 551 } P=\left\{ 1,11,21,31,41,........,521,531,541,551 \right\} Let A A denote a subset of P P such that no two elements of A A add up to 552 552 . Find the maximum number of elements that A A can have .


The answer is 28.

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

Shohag Hossen
Jul 6, 2015

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 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...