If k is the number of distinct positive integers that leave a remainder of 12 when divided into 3587, find the value of k.
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.
If x divided into 3587 leaves a remainder of 12, then we can write this as:
3 5 8 7 ≡ 1 2 (mod x)
3 5 7 5 ≡ 0 (mod x), or x is a factor of 3 5 7 5
Note that 3 5 7 5 = 5 2 × 1 1 × 1 3 and its factors are:
1 , 5 , 1 1 , 1 3 , 2 5 , 5 5 , 6 5 , 1 4 3 , 2 7 5 , 3 2 5 , 7 1 5 , 3 5 7 5
However since neither 1 , 5 nor 1 1 can leave a remainder of 12 when divided 3587 because they are less than 12, they cannot be counted.
3 5 8 7 ÷ 1 ⇒ remainder 0
3 5 8 7 ÷ 5 ⇒ remainder 2
3 5 8 7 ÷ 1 1 ⇒ remainder 1
So in total there are 9 distinct positive integers that leave a remainder of 12 when divided into 3587:
1 3 , 2 5 , 5 5 , 6 5 , 1 4 3 , 2 7 5 , 3 2 5 , 7 1 5 , 3 5 7 5