If today is Saturday, what day is 1 0 2 0 days from now?
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.
Although you're right, you could have cut short your working by a lot. Hint: 2 3 = 7 + 1 or 3 3 = 7 × 4 + 1 . Or you can just apply Fermat's little theorem.
Bonus question: Can you prove that it can never be a Friday after 1 0 n days for all positive integers n .
Yeah. As simple as that. I did it Orally :P XD
Good Solution Btw. :)
Log in to reply
I too did it orally but a solution needs to be explained, right ?
It will be a Friday after 1000 days and for every n=3, 9, 15, 21, etc. It can be any day except Saturday.
1 0 2 0 = 1 0 1 8 × 1 0 2 = ( 1 0 3 ) 6 × 1 0 2 = 1 0 0 0 6 × 1 0 0 . Now an interesting point is that 1001 is divisible by 7 so 1000 = -1 (mod 7).
So we have 1 0 0 0 6 × 1 0 0 = ( − 1 ) 6 × 1 0 0 ( m o d 7 ) = 1 × 1 0 0 ( m o d 7 ) = 2 ( m o d 7 )
It's not conventional to remember that 7 ∣ 1 0 0 1 but well done!
10/7 has remainder 3.
100/7 has remainder 2.
1,000/7 has remainder 6.
10,000/7 has remainder 4.
100,000/7 has remainder 5.
1,000,000/7 has remainder 1.
10,000,000/7 has remainder 3 again.
Then the remainders repeat.
The repeating pattern of remainders has 6 elements.
10^18 divided by 7 has remainder 1.
10^19 divided by 7 has remainder 3.
10^20 divided by 7 has remainder 2.
So, the day is 2 days after a Saturday - Monday.
You have only shown that the pattern works for small n in 1 0 n . Your solution does not have mathematical rigor to show that it works for ALL powers of 1 0 . Hint: solve via divisibility rules of 7.
Challenge master: For divisibility rule of 7, we find the alternating sum of blocks of three digits from right to left.
1 0 2 0 = ≡ ≡ 1 0 0 , 0 0 0 , 0 0 0 , 0 0 0 , 0 0 0 , 0 0 0 , 0 0 0 1 0 0 − 0 0 0 + 0 0 0 − 0 0 0 + 0 0 0 − 0 0 0 + 0 0 0 1 0 0 ≡ 2
I believe that Aaron Warren's solution does have the necessary mathematical rigor, because, if 1 0 k leaves one of those 6 remainders in the division by 7 , then 1 0 k + 1 will ALWAYS leave the next one he mentioned.
Just as an example, let's say that 1 0 k ≡ 2 ( m o d 7 )
Then 1 0 k + 1 ≡ 2 × 1 0 = 2 0 = 1 4 + 6 ≡ 0 + 6 = 6 ( m o d 7 )
And I could show the same thing for the other 5 remainders, but it's unnecessary.
Great work sir ... wow!!!
1 0 2 0 ≡ 3 2 0 ≡ 3 2 ≡ 2 ( m o d 7 ) , so, many weeks and two days will pass, and it will be M o n d a y (if the universe still exists). We have used 3 6 ≡ 1 ( m o d 7 ) , by Fermat.
Fermat's little theorem is simply the icing on the cake. Great!
You're talking about the heat death of the universe eh? Sounds incredibly depressing. I came here to solve math problems, not to question my own mortality.
Log in to reply
At my advanced age, I don't worry about what's going to happen in 1 0 2 0 days ;)
Besides, as Einstein observed, time is only an illusion, although a stubborn one.
how can we use fermat's little theorem in it ?
Log in to reply
Since I know that 3 6 ≡ 1 ( m o d 7 ) , by Fermat, I can conclude that 3 2 0 = ( 3 6 ) 3 × 3 2 ≡ 1 3 × 3 2 ≡ 3 2 ( m o d 7 )
Saturday to Friday is 7 days. Three days after that is Monday. That makes 10 days. No matter what power you raise ten to, Monday will still be three days after Friday.
Wrong. You could not jump to the conclusion to your last line based on irrelevant information. A simple counterexample to your solution is 1 0 2 days which is equals to 1 4 weeks and 2 days.
oh really? three days after Saturday is Tuesday... (Sunday (1) -> Monday(2) -> Tuesday(3)) You were lucky to get it right, I suggest you look at the solutions.
10^20 = (7 + 3)^(3 X 6 + 2) = 3^2 (mod 7) = 2 (mod 7)
So the answer is Monday
if the remainder of "a number of days" divided by 7 is 0, then "a number of days" after saturday is also saturday
by using fermat's little theorem, 10^{6} mod 7 = 1 mod 7
so, 10^{20} mod 7 = 10^{(6 x 3) + 2} mod 7 = (10^{6 x 3} x 10^{2}) mod 7 = 10^{2} mod 7 = 2
we get 2 days after saturday which is monday
10^20 mod 7 days. With euler function, we know that 10^20 mod 7 = 2 mod 7... So, the day is Saturday + 2 days = Monday
Problem Loading...
Note Loading...
Set Loading...
If today is Saturday , 7 days from now would also be a Saturday , and 7 days from then would also be a Saturday .
So, to find what day it would be 1 0 2 0 days later, we need to find the remainder obtained on dividing 1 0 2 0 by 7 .
If we get remainder as 0 , then the day is Saturday . If we get the remainder as 1 , we add one day to Saturday , i.e, we get Sunday . If we get the remainder as 2 , we add two days to Saturday , i.e, we get Monday . If we get the remainder as 3 , we add three days to Saturday , i.e, we get Tuesday and so on.
Now,
1 0 ≡ 3 ( m o d 7 ) ⇒ 1 0 2 0 ≡ 3 2 0 ( m o d 7 ) 3 2 0 = 9 1 0 9 ≡ 2 ( m o d 7 ) ⇒ 9 1 0 ≡ 2 1 0 ( m o d 7 ) 2 1 0 = 2 3 × 2 3 × 2 3 × 2 1 2 3 ≡ 1 ( m o d 7 )
Thus, 2 1 0 mod 7 = 1 × 1 × 1 × 2
Hence, the remainder is 2 and the day is Monday