Compute the last 12 digits of 2 0 1 9 2 0 1 9 = 2 0 2 0 ↑ ↑ 2 0 1 9 .
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.
can you explain things? it is confusing.
Log in to reply
There is not much to the question anyways (matter of computation). why bothering knowing the answer?
Actually there's a much simpler solution that let's you do with just pencil and paper in theory, thanks to the multiplicative orders:
2 0 1 9 2 0 1 9 ≡ 2 0 1 9 9 m o d 1 0 2 ≡ 7 9 m o d 1 0 2
So the last 2 digits are 79. We can proceed computing the next digits in the same way:
2 0 1 9 2 0 1 9 2 0 1 9 ≡ 2 0 1 9 7 9 m o d 1 0 3 ≡ 1 7 9 m o d 1 0 3
So the last 3 digits are 179. And so on, one can easily compute all the 12 digits without even using a calculator, with enough patience.
By the way to compute the last digits of a big power you can just compute 2 0 1 9 2 , 2 0 1 9 4 , 2 0 1 9 8 , 2 0 1 9 1 6 , 2 0 1 9 3 2 , . . . , since every number can be expressed in binary, so for example if I need to compute
2 0 1 9 7 9
I just need to multiply
2 0 1 9 1 × 2 0 1 9 2 × 2 0 1 9 4 × 2 0 1 9 8 × 2 0 1 9 6 4 m o d 1 0 3 .
The question is interesting exactly because of the fact that it is actually doable without a calculator, in probably less than half an hour.
By the way I haven't put only the last 5 digits or so because otherwise one could cheat with wolframalpha very easily, by inserting
2019^2019^2019^2019^2019^2019^2019^2019^2019^2019
It would immediately tell the last 10 digits... With 12 digits anyone can still easily get the result, by putting 2 0 1 9 9 , then 2 0 1 9 7 9 , then 2 0 1 9 1 7 9 and so on, but at least this requires a little more work with the brain, using the multiplicative orders. Actually, one could still get immediately the answer with this command on wolframalpha:
2019^2019^2019^2019^2019^2019^2019^2019^2019^2019^2019^2019 mod 10^12
But this still requires the knowledge of fixed digits in tetrations.
Problem Loading...
Note Loading...
Set Loading...
Nest [ ( 2 0 1 9 $#$1 m o d 1 0 0 0 0 0 0 0 0 0 0 0 0 ) & , 2 0 1 9 , 2 0 1 8 ] ⇒ 2 2 6 8 7 1 0 0 1 1 7 9
PowerMod
Nest
This computes the entire tetration from the top down, keeping the last twelve digits only at each stage.
PowerMod is a function more commonly used in cryptographic efforts.
The method of using binary powers computed by repeated squaring is another cryptographic technique.