Congruence involving CRT
I was working on a problem, I arrived at the point at which I have to find $17^{{{17}^{17}}^{17}} pmod {25}$
My attempt: $$ 17^{{{17}^{17}}^{17}}equiv 17^{{{{17}^{17}}^{17}} pmod{phi(25)}} pmod {25} $$$$17^{{{17}^{17}}}equiv 17^{{{{17}^{17}}} pmod{phi(20)}} pmod{20}$$$$17^{17}equiv1^{17}equiv1pmod{phi(20)=8} $$ Thus:$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{-8}equiv(17^{-1})^{8}pmod{25}$$
The inverse of $17$ modulo $25$ its $3$ since $17cdot3=51$, so:$$17^{{{17}^{17}}^{17}}equiv3^{8} equiv3^3cdot3^3cdot3^2equiv2cdot2cdot9equiv36equiv11pmod{25}$$
I checked but the solutions says that it is actually congruent to $2$ and not $11$, everything before the inverse it's fine for sure since OP follows the same procedure, what did I do wrong?
elementary-number-theory modular-arithmetic chinese-remainder-theorem
add a comment |
I was working on a problem, I arrived at the point at which I have to find $17^{{{17}^{17}}^{17}} pmod {25}$
My attempt: $$ 17^{{{17}^{17}}^{17}}equiv 17^{{{{17}^{17}}^{17}} pmod{phi(25)}} pmod {25} $$$$17^{{{17}^{17}}}equiv 17^{{{{17}^{17}}} pmod{phi(20)}} pmod{20}$$$$17^{17}equiv1^{17}equiv1pmod{phi(20)=8} $$ Thus:$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{-8}equiv(17^{-1})^{8}pmod{25}$$
The inverse of $17$ modulo $25$ its $3$ since $17cdot3=51$, so:$$17^{{{17}^{17}}^{17}}equiv3^{8} equiv3^3cdot3^3cdot3^2equiv2cdot2cdot9equiv36equiv11pmod{25}$$
I checked but the solutions says that it is actually congruent to $2$ and not $11$, everything before the inverse it's fine for sure since OP follows the same procedure, what did I do wrong?
elementary-number-theory modular-arithmetic chinese-remainder-theorem
add a comment |
I was working on a problem, I arrived at the point at which I have to find $17^{{{17}^{17}}^{17}} pmod {25}$
My attempt: $$ 17^{{{17}^{17}}^{17}}equiv 17^{{{{17}^{17}}^{17}} pmod{phi(25)}} pmod {25} $$$$17^{{{17}^{17}}}equiv 17^{{{{17}^{17}}} pmod{phi(20)}} pmod{20}$$$$17^{17}equiv1^{17}equiv1pmod{phi(20)=8} $$ Thus:$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{-8}equiv(17^{-1})^{8}pmod{25}$$
The inverse of $17$ modulo $25$ its $3$ since $17cdot3=51$, so:$$17^{{{17}^{17}}^{17}}equiv3^{8} equiv3^3cdot3^3cdot3^2equiv2cdot2cdot9equiv36equiv11pmod{25}$$
I checked but the solutions says that it is actually congruent to $2$ and not $11$, everything before the inverse it's fine for sure since OP follows the same procedure, what did I do wrong?
elementary-number-theory modular-arithmetic chinese-remainder-theorem
I was working on a problem, I arrived at the point at which I have to find $17^{{{17}^{17}}^{17}} pmod {25}$
My attempt: $$ 17^{{{17}^{17}}^{17}}equiv 17^{{{{17}^{17}}^{17}} pmod{phi(25)}} pmod {25} $$$$17^{{{17}^{17}}}equiv 17^{{{{17}^{17}}} pmod{phi(20)}} pmod{20}$$$$17^{17}equiv1^{17}equiv1pmod{phi(20)=8} $$ Thus:$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{-8}equiv(17^{-1})^{8}pmod{25}$$
The inverse of $17$ modulo $25$ its $3$ since $17cdot3=51$, so:$$17^{{{17}^{17}}^{17}}equiv3^{8} equiv3^3cdot3^3cdot3^2equiv2cdot2cdot9equiv36equiv11pmod{25}$$
I checked but the solutions says that it is actually congruent to $2$ and not $11$, everything before the inverse it's fine for sure since OP follows the same procedure, what did I do wrong?
elementary-number-theory modular-arithmetic chinese-remainder-theorem
elementary-number-theory modular-arithmetic chinese-remainder-theorem
asked Dec 9 at 11:53
Spasoje Durovic
19410
19410
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
There is a mistake.
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-8}}equiv(17^{-1})^{color{red}{8}}pmod{25}$$
should be
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-3}}equiv(17^{-1})^{color{Red}{3}}pmod{25}$$
1
Wait, I know this might be a dumb question but... $17^{17} neq 17^{17 pmod {25}} pmod{25}$ that's the error right?
– Spasoje Durovic
Dec 9 at 12:25
How silly of me!... I had used the same logic more than once, then I completely messed it up at the end, Thanks!
– Spasoje Durovic
Dec 9 at 12:30
Haha happens sometimes :) I don't see how CRT applies here though, you've just used lil fermat
– rsadhvika
Dec 9 at 12:32
Yeah, CRT applied in a different part of the problem since i was evaluating that ugly $17^{17^{17^{17}}}$ thing in $pmod{100}$ so I broke it down into two congruences, one modulo $4$ and the other modulo $25$
– Spasoje Durovic
Dec 9 at 14:26
add a comment |
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%2f3032318%2fcongruence-involving-crt%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
There is a mistake.
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-8}}equiv(17^{-1})^{color{red}{8}}pmod{25}$$
should be
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-3}}equiv(17^{-1})^{color{Red}{3}}pmod{25}$$
1
Wait, I know this might be a dumb question but... $17^{17} neq 17^{17 pmod {25}} pmod{25}$ that's the error right?
– Spasoje Durovic
Dec 9 at 12:25
How silly of me!... I had used the same logic more than once, then I completely messed it up at the end, Thanks!
– Spasoje Durovic
Dec 9 at 12:30
Haha happens sometimes :) I don't see how CRT applies here though, you've just used lil fermat
– rsadhvika
Dec 9 at 12:32
Yeah, CRT applied in a different part of the problem since i was evaluating that ugly $17^{17^{17^{17}}}$ thing in $pmod{100}$ so I broke it down into two congruences, one modulo $4$ and the other modulo $25$
– Spasoje Durovic
Dec 9 at 14:26
add a comment |
There is a mistake.
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-8}}equiv(17^{-1})^{color{red}{8}}pmod{25}$$
should be
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-3}}equiv(17^{-1})^{color{Red}{3}}pmod{25}$$
1
Wait, I know this might be a dumb question but... $17^{17} neq 17^{17 pmod {25}} pmod{25}$ that's the error right?
– Spasoje Durovic
Dec 9 at 12:25
How silly of me!... I had used the same logic more than once, then I completely messed it up at the end, Thanks!
– Spasoje Durovic
Dec 9 at 12:30
Haha happens sometimes :) I don't see how CRT applies here though, you've just used lil fermat
– rsadhvika
Dec 9 at 12:32
Yeah, CRT applied in a different part of the problem since i was evaluating that ugly $17^{17^{17^{17}}}$ thing in $pmod{100}$ so I broke it down into two congruences, one modulo $4$ and the other modulo $25$
– Spasoje Durovic
Dec 9 at 14:26
add a comment |
There is a mistake.
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-8}}equiv(17^{-1})^{color{red}{8}}pmod{25}$$
should be
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-3}}equiv(17^{-1})^{color{Red}{3}}pmod{25}$$
There is a mistake.
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-8}}equiv(17^{-1})^{color{red}{8}}pmod{25}$$
should be
$$17^{{{17}^{17}}^{17}}equiv 17^{17}equiv17^{color{red}{-3}}equiv(17^{-1})^{color{Red}{3}}pmod{25}$$
answered Dec 9 at 12:11
rsadhvika
1,6631228
1,6631228
1
Wait, I know this might be a dumb question but... $17^{17} neq 17^{17 pmod {25}} pmod{25}$ that's the error right?
– Spasoje Durovic
Dec 9 at 12:25
How silly of me!... I had used the same logic more than once, then I completely messed it up at the end, Thanks!
– Spasoje Durovic
Dec 9 at 12:30
Haha happens sometimes :) I don't see how CRT applies here though, you've just used lil fermat
– rsadhvika
Dec 9 at 12:32
Yeah, CRT applied in a different part of the problem since i was evaluating that ugly $17^{17^{17^{17}}}$ thing in $pmod{100}$ so I broke it down into two congruences, one modulo $4$ and the other modulo $25$
– Spasoje Durovic
Dec 9 at 14:26
add a comment |
1
Wait, I know this might be a dumb question but... $17^{17} neq 17^{17 pmod {25}} pmod{25}$ that's the error right?
– Spasoje Durovic
Dec 9 at 12:25
How silly of me!... I had used the same logic more than once, then I completely messed it up at the end, Thanks!
– Spasoje Durovic
Dec 9 at 12:30
Haha happens sometimes :) I don't see how CRT applies here though, you've just used lil fermat
– rsadhvika
Dec 9 at 12:32
Yeah, CRT applied in a different part of the problem since i was evaluating that ugly $17^{17^{17^{17}}}$ thing in $pmod{100}$ so I broke it down into two congruences, one modulo $4$ and the other modulo $25$
– Spasoje Durovic
Dec 9 at 14:26
1
1
Wait, I know this might be a dumb question but... $17^{17} neq 17^{17 pmod {25}} pmod{25}$ that's the error right?
– Spasoje Durovic
Dec 9 at 12:25
Wait, I know this might be a dumb question but... $17^{17} neq 17^{17 pmod {25}} pmod{25}$ that's the error right?
– Spasoje Durovic
Dec 9 at 12:25
How silly of me!... I had used the same logic more than once, then I completely messed it up at the end, Thanks!
– Spasoje Durovic
Dec 9 at 12:30
How silly of me!... I had used the same logic more than once, then I completely messed it up at the end, Thanks!
– Spasoje Durovic
Dec 9 at 12:30
Haha happens sometimes :) I don't see how CRT applies here though, you've just used lil fermat
– rsadhvika
Dec 9 at 12:32
Haha happens sometimes :) I don't see how CRT applies here though, you've just used lil fermat
– rsadhvika
Dec 9 at 12:32
Yeah, CRT applied in a different part of the problem since i was evaluating that ugly $17^{17^{17^{17}}}$ thing in $pmod{100}$ so I broke it down into two congruences, one modulo $4$ and the other modulo $25$
– Spasoje Durovic
Dec 9 at 14:26
Yeah, CRT applied in a different part of the problem since i was evaluating that ugly $17^{17^{17^{17}}}$ thing in $pmod{100}$ so I broke it down into two congruences, one modulo $4$ and the other modulo $25$
– Spasoje Durovic
Dec 9 at 14:26
add a comment |
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3032318%2fcongruence-involving-crt%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