Find remainder when 1^2013+2^2013+3^2013............2012^2013 is divided by 2013.
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.
i to approached in the same way.
I did a little different way but yes, must say keep it up, Mayank!
Log in to reply
Hi! In What way did you approach this @Kartik Sharma
Log in to reply
As I said it's only a little different way and it states just why a^n + b^n/a+b gives remainder 0.
1^2013 = 1 mod 2013
2012^2013 = (-1)^2013 mod 2013
2^2013 = 2^2013 mod 2013
2011^2013 = (-2)^2013 mod 2013
and so on
Then, add everything and we will see that everything gets cut.
1^2013 + 2^2013....... 2013^2013 = 1 + 2^2013.... -2^2013 -1^2013 mod 2013
Therefore, we get 1^2013 + 2^2013....... 2013^2013 = 0 mod 2013
So, it is also the reason why this property goes true.
Log in to reply
@Kartik Sharma – Ah! The long method. But, yes that's because I forgot that property that time. But I don't know I reached to its proof just by chance.
Thanks Kartik for my praise. But, really i wanna know the method by which you solved the question.
Udsing fermat theorem each time we get 1 adding 2013 tms we get 0
We can solve this by m o d function.
( 1 2 0 1 3 + 2 2 0 1 3 + 3 2 0 1 3 + . . . . . . + 2 0 1 2 2 0 1 3 ) m o d 2 0 1 3 = 0
Thus, the answer is 0
Nice Solution -_-.
m o d is \pmod{.....}
Problem Loading...
Note Loading...
Set Loading...
a^n+b^n is divisible by a+b IF n IS ODD. This way, we can pair out the numbers: (1^2013+2012^2013)+(2^2013+2011^2013)+.........................(100^2013+1913^2013)..and so on. We can figure out by pairing that the REMAINDER IS 0.