RPS #002 - Looks Familiar?

Let A = { x x = 2 k + 5 m , k , m N 0 } A = \{x | x = 2k + 5m , k,m \in N_0\} . Find the sum of all positive integers which is not the elements of A A .

(Note that N 0 = { 0 , 1 , 2 , 3 , . . . } N_0 = \{0,1,2,3,...\}


The answer is 4.

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

It's just basic use of Chicken McNugget Theorem . So the largest number that can not be achieved is p q p q pq-p-q , here p = 5 , q = 2 p=5 ,q=2

It comes out to be 10 5 2 = 3 10 - 5 - 2 = 3 the only other number that cannot be achieved using 2 k + 5 m 2k+5m is 1 .

Therefore the sum is 4 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...