( 1 1 2 3 4 5 6 7 8 9 0 + 8 1 2 3 4 5 6 7 8 9 0 − 3 1 2 3 4 5 6 7 8 9 0 − 6 1 2 3 4 5 6 7 8 9 0 ) 1 2 3 4 5 6 7 8 9 0
Find the remainder when the number above is divided by 1 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.
Same solution.
1 n = 1 m o d 1 0
6 n = 6 m o d 1 0
Let
8 n = a m o d 1 0
3 n = b m o d 1 0
Hence, 8 n − 3 n = a -b mod 10
= 5 mod 10
Also, 1 n − 6 n = 1 − 6 m o d 1 0
= -5 mod 10
Finally,
1 n − 6 n + 8 n − 3 n = 5 − 5 m o d 1 0
= 0 mod 10
hence for every n, the remainder is 0
solution is not understandable give me another solution
And therefore, that holds for 1234567890 !!!!!
= \pm 5 mod 10?
Hey... Can you prove this- X^n is congruent to x mod 10? Do you know Chinese theorem?
Log in to reply
X^n = x mod 10, this is not applicable for x, only for numbers ending with 1, 5, 6, 0 and yes, I don't know Chinese theorem..... Can you explain me that and theorems related to that?
P.S. - And now, you can see that I am learning from you...
Log in to reply
-_-. I didnt know this fact. That is why I asked you. Chinese theorem is not number theory. Its actually something to do with geometry I guess. There are many other theorems in number theory. And Let me try this with congurneces. But how did you get this result??????
Log in to reply
@Krishna Ar – just hit and trial.......
By the way, Chinese Remainder theorem -
http://mathworld.wolfram.com/ChineseRemainderTheorem.html
I could not understand this. ;P
Log in to reply
@Kartik Sharma – Dude, If you could not, how could I? By the way, I see that most of your number theory is playing with numbers. Keep it up (Y)
Well, why not just replace that monstrosity with a smaller number like 2, 3... and so forth? A pattern can be devised as the total will always end with 0.
I assumed 1234567890 as x.Then I keep substituting x=1,2,3,4,5.Every time it was giving 0 as reminder.Hence I concluded '0' by principle of mathematical induction because the answer has to be consistent
You are asked for the remainder when divided by 10, which means you are looking for the ones digit of that expression. If that monstracity reduces to 27, then 7 would be the answer; if it reduced to 6,518,309, then 9 would be the answer. Because of this, we're only interested in the ones digit of that obscenely large number. Now 1 to any power is just 1. Powers of 8 follow this pattern for their ones digit: 8; 4; 2; 6; 8;. . . . A sequence with 4 repeating terms. 1234657890 leaves 2 left over when divided by 4, so the ones digit of 8^1234567890 is the 2nd term of that repeating sequence, 4 Powers of 3 follow this pattern for their ones digit: 3; 9; 7; 1; 3;. . . . Also a sequence with 4 repeating terms, like above. So, the ones digit of 3^1234567890 is 9, the second term of the the repeating sequence. Powers of 6 always end in a 6, so the ones digit of 6^1234567890 is 6. Putting this into the expression, you get (1+~4-~9-~6)^1234567890, where you don't really care what the ~ means, because we're only interested in the ones digit. This simplifies to (~0)^1234567890, which will be 0. So, the ones digit of the expression is 0
1 + 8 - 3 - 6 = 0,
power of 0 = 0,
0 / 10 = 0,
So zero is the answer, simple.
If n is a natural number (positive integer) 1^n = 1, 8^n mod 10 = 6 for all n > 2, 3^n mod 10 = 1 for all n > 2, 6^n mod 10 = 6 for all n
So when you have n> 2 and you add (1^n + 8^n - 3^n - 6^n) the last digit will always be 0 and therefore a multiple of 10. The remainder when dividing by 10 will be 0.
hint use 9can be written as -1 similarly use others they will nullify=0
1 + 8 - 3 -6 = 0
So 0 ^ 1234567890 = 0
And 0 / 10 = 0
EASY
Kindly use latex!!! This is not a solution
To use latex, one has to open a new tab(Easy maths Editor) and I am an energy conserver, that would be tiring for me as well as my laptop and my internet(which is slowing down everyday).
Log in to reply
Not really.
Log in to reply
actually, without latex, problems look difficult and that's what I want...;)
Log in to reply
@Kartik Sharma – Oh -_-.....But this problem needs a solution dude, why don't you put one up. I guess it involves modular congruence
Log in to reply
@Jayakumar Krishnan – Okay, I am giving it right now......
Problem Loading...
Note Loading...
Set Loading...
You are asked for the remainder when divided by 10, which means you are looking for the ones digit of that expression. If that monstracity reduces to 27, then 7 would be the answer; if it reduced to 6,518,309, then 9 would be the answer. Because of this, we're only interested in the ones digit of that obscenely large number.
Now 1 to any power is just 1.
Powers of 8 follow this pattern for their ones digit: 8; 4; 2; 6; 8;. . . . A sequence with 4 repeating terms. 1234657890 leaves 2 left over when divided by 4, so the ones digit of 8^1234567890 is the 2nd term of that repeating sequence, 4
Powers of 3 follow this pattern for their ones digit: 3; 9; 7; 1; 3;. . . . Also a sequence with 4 repeating terms, like above. So, the ones digit of 3^1234567890 is 9, the second term of the the repeating sequence.
Powers of 6 always end in a 6, so the ones digit of 6^1234567890 is 6.
Putting this into the expression, you get (1+~4-~9-~6)^1234567890, where you don't really care what the ~ means, because we're only interested in the ones digit. This simplifies to (~0)^1234567890, which will be 0. So, the ones digit of the expression is 0