A number theory problem by Lee Wall

Let S S be the set of integers that leave a remainder of 1 1 when divided by 2 2 , a remainder of 2 2 when divided by 3 3 , and a remainder of 3 3 when divided by 4 4 . How many integers in the interval [ 0 , 1 0 4 ] [0, 10^{4}] belong to S S ?


The answer is 833.

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

Kartik Prabhu
Jun 15, 2014

Using the given information, we can see that any number following the given conditions can be written as:

2 x 1 2x - 1

3 y 1 3y - 1

4 z 1 4z - 1

Now, bearing in mind that these are all different ways of representing the same number, we can also see that

2 x = 3 y = 4 z 2x = 3y = 4z

(Imagine forming an equation, and then adding a one to both sides).

At this point, we can see that in order for a number to satisfy the conditions of the question, it must be exactly 1 1 less than the lowest common multiple of 2 , 3 , 4 = 12 2, 3, 4 = 12 .

So we just need to find out how many multiples of 12 there are in the first 10,000 numbers. With a little trial and error using a calculator, that number comes out to be 833 \boxed{833}

or use Chinese Remainder Theorem.

mathh mathh - 6 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...