Find the sum of all numbers in the range 0 < x < 2 0 1 6 such that x 2 0 1 5 − 2 0 1 5 x leaves a remainder of 1 5 on division by 2 0
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.
Excellent. Simple, straightforward and perfect.
From the first look at the problem we can see that the best way to solve this problem is to use modular arithmetic,more specifically (mod20) and that'x' needs to be an integer because if 'x' is not an integer then the remainder will not be an integer.From the question we have that x 2 0 1 5 − 2 0 1 5 x ≡ 1 5 ( m o d 2 0 ) . Checking a few cases we get that any power of 2015 will leave remainder either 15 or 5 when divided by 20.Now,let us do this case by case.Case 1: 2 0 1 5 x ≡ 1 5 ( m o d 2 0 ) . Thus, x 2 0 1 5 ≡ 3 0 ≡ 1 0 ( m o d 2 0 ) . But after a lot of hit and trial we get that there are no integer solutions to it.Does somebody have an easier way to do this part??Case 2: 2 0 1 5 x ≡ 5 ( m o d 2 0 ) . Thus, x 2 0 1 5 ≡ 2 0 ≡ 0 ( m o d 2 0 ) This can happen when a ) x ≡ 0 ( m o d 2 0 ) o r b ) x ≡ 1 0 ( m o d 2 0 ) . For a) we have numbers from 2 0 ∗ 1 − − − − − 2 0 ∗ 1 0 0 and for b) we have numbers from 2 0 ∗ 0 + 1 0 − − − − − 2 0 ∗ 1 0 0 + 1 0 . Now we can easily calculate the sums as all the numbers in both cases form A.Ps.
Cool beans! I solved it by program bash! :P
Many Thanx!
Problem Loading...
Note Loading...
Set Loading...
Obviously,we need to look at the expression mod 2 0 .Since 2 0 = 5 ⋅ 4 , we look at the expression modulo 4 and 5 and see that x must be divisible by both 2 and 5 ,and hence by 1 0 .This implies that x = 1 0 y for some positive integer y .Next,we substitute it in the original expression,take mod 2 0 and prove that all numbers divisible by 1 0 and smaller then 2 0 1 6 satisfy the given property.Since the numbers divisible by 1 0 form an arithmetic progression,it is easy to find the sum.