Just the Right Number to Find!

Find the smallest positive integer which when divided by 15 leaves remainder​ 5, when divided by 25 leaves remainder 15, when divided by 35 leaves remainder 25.


The answer is 515.

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

Notice that the difference between the number and respective remainder is equal.

15 5 = 10 , 25 15 = 10 , 35 25 = 10. 15 - 5 = 10, \, 25 - 15 = 10, \, 35 - 25 = 10.

First, the LCM \text{LCM} of 15 15 , 25 25 and 35 35 will be calculated which is 525 525 .

Then We subtract from it the common difference, that is 10 10 .

Hence 525 10 = 515 525 - 10 = 515

Therefore the final answer is 515 \Large \displaystyle \color{#3D99F6}{\boxed{515}} .

Margaret Yu
Jun 1, 2016

Let X be the number

X must be 5 mod 15, 15 mod 25, and 25 mod 35

Then X can b expressed as: 15a+5, 25b+15, 35c+25

X = 15a+5=25b+15 = 35c+25

15a+5 = 35c+25 ...(1)

15a= 35c+20

3a= 7c+4

a= 7 c + 4 3 \frac{7c+4}{3}

7c+4 must be 0mod3

7c+4= 0mod3

c+1=0mod3

25b+15 = 35c+25 ...(2)

5b= 7c+2

b= 7 c + 2 5 \frac{7c+2}{5}

7c+2 must be 0mod5

7c+2= 0mod5

2c+2= 0mod5

c+1= 0mod 5

Since c+1=0mod3and c+1= 0mod 5, then c+1 must be 0mod 15.

The smallest possible c is 14.

Substituting c=14, X= 515 \boxed{515}

Madelyn Yu
Jun 1, 2016

Let x be the number that satisfies the given condtitions.

Since the LCM of 15, 25, 35 is 525, the least possible positive integer x is 525 - 10 = 515 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...