Number Theory #7

Let S S be the set of integers that can be written in the form 50 m + 3 n 50m+3n where m m and n n are non-negative integers. For example, 3 3 , 50 50 , 53 53 are all in S S . Find the sum of all positive integers not in S S .

(Adapted from a past year Singapore Mathematical Olympiad question)


The answer is 2009.

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.

3 solutions

Satvik Golechha
Jun 26, 2014

[I will use the term 'numbers' for non-negative integers]

The Frobenius number of 'n' numbers a 1 , a 2 , a 3 , . . . . . a n 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 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 mn-m-n .

It is easy to see then, that the largest number not in the set S S is 97 97 (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.

How do you know all these? It's mindboggling. All I did was mod-bashing like Michael :P

Krishna Ar - 6 years, 11 months ago

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.

Satvik Golechha - 6 years, 11 months ago

Log in to reply

:)...Let me do so! :P

Krishna Ar - 6 years, 11 months ago

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 +

Sajal Kumar - 6 years, 11 months ago

I guess the additional condition needed for application of this formula is that m and n should be co primes. Is it right?

Sajal Kumar - 6 years, 11 months ago

Log in to reply

Yes. It's true.

Satvik Golechha - 6 years, 11 months ago

use ms excel progam

math man - 6 years, 11 months ago

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).

Hafizh Ahsan Permana - 6 years, 3 months ago

Log in to reply

m and n are non-negative. Hence (0,33) satisfies your condition.

Devin Ky - 5 years, 11 months ago
Chew-Seong Cheong
Jun 26, 2014

It is given that the set of integers s ( m , n ) = 50 m + 3 n s(m,n) = 50m+3n . And find the sum of all integers not in set s. This means there is a finite number of integers not in set s s . Let us first consider s ( m , n ) s(m,n) for m = 0 , 1 , 2 m=0,1,2 for n = 0 , 1 , 2 , . . . . n=0,1,2,....

s ( 0 , n ) = 0 , 3 , 6 , . . . 48 , 51 , 54 , . . . 96 , 99 , 102 , . . . . s(0,n)=0,3,6,...48,51,54,...96,99,102,....

s ( 1 , n ) = 50 , 53 , 56 , . . . 98 , 101 , 104 , . . . . s(1,n)=50,53,56,...98,101,104,....

s ( 2 , n ) = 100 , 103 , 106 , . . . . s(2,n)=100,103,106,....

Adding the three series together, we have

s ( m , n ) = 0 , 3 , 6 , . . . 48 , 50 , 51 , 53 , 54 , . . . 96 , 98 , 99 , 100 , 101 , 102 , 103 , 104 , 105 , 106 , . . . . s(m,n)=0,3,6,...48,50,51,53,54,...96,98,99,100,101,102,103,104,105,106,.... , where m = 0 , 1 , 2 m=0,1,2 .

Since for m = 0 , 1 , 2 m=0,1,2 , from the term = 98 = 98 onward, it continues to infinity, this means that the series is true for m = 0 , 1 , 2 , . . . m=0,1,2,... as well. Therefore

s ( m , n ) = 0 , 3 , 6 , . . . 48 , 50 , 51 , 53 , 54 , . . . 96 , 98 , 99 , 100 , 101 , . . . . s(m,n)=0,3,6,...48,50,51,53,54,...96,98,99,100,101,.... , where m = 0 , 1 , 2 , . . . m=0,1,2,... and n = 0 , 1 , 2 , . . . . n=0,1,2,....

And the series of integers not in s s is 1 , 2 , 4 , 5 , . . . 49 , 52 , 55 , . . . 91 , 94 , 97 1,2,4,5,...49,52,55,...91,94,97 and its sum N N is given by:

N = 1 + 2 + 4 + 5 + . . . + 49 + 52 + 55 + . . . + 91 + 94 + 97 N=1+2+4+5+...+49+52+55+...+91+94+97

= ( 1 + 4 + 7 + . . . + 49 + 52 + 55 + . . . + 91 + 94 + 97 ) + ( 2 + 5 + 8 + . . . 41 + 44 + 47 ) =(1+4+7+...+49+52+55+...+91+94+97)+(2+5+8+...41+44+47)

= i = 0 32 ( 3 i + 1 ) + j = 1 16 ( 3 j 1 ) =\sum _{ i=0 }^{ 32 }{ (3i+1)+\sum _{ j=1 }^{ 16 }{ (3j-1) } }

= 33 2 ( 1 + 97 ) + 16 2 ( 2 + 47 ) = 2009 =\frac { 33 }{ 2 } (1+97)+\frac { 16 }{ 2 } (2+47)=\boxed{2009}

Michael Tong
Jun 25, 2014

All multiples of three are in s s .

For n 2 ( m o d 3 ) n \equiv 2 \pmod 3 , we require to add one 50 50 . Thus, the n 2 ( m o d 3 ) n \equiv 2 \pmod 3 which are in s s are 50 , 53 , 56 , 50, 53, 56, \dots . This means that 2 , 5 , 8 , , 47 2, 5, 8, \dots, 47 are not in s s .

For n 1 ( m o d 3 ) n \equiv 1 \pmod 3 , we require to add two 50 50 s. So, 100 , 103 , 106 , 100, 103, 106, \dots are in s s while 1 , 4 , 7 , , 97 1, 4, 7, \dots, 97 are not.

Adding those up, we get 2009 2009 .

I have done exactly the same thing

Ronak Agarwal - 6 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...