I need a calendar. No, it won't work (Part 2)

If today is Saturday, what day is 1 0 20 10^{20} days from now?

Friday Saturday Monday Sunday Wednesday Tuesday Thursday

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.

8 solutions

Vaibhav Prasad
May 3, 2015

If today is Saturday \text{Saturday} , 7 7 days from now would also be a Saturday \text{Saturday} , and 7 7 days from then would also be a Saturday \text{Saturday} .

So, to find what day it would be 10 20 {10}^{20} days later, we need to find the remainder obtained on dividing 10 20 {10}^{20} by 7 7 .

If we get remainder as 0 0 , then the day is Saturday \text{Saturday} . If we get the remainder as 1 1 , we add one day to Saturday \text{Saturday} , i.e, we get Sunday \text{Sunday} . If we get the remainder as 2 2 , we add two days to Saturday \text{Saturday} , i.e, we get Monday \text{Monday} . If we get the remainder as 3 3 , we add three days to Saturday \text{Saturday} , i.e, we get Tuesday \text{Tuesday} and so on.

Now,

10 3 ( m o d 7 ) 10 20 3 20 ( m o d 7 ) 3 20 = 9 10 9 2 ( m o d 7 ) 9 10 2 10 ( m o d 7 ) 2 10 = 2 3 × 2 3 × 2 3 × 2 1 2 3 1 ( m o d 7 ) 10\equiv 3(mod\quad 7)\\ \Rightarrow { 10 }^{ 20 }\equiv { 3 }^{ 20 }(mod7)\\ \\ { 3 }^{ 20 }={ 9 }^{ 10 }\\ \\ 9\equiv 2(mod7)\\ \Rightarrow { 9 }^{ 10 }\equiv { 2 }^{ 10 }(mod7)\\ \\ { 2 }^{ 10 }={ 2 }^{ 3 }\times { 2 }^{ 3 }\times { 2 }^{ 3 }\times { 2 }^{ 1 }\\ \\ { 2 }^{ 3 }\equiv 1(mod7)

Thus, 2 10 mod 7 = 1 × 1 × 1 × 2 {2}^{10} \text{ mod } 7 = 1 \times 1 \times 1 \times 2

Hence, the remainder is 2 2 and the day is Monday \huge {\text {Monday}}

Moderator note:

Although you're right, you could have cut short your working by a lot. Hint: 2 3 = 7 + 1 2^3 = 7 + 1 or 3 3 = 7 × 4 + 1 3^3 = 7 \times 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 10^n days for all positive integers n n .

Yeah. As simple as that. I did it Orally :P XD

Good Solution Btw. :)

Mehul Arora - 6 years, 1 month ago

Log in to reply

I too did it orally but a solution needs to be explained, right ?

Vaibhav Prasad - 6 years, 1 month ago

Log in to reply

Yeah. Right :D

Mehul Arora - 6 years, 1 month ago

It will be a Friday after 1000 days and for every n=3, 9, 15, 21, etc. It can be any day except Saturday.

Alex Young - 6 years, 1 month ago
Noel Lo
May 4, 2015

1 0 20 = 1 0 18 × 1 0 2 = ( 1 0 3 ) 6 × 1 0 2 = 100 0 6 × 100 10^{20} = 10^{18} \times 10^2 = (10^3)^6 \times 10^2 = 1000^6 \times 100 . Now an interesting point is that 1001 is divisible by 7 so 1000 = -1 (mod 7).

So we have 100 0 6 × 100 = ( 1 ) 6 × 100 ( m o d 7 ) = 1 × 100 ( m o d 7 ) = 2 ( m o d 7 ) 1000^6 \times 100 = (-1)^6 \times 100 (mod 7) = 1 \times 100 (mod 7) = 2 (mod 7)

Moderator note:

It's not conventional to remember that 7 1001 7 | 1001 but well done!

Aaron Warren
May 4, 2015

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.

Moderator note:

You have only shown that the pattern works for small n n in 1 0 n 10^n . Your solution does not have mathematical rigor to show that it works for ALL powers of 10 10 . 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 20 = 100 , 000 , 000 , 000 , 000 , 000 , 000 100 000 + 000 000 + 000 000 + 000 100 2 \begin{aligned} 10^{20} &=& 100,000,000,000,000,000,000 \\ &\equiv & 100 - \cancel{000} + \bcancel{000} - \cancel{000} + \bcancel{000} - \cancel{000} + \bcancel{000} \\ &\equiv & 100 \equiv \boxed{2} \end{aligned}

Pi Han Goh - 6 years, 1 month ago

I believe that Aaron Warren's solution does have the necessary mathematical rigor, because, if 1 0 k 10^k leaves one of those 6 6 remainders in the division by 7 7 , then 1 0 k + 1 10^{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 ) 10^k \equiv 2 \pmod{7}

Then 1 0 k + 1 2 × 10 = 20 = 14 + 6 0 + 6 = 6 ( m o d 7 ) 10^{k+1} \equiv 2 \times 10 = 20 = 14+6 \equiv 0+6 = 6 \pmod{7}

And I could show the same thing for the other 5 5 remainders, but it's unnecessary.

Rick B - 6 years, 1 month ago

Great work sir ... wow!!!

Arun Basnet - 6 years, 1 month ago
Otto Bretscher
May 3, 2015

1 0 20 3 20 3 2 2 ( m o d 7 ) , 10^{20}\equiv3^{20}\equiv3^2\equiv2 \pmod7, so, many weeks and two days will pass, and it will be M o n d a y \boxed{Monday} (if the universe still exists). We have used 3 6 1 ( m o d 7 ) 3^6\equiv1 \pmod7 , by Fermat.

Moderator note:

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.

Pi Han Goh - 6 years, 1 month ago

Log in to reply

At my advanced age, I don't worry about what's going to happen in 1 0 20 10^{20} days ;)

Besides, as Einstein observed, time is only an illusion, although a stubborn one.

Otto Bretscher - 6 years, 1 month ago

how can we use fermat's little theorem in it ?

Khalid Sadek - 6 years, 1 month ago

Log in to reply

Since I know that 3 6 1 ( m o d 7 ) 3^6\equiv1\pmod7 , by Fermat, I can conclude that 3 20 = ( 3 6 ) 3 × 3 2 1 3 × 3 2 3 2 ( m o d 7 ) 3^{20}=(3^6)^3\times3^2\equiv1^3\times3^2\equiv3^2\pmod7

Otto Bretscher - 6 years, 1 month ago

Log in to reply

got it .. thank U

Khalid Sadek - 6 years, 1 month ago
Keith Daggett
May 7, 2015

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.

Moderator note:

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 10^2 days which is equals to 14 14 weeks and 2 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.

Jordan Tzvetkov - 6 years, 1 month ago
Gamal Sultan
May 6, 2015

10^20 = (7 + 3)^(3 X 6 + 2) = 3^2 (mod 7) = 2 (mod 7)

So the answer is Monday

Moh Rahmanda
May 5, 2015

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

Rafi Pepe
May 4, 2015

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

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...