Power tower last digits
$begingroup$
Can anyone solve the following problem of finding the 6th last digit from the right of the decimal representation of the following number:
$6^{6^{6^{6^{6^{6}}}}}$
Essentially it means reducing this modulo $10^6$ and supposedly Chinese Remainder Theorem should be used, but I have no idea how to solve this. Can anyone help?
modular-arithmetic problem-solving
$endgroup$
add a comment |
$begingroup$
Can anyone solve the following problem of finding the 6th last digit from the right of the decimal representation of the following number:
$6^{6^{6^{6^{6^{6}}}}}$
Essentially it means reducing this modulo $10^6$ and supposedly Chinese Remainder Theorem should be used, but I have no idea how to solve this. Can anyone help?
modular-arithmetic problem-solving
$endgroup$
add a comment |
$begingroup$
Can anyone solve the following problem of finding the 6th last digit from the right of the decimal representation of the following number:
$6^{6^{6^{6^{6^{6}}}}}$
Essentially it means reducing this modulo $10^6$ and supposedly Chinese Remainder Theorem should be used, but I have no idea how to solve this. Can anyone help?
modular-arithmetic problem-solving
$endgroup$
Can anyone solve the following problem of finding the 6th last digit from the right of the decimal representation of the following number:
$6^{6^{6^{6^{6^{6}}}}}$
Essentially it means reducing this modulo $10^6$ and supposedly Chinese Remainder Theorem should be used, but I have no idea how to solve this. Can anyone help?
modular-arithmetic problem-solving
modular-arithmetic problem-solving
asked Jan 13 at 19:45
Michael MuntaMichael Munta
1048
1048
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
We're interested in $6^x mod 10^6$; this is determined by $6^i mod 2^6$ and $6^i mod 5^6$. Mod $2^6$ it's easy: $6^x$ is divisible by $2^6$ if $x ge 6$. $6$ is coprime to $5^6$ with multiplicative order $3125 = 5^5$ mod $5^6$. In fact, the multiplicative order of $6$ mod $5^m$ seems to be $5^{m-1}$ (prove!). So
$$eqalign{6 &equiv 1 mod 5cr 6^6 &equiv 6^1 = 6 mod 5^2cr 6^{6^6} &equiv 6^6 equiv 31 mod 5^3cr
6^{6^{6^6}} &equiv 6^{31} equiv 531 mod 5^4cr
6^{6^{6^{6^6}}} &equiv 6^{531}equiv 1156 mod 5^5cr
6^{6^{6^{6^{6^6}}}} &equiv 6^{1156} equiv 4281 mod 5^6cr
}$$
and using Chinese Remainder, $$6^{6^{6^{6^{6^6}}}} equiv 238656 mod 10^6$$
$endgroup$
$begingroup$
How did you do this mod $5^n$ without calculator? For example $6^{1156}$
$endgroup$
– Michael Munta
Jan 13 at 21:14
1
$begingroup$
I did it with a computer. It would be possible, though rather tedious, to do by hand using repeated squaring.
$endgroup$
– Robert Israel
Jan 14 at 1:11
$begingroup$
And this process of finding multiplicative order, does that have a name? What did you do there really?
$endgroup$
– Michael Munta
Jan 14 at 6:35
$begingroup$
Also I am interested in how did you reach the conclusion that $6^x$ is $0$ in mod $2^6$.
$endgroup$
– Michael Munta
Jan 14 at 10:44
$begingroup$
$6^x = 2^x cdot 3^x$ is divisible by $2^x$.
$endgroup$
– Robert Israel
Jan 14 at 12:47
|
show 2 more comments
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3072436%2fpower-tower-last-digits%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
We're interested in $6^x mod 10^6$; this is determined by $6^i mod 2^6$ and $6^i mod 5^6$. Mod $2^6$ it's easy: $6^x$ is divisible by $2^6$ if $x ge 6$. $6$ is coprime to $5^6$ with multiplicative order $3125 = 5^5$ mod $5^6$. In fact, the multiplicative order of $6$ mod $5^m$ seems to be $5^{m-1}$ (prove!). So
$$eqalign{6 &equiv 1 mod 5cr 6^6 &equiv 6^1 = 6 mod 5^2cr 6^{6^6} &equiv 6^6 equiv 31 mod 5^3cr
6^{6^{6^6}} &equiv 6^{31} equiv 531 mod 5^4cr
6^{6^{6^{6^6}}} &equiv 6^{531}equiv 1156 mod 5^5cr
6^{6^{6^{6^{6^6}}}} &equiv 6^{1156} equiv 4281 mod 5^6cr
}$$
and using Chinese Remainder, $$6^{6^{6^{6^{6^6}}}} equiv 238656 mod 10^6$$
$endgroup$
$begingroup$
How did you do this mod $5^n$ without calculator? For example $6^{1156}$
$endgroup$
– Michael Munta
Jan 13 at 21:14
1
$begingroup$
I did it with a computer. It would be possible, though rather tedious, to do by hand using repeated squaring.
$endgroup$
– Robert Israel
Jan 14 at 1:11
$begingroup$
And this process of finding multiplicative order, does that have a name? What did you do there really?
$endgroup$
– Michael Munta
Jan 14 at 6:35
$begingroup$
Also I am interested in how did you reach the conclusion that $6^x$ is $0$ in mod $2^6$.
$endgroup$
– Michael Munta
Jan 14 at 10:44
$begingroup$
$6^x = 2^x cdot 3^x$ is divisible by $2^x$.
$endgroup$
– Robert Israel
Jan 14 at 12:47
|
show 2 more comments
$begingroup$
We're interested in $6^x mod 10^6$; this is determined by $6^i mod 2^6$ and $6^i mod 5^6$. Mod $2^6$ it's easy: $6^x$ is divisible by $2^6$ if $x ge 6$. $6$ is coprime to $5^6$ with multiplicative order $3125 = 5^5$ mod $5^6$. In fact, the multiplicative order of $6$ mod $5^m$ seems to be $5^{m-1}$ (prove!). So
$$eqalign{6 &equiv 1 mod 5cr 6^6 &equiv 6^1 = 6 mod 5^2cr 6^{6^6} &equiv 6^6 equiv 31 mod 5^3cr
6^{6^{6^6}} &equiv 6^{31} equiv 531 mod 5^4cr
6^{6^{6^{6^6}}} &equiv 6^{531}equiv 1156 mod 5^5cr
6^{6^{6^{6^{6^6}}}} &equiv 6^{1156} equiv 4281 mod 5^6cr
}$$
and using Chinese Remainder, $$6^{6^{6^{6^{6^6}}}} equiv 238656 mod 10^6$$
$endgroup$
$begingroup$
How did you do this mod $5^n$ without calculator? For example $6^{1156}$
$endgroup$
– Michael Munta
Jan 13 at 21:14
1
$begingroup$
I did it with a computer. It would be possible, though rather tedious, to do by hand using repeated squaring.
$endgroup$
– Robert Israel
Jan 14 at 1:11
$begingroup$
And this process of finding multiplicative order, does that have a name? What did you do there really?
$endgroup$
– Michael Munta
Jan 14 at 6:35
$begingroup$
Also I am interested in how did you reach the conclusion that $6^x$ is $0$ in mod $2^6$.
$endgroup$
– Michael Munta
Jan 14 at 10:44
$begingroup$
$6^x = 2^x cdot 3^x$ is divisible by $2^x$.
$endgroup$
– Robert Israel
Jan 14 at 12:47
|
show 2 more comments
$begingroup$
We're interested in $6^x mod 10^6$; this is determined by $6^i mod 2^6$ and $6^i mod 5^6$. Mod $2^6$ it's easy: $6^x$ is divisible by $2^6$ if $x ge 6$. $6$ is coprime to $5^6$ with multiplicative order $3125 = 5^5$ mod $5^6$. In fact, the multiplicative order of $6$ mod $5^m$ seems to be $5^{m-1}$ (prove!). So
$$eqalign{6 &equiv 1 mod 5cr 6^6 &equiv 6^1 = 6 mod 5^2cr 6^{6^6} &equiv 6^6 equiv 31 mod 5^3cr
6^{6^{6^6}} &equiv 6^{31} equiv 531 mod 5^4cr
6^{6^{6^{6^6}}} &equiv 6^{531}equiv 1156 mod 5^5cr
6^{6^{6^{6^{6^6}}}} &equiv 6^{1156} equiv 4281 mod 5^6cr
}$$
and using Chinese Remainder, $$6^{6^{6^{6^{6^6}}}} equiv 238656 mod 10^6$$
$endgroup$
We're interested in $6^x mod 10^6$; this is determined by $6^i mod 2^6$ and $6^i mod 5^6$. Mod $2^6$ it's easy: $6^x$ is divisible by $2^6$ if $x ge 6$. $6$ is coprime to $5^6$ with multiplicative order $3125 = 5^5$ mod $5^6$. In fact, the multiplicative order of $6$ mod $5^m$ seems to be $5^{m-1}$ (prove!). So
$$eqalign{6 &equiv 1 mod 5cr 6^6 &equiv 6^1 = 6 mod 5^2cr 6^{6^6} &equiv 6^6 equiv 31 mod 5^3cr
6^{6^{6^6}} &equiv 6^{31} equiv 531 mod 5^4cr
6^{6^{6^{6^6}}} &equiv 6^{531}equiv 1156 mod 5^5cr
6^{6^{6^{6^{6^6}}}} &equiv 6^{1156} equiv 4281 mod 5^6cr
}$$
and using Chinese Remainder, $$6^{6^{6^{6^{6^6}}}} equiv 238656 mod 10^6$$
answered Jan 13 at 21:01
Robert IsraelRobert Israel
323k23212466
323k23212466
$begingroup$
How did you do this mod $5^n$ without calculator? For example $6^{1156}$
$endgroup$
– Michael Munta
Jan 13 at 21:14
1
$begingroup$
I did it with a computer. It would be possible, though rather tedious, to do by hand using repeated squaring.
$endgroup$
– Robert Israel
Jan 14 at 1:11
$begingroup$
And this process of finding multiplicative order, does that have a name? What did you do there really?
$endgroup$
– Michael Munta
Jan 14 at 6:35
$begingroup$
Also I am interested in how did you reach the conclusion that $6^x$ is $0$ in mod $2^6$.
$endgroup$
– Michael Munta
Jan 14 at 10:44
$begingroup$
$6^x = 2^x cdot 3^x$ is divisible by $2^x$.
$endgroup$
– Robert Israel
Jan 14 at 12:47
|
show 2 more comments
$begingroup$
How did you do this mod $5^n$ without calculator? For example $6^{1156}$
$endgroup$
– Michael Munta
Jan 13 at 21:14
1
$begingroup$
I did it with a computer. It would be possible, though rather tedious, to do by hand using repeated squaring.
$endgroup$
– Robert Israel
Jan 14 at 1:11
$begingroup$
And this process of finding multiplicative order, does that have a name? What did you do there really?
$endgroup$
– Michael Munta
Jan 14 at 6:35
$begingroup$
Also I am interested in how did you reach the conclusion that $6^x$ is $0$ in mod $2^6$.
$endgroup$
– Michael Munta
Jan 14 at 10:44
$begingroup$
$6^x = 2^x cdot 3^x$ is divisible by $2^x$.
$endgroup$
– Robert Israel
Jan 14 at 12:47
$begingroup$
How did you do this mod $5^n$ without calculator? For example $6^{1156}$
$endgroup$
– Michael Munta
Jan 13 at 21:14
$begingroup$
How did you do this mod $5^n$ without calculator? For example $6^{1156}$
$endgroup$
– Michael Munta
Jan 13 at 21:14
1
1
$begingroup$
I did it with a computer. It would be possible, though rather tedious, to do by hand using repeated squaring.
$endgroup$
– Robert Israel
Jan 14 at 1:11
$begingroup$
I did it with a computer. It would be possible, though rather tedious, to do by hand using repeated squaring.
$endgroup$
– Robert Israel
Jan 14 at 1:11
$begingroup$
And this process of finding multiplicative order, does that have a name? What did you do there really?
$endgroup$
– Michael Munta
Jan 14 at 6:35
$begingroup$
And this process of finding multiplicative order, does that have a name? What did you do there really?
$endgroup$
– Michael Munta
Jan 14 at 6:35
$begingroup$
Also I am interested in how did you reach the conclusion that $6^x$ is $0$ in mod $2^6$.
$endgroup$
– Michael Munta
Jan 14 at 10:44
$begingroup$
Also I am interested in how did you reach the conclusion that $6^x$ is $0$ in mod $2^6$.
$endgroup$
– Michael Munta
Jan 14 at 10:44
$begingroup$
$6^x = 2^x cdot 3^x$ is divisible by $2^x$.
$endgroup$
– Robert Israel
Jan 14 at 12:47
$begingroup$
$6^x = 2^x cdot 3^x$ is divisible by $2^x$.
$endgroup$
– Robert Israel
Jan 14 at 12:47
|
show 2 more comments
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3072436%2fpower-tower-last-digits%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown