Let S be the sum of all possible positive integers N , for which there exists an arithmetic progression of positive integers starting with 1 and common difference N , which contains the term 2015.
Determine the value of S (mod 1000) .
[Based off an old problem, but nothing like it.]
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 N satisfies the condition then N needs to be a factor of 2015-1=2014
2 0 1 4 = 2 × 1 9 × 5 3
So values of N that satisfy the condition are
There sum is 3240
3 2 4 0 = 3 × 1 0 0 0 + 2 4 0
So the answer is 2 4 0
The sum of the divisors of 2 0 1 4 is the function f ( 2 0 1 4 ) = f ( 2 ⋅ 1 9 ⋅ 5 3 ) = f ( 2 ) f ( 1 9 ) f ( 5 3 )
= 3 ⋅ 2 0 ⋅ 5 4 = 3 2 4 0 ≡ 2 4 0 ( m o d 1 0 0 0 )
Log in to reply
Good method! I used to sum up the divisors one by one.
If a number N satisfies the condition in the problem, N must divide 2015-1=2014. The sum of all the divisors of 2014 is 3240. 3240 mod 1000 is 240.
Problem Loading...
Note Loading...
Set Loading...
We have a 1 = 1 and we want a n = 2 0 1 5 for some value of n.
We see that the difference b/w the first and the last term is 2014 and we know that a n = a 1 + ( n − 1 ) d . So if we have to now represent 2014 as a product of two numbers which shall be our n − 1 and d .
Like 1 and 2014. If you put d=1, you get n-1 = 2014 and vice versa.
Factoring 2014 we get 2 0 1 4 = 2 ∗ 1 9 ∗ 5 3 .
So we have
2 0 1 4 = 1 ∗ 2 0 1 4
2 0 1 4 = 2 ∗ 1 0 0 7
2 0 1 4 = 1 9 ∗ 1 0 6
2 0 1 4 = 5 3 ∗ 3 8
So we now know that d can attain values 1 , 2 , 1 9 , 3 8 , 5 3 , 1 0 6 , 1 0 0 7 , 2 0 1 4
Summing them up we get 3240. Thus our answer is 2 4 0