Finding last two digits of $14^{ 14^{large 14}}!$ without mod method
$begingroup$
For $ 14^{large 14^{Large 14}}!$ using mod method I know the solution to find the last two digits. Even on this site I have found the solution but with mod method. But without using mod method can we solve this?
elementary-number-theory alternative-proof
$endgroup$
add a comment |
$begingroup$
For $ 14^{large 14^{Large 14}}!$ using mod method I know the solution to find the last two digits. Even on this site I have found the solution but with mod method. But without using mod method can we solve this?
elementary-number-theory alternative-proof
$endgroup$
$begingroup$
Prior question on this.
$endgroup$
– Bill Dubuque
Feb 9 at 1:31
$begingroup$
Why don't you want to use the $mod$ method? I can't think of any way to do this without the $mod$ method but with the $mod$ method is so easy why not use it?
$endgroup$
– fleablood
Feb 9 at 1:41
add a comment |
$begingroup$
For $ 14^{large 14^{Large 14}}!$ using mod method I know the solution to find the last two digits. Even on this site I have found the solution but with mod method. But without using mod method can we solve this?
elementary-number-theory alternative-proof
$endgroup$
For $ 14^{large 14^{Large 14}}!$ using mod method I know the solution to find the last two digits. Even on this site I have found the solution but with mod method. But without using mod method can we solve this?
elementary-number-theory alternative-proof
elementary-number-theory alternative-proof
edited Feb 17 at 2:24
Bill Dubuque
213k29196654
213k29196654
asked Jan 30 at 4:27


