Should It wait till next year?

Find the sum of all numbers in the range 0 < x < 2016 0<x<2016 such that x 2015 201 5 x x^{2015}-2015^x leaves a remainder of 15 15 on division by 20 20


The answer is 203010.

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.

2 solutions

Rahul Saha
Oct 5, 2014

Obviously,we need to look at the expression mod 20 20 .Since 20 = 5 4 20=5\cdot 4 , we look at the expression modulo 4 4 and 5 5 and see that x x must be divisible by both 2 2 and 5 5 ,and hence by 10 10 .This implies that x = 10 y x=10y for some positive integer y y .Next,we substitute it in the original expression,take mod 20 20 and prove that all numbers divisible by 10 10 and smaller then 2016 2016 satisfy the given property.Since the numbers divisible by 10 10 form an arithmetic progression,it is easy to find the sum.

Excellent. Simple, straightforward and perfect.

Krishna Ar - 6 years, 8 months ago
Adarsh Kumar
Oct 4, 2014

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 2015 201 5 x 15 ( m o d 20 ) . x^{2015}-2015^{x}\equiv15(mod20). 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: 201 5 x 15 ( m o d 20 ) . 2015^{x}\equiv15(mod20). Thus, x 2015 30 10 ( m o d 20 ) . x^{2015}\equiv30\equiv10(mod20). 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: 201 5 x 5 ( m o d 20 ) . 2015^{x}\equiv5(mod20). Thus, x 2015 20 0 ( m o d 20 ) x^{2015}\equiv20\equiv0(mod20) This can happen when a ) x 0 ( m o d 20 ) o r b ) x 10 ( m o d 20 ) . a)x\equiv0(mod20)\ or\ b)x\equiv10(mod20). For a) we have numbers from 20 1 20 100 20*1-----20*100 and for b) we have numbers from 20 0 + 10 20 100 + 10. 20*0+10-----20*100+10. 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

Krishna Ar - 6 years, 8 months ago

Many Thanx!

Adarsh Kumar - 6 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...