Let S be the set of integers that can be written in the form 5 0 m + 3 n where m and n are non-negative integers. For example, 3 , 5 0 , 5 3 are all in S . Find the sum of all positive integers not in S .
(Adapted from a past year Singapore Mathematical Olympiad question)
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.
How do you know all these? It's mindboggling. All I did was mod-bashing like Michael :P
Log in to reply
@Krishna Ar I had solved a similar problem, so I knew (I dunno why we have that superfluous 'k') this.........BTW at least up-vote the solution.
Mod bashing is also pretty easy in this case because one of the nos is 3. 50 gives 2 as remainder n 100 gives 1 when divided by 3 So pretty much a best case scene. Else it would be pretty tough like fr ex, 7n + 60m +
I guess the additional condition needed for application of this formula is that m and n should be co primes. Is it right?
use ms excel progam
I don't understand why 97 is the largest number not in S.. How about 99? This number can't be expressed by that form (50m+3n).
Log in to reply
m and n are non-negative. Hence (0,33) satisfies your condition.
It is given that the set of integers s ( m , n ) = 5 0 m + 3 n . And find the sum of all integers not in set s. This means there is a finite number of integers not in set s . Let us first consider s ( m , n ) for m = 0 , 1 , 2 for n = 0 , 1 , 2 , . . . .
s ( 0 , n ) = 0 , 3 , 6 , . . . 4 8 , 5 1 , 5 4 , . . . 9 6 , 9 9 , 1 0 2 , . . . .
s ( 1 , n ) = 5 0 , 5 3 , 5 6 , . . . 9 8 , 1 0 1 , 1 0 4 , . . . .
s ( 2 , n ) = 1 0 0 , 1 0 3 , 1 0 6 , . . . .
Adding the three series together, we have
s ( m , n ) = 0 , 3 , 6 , . . . 4 8 , 5 0 , 5 1 , 5 3 , 5 4 , . . . 9 6 , 9 8 , 9 9 , 1 0 0 , 1 0 1 , 1 0 2 , 1 0 3 , 1 0 4 , 1 0 5 , 1 0 6 , . . . . , where m = 0 , 1 , 2 .
Since for m = 0 , 1 , 2 , from the term = 9 8 onward, it continues to infinity, this means that the series is true for m = 0 , 1 , 2 , . . . as well. Therefore
s ( m , n ) = 0 , 3 , 6 , . . . 4 8 , 5 0 , 5 1 , 5 3 , 5 4 , . . . 9 6 , 9 8 , 9 9 , 1 0 0 , 1 0 1 , . . . . , where m = 0 , 1 , 2 , . . . and n = 0 , 1 , 2 , . . . .
And the series of integers not in s is 1 , 2 , 4 , 5 , . . . 4 9 , 5 2 , 5 5 , . . . 9 1 , 9 4 , 9 7 and its sum N is given by:
N = 1 + 2 + 4 + 5 + . . . + 4 9 + 5 2 + 5 5 + . . . + 9 1 + 9 4 + 9 7
= ( 1 + 4 + 7 + . . . + 4 9 + 5 2 + 5 5 + . . . + 9 1 + 9 4 + 9 7 ) + ( 2 + 5 + 8 + . . . 4 1 + 4 4 + 4 7 )
= ∑ i = 0 3 2 ( 3 i + 1 ) + ∑ j = 1 1 6 ( 3 j − 1 )
= 2 3 3 ( 1 + 9 7 ) + 2 1 6 ( 2 + 4 7 ) = 2 0 0 9
All multiples of three are in s .
For n ≡ 2 ( m o d 3 ) , we require to add one 5 0 . Thus, the n ≡ 2 ( m o d 3 ) which are in s are 5 0 , 5 3 , 5 6 , … . This means that 2 , 5 , 8 , … , 4 7 are not in s .
For n ≡ 1 ( m o d 3 ) , we require to add two 5 0 s. So, 1 0 0 , 1 0 3 , 1 0 6 , … are in s while 1 , 4 , 7 , … , 9 7 are not.
Adding those up, we get 2 0 0 9 .
I have done exactly the same thing
Problem Loading...
Note Loading...
Set Loading...
[I will use the term 'numbers' for non-negative integers]
The Frobenius number of 'n' numbers a 1 , a 2 , a 3 , . . . . . a n is the largest number which cannot bee expressed as a 1 . n 1 + a 2 . n 2 + a 3 . n 3 + . . . . . . . . a n . n n . For any two numbers 'm' and 'n', their Frobenius number is given by m n − m − n .
It is easy to see then, that the largest number not in the set S is 9 7 (which is the Frobenius number of 50 and 3). Also the numbers which are multiples of 50 or 3 or both are in the set. Thus, we get ""only"" 49 such numbers, which can be easily added to yield 2009 as the answer.