mavericmaveric
89412
89412
$begingroup$
Prior question on this.
$endgroup$
– Bill Dubuque
Feb 9 at 1:31
$begingroup$
Why don't you want to use the $mod$ method? I can't think of any way to do this without the $mod$ method but with the $mod$ method is so easy why not use it?
$endgroup$
– fleablood
Feb 9 at 1:41
add a comment |
$begingroup$
Prior question on this.
$endgroup$
– Bill Dubuque
Feb 9 at 1:31
$begingroup$
Why don't you want to use the $mod$ method? I can't think of any way to do this without the $mod$ method but with the $mod$ method is so easy why not use it?
$endgroup$
– fleablood
Feb 9 at 1:41
$begingroup$
Prior question on this.
$endgroup$
– Bill Dubuque
Feb 9 at 1:31
$begingroup$
Prior question on this.
$endgroup$
– Bill Dubuque
Feb 9 at 1:31
$begingroup$
Why don't you want to use the $mod$ method? I can't think of any way to do this without the $mod$ method but with the $mod$ method is so easy why not use it?
$endgroup$
– fleablood
Feb 9 at 1:41
$begingroup$
Why don't you want to use the $mod$ method? I can't think of any way to do this without the $mod$ method but with the $mod$ method is so easy why not use it?
$endgroup$
– fleablood
Feb 9 at 1:41
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Hint:
The number is clearly divisible by $4$
So, let us find the reminder when divided by $25$
$a=14^{14^{14}}=(1-15)^{14^{14}}=1-binom{14^{14}}115+$ terms divisible by $25$
Now as $5$ divides $15,$ let us the reminder of $14^{14}$ when divided by $5$
$14^{14}=(1-15)^{14}=1+$ terms divisible by $5$
Let $14^{14}=1+5u$ for some integer $u$
$15cdot14^{14}=15(1+5u)=15+25(3u)$
So, $a=1-15-25(3u)=11+25(-3u-1)$
and $a$ is divisible by $4$
Hence $a=25+11$ when divided by $100$
$endgroup$
1
$begingroup$
I would claim "finding remainders" is exactly the same thing as the "mod method" which is strictly forbidden.
$endgroup$
– fleablood
Feb 9 at 1:45
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%2f3093101%2ffinding-last-two-digits-of-14-14-large-14-without-mod-method%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$
Hint:
The number is clearly divisible by $4$
So, let us find the reminder when divided by $25$
$a=14^{14^{14}}=(1-15)^{14^{14}}=1-binom{14^{14}}115+$ terms divisible by $25$
Now as $5$ divides $15,$ let us the reminder of $14^{14}$ when divided by $5$
$14^{14}=(1-15)^{14}=1+$ terms divisible by $5$
Let $14^{14}=1+5u$ for some integer $u$
$15cdot14^{14}=15(1+5u)=15+25(3u)$
So, $a=1-15-25(3u)=11+25(-3u-1)$
and $a$ is divisible by $4$
Hence $a=25+11$ when divided by $100$
$endgroup$
1
$begingroup$
I would claim "finding remainders" is exactly the same thing as the "mod method" which is strictly forbidden.
$endgroup$
– fleablood
Feb 9 at 1:45
add a comment |
$begingroup$
Hint:
The number is clearly divisible by $4$
So, let us find the reminder when divided by $25$
$a=14^{14^{14}}=(1-15)^{14^{14}}=1-binom{14^{14}}115+$ terms divisible by $25$
Now as $5$ divides $15,$ let us the reminder of $14^{14}$ when divided by $5$
$14^{14}=(1-15)^{14}=1+$ terms divisible by $5$
Let $14^{14}=1+5u$ for some integer $u$
$15cdot14^{14}=15(1+5u)=15+25(3u)$
So, $a=1-15-25(3u)=11+25(-3u-1)$
and $a$ is divisible by $4$
Hence $a=25+11$ when divided by $100$
$endgroup$
1
$begingroup$
I would claim "finding remainders" is exactly the same thing as the "mod method" which is strictly forbidden.
$endgroup$
– fleablood
Feb 9 at 1:45
add a comment |
$begingroup$
Hint:
The number is clearly divisible by $4$
So, let us find the reminder when divided by $25$
$a=14^{14^{14}}=(1-15)^{14^{14}}=1-binom{14^{14}}115+$ terms divisible by $25$
Now as $5$ divides $15,$ let us the reminder of $14^{14}$ when divided by $5$
$14^{14}=(1-15)^{14}=1+$ terms divisible by $5$
Let $14^{14}=1+5u$ for some integer $u$
$15cdot14^{14}=15(1+5u)=15+25(3u)$
So, $a=1-15-25(3u)=11+25(-3u-1)$
and $a$ is divisible by $4$
Hence $a=25+11$ when divided by $100$
$endgroup$
Hint:
The number is clearly divisible by $4$
So, let us find the reminder when divided by $25$
$a=14^{14^{14}}=(1-15)^{14^{14}}=1-binom{14^{14}}115+$ terms divisible by $25$
Now as $5$ divides $15,$ let us the reminder of $14^{14}$ when divided by $5$
$14^{14}=(1-15)^{14}=1+$ terms divisible by $5$
Let $14^{14}=1+5u$ for some integer $u$
$15cdot14^{14}=15(1+5u)=15+25(3u)$
So, $a=1-15-25(3u)=11+25(-3u-1)$
and $a$ is divisible by $4$
Hence $a=25+11$ when divided by $100$
answered Jan 30 at 5:06
lab bhattacharjeelab bhattacharjee
228k15158279
228k15158279
1
$begingroup$
I would claim "finding remainders" is exactly the same thing as the "mod method" which is strictly forbidden.
$endgroup$
– fleablood
Feb 9 at 1:45
add a comment |
1
$begingroup$
I would claim "finding remainders" is exactly the same thing as the "mod method" which is strictly forbidden.
$endgroup$
– fleablood
Feb 9 at 1:45
1
1
$begingroup$
I would claim "finding remainders" is exactly the same thing as the "mod method" which is strictly forbidden.
$endgroup$
– fleablood
Feb 9 at 1:45
$begingroup$
I would claim "finding remainders" is exactly the same thing as the "mod method" which is strictly forbidden.
$endgroup$
– fleablood
Feb 9 at 1:45
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.
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%2f3093101%2ffinding-last-two-digits-of-14-14-large-14-without-mod-method%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
$begingroup$
Prior question on this.
$endgroup$
– Bill Dubuque
Feb 9 at 1:31
$begingroup$
Why don't you want to use the $mod$ method? I can't think of any way to do this without the $mod$ method but with the $mod$ method is so easy why not use it?
$endgroup$
– fleablood
Feb 9 at 1:41