SOLUTION: How many positive integers n produce a remainder of 9 when 2009 is divided by n and n > 9 ?

Algebra.Com
Question 266539: How many positive integers n produce a remainder of 9 when 2009 is divided by n and n > 9 ?
Answer by drk(1908)   (Show Source): You can put this solution on YOUR website!
Well we can't use the numbers 1 - 9. All remainders will be less than 9.
take 2009 - 9 and we get 2000. We are looking for all factors of 2000 greater than 9.
using prime factorization , we get 2^4 x 5^3. Using Euler's idea, there are 5x4 = 20 factors, but we don't want: 1, 2, 4, 5, or 8, so we end with 15 answers.
---
n = 10, 16, 20, 25, 40, 50, 80, 100, 125, 200, 250, 400, 500, 1000, 2000

RELATED QUESTIONS

The number n is a two digit number. When n is divided by 10 the remainder is 9, when n is (answered by ankor@dixie-net.com)
Suppose 2001 is divided by an integer n. For which integers n is the remainder... (answered by robertb)
Suppose 2011 is divided by an integer n. For which integers n is the remainder... (answered by richard1234)
For a certain positive integer $n$, the number $n^{6873}$ leaves a remainder of $3$ when... (answered by ikleyn,math_tutor2020)
if 1st 44 positive integers form a no. N as N=12345678.........424344 and N is divided by (answered by MathLover1,9876)
What is the smallest positive integer n so that 13n leaves a remainder of 1 when divided... (answered by Theo)
When 270 is divided by the odd number n, the quotient is a positive prime number and the (answered by solver91311)
when a positive integer n is divided by 5, the remainder is 4. which of the following... (answered by Fombitz)
When a positive integer n is divided by 6, the remainder is 2. What is the remainder when (answered by richard1234)