ICTM Regional 2009 Divsion AA

Algebra Level 3

If k is the number of distinct positive integers that leave a remainder of 12 when divided into 3587, find the value of k.


The answer is 9.

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

Eamon Gupta
Aug 26, 2015

If x x divided into 3587 leaves a remainder of 12, then we can write this as:

3587 12 (mod x) 3587 \equiv 12 \text{ (mod x)}

3575 0 (mod x), or x is a factor of 3575 3575 \equiv 0 \text{(mod x), or x is a factor of}\quad 3575

Note that 3575 = 5 2 × 11 × 13 3575 = 5^2 \times 11 \times 13 and its factors are:

1 , 5 , 11 , 13 , 25 , 55 , 65 , 143 , 275 , 325 , 715 , 3575 1, 5, 11, 13, 25, 55, 65, 143, 275, 325, 715, 3575

However since neither 1 , 5 1, 5 nor 11 11 can leave a remainder of 12 when divided 3587 because they are less than 12, they cannot be counted.

3587 ÷ 1 remainder 0 3587 \div 1 \Rightarrow \text{remainder} \quad 0

3587 ÷ 5 remainder 2 3587 \div 5 \Rightarrow \text{remainder} \quad 2

3587 ÷ 11 remainder 1 3587 \div 11 \Rightarrow \text{remainder} \quad 1

So in total there are 9 \boxed{9} distinct positive integers that leave a remainder of 12 when divided into 3587:

13 , 25 , 55 , 65 , 143 , 275 , 325 , 715 , 3575 13, 25, 55, 65, 143, 275, 325, 715, 3575

Moderator note:

Simple standard approach.

That is really smart. Very smart

Manu Mehta - 5 years, 9 months ago

Log in to reply

Check out the Division Algorithm wiki!

Calvin Lin Staff - 5 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...