Every positive power of $5$ appears in the last digits of bigger power of $5$
Clash Royale CLAN TAG#URR8PPP
Problem. Show that for every positive integer $n$, there is an integer $N > n$ such that the number $5^n$ appears as the last few digits $5^N$. For example, if $n = 3$, we have $5^3 = 125$ and $5^5 = 3125$, so $N = 5$ would satisfy.
This is a problem from the worksheet of the class Putnam Seminar at CMU. Please give hints towards the right direction and not the full solutions. Thanks!!
number-theory contest-math
asked Dec 22 '18 at 4:56
BrianH
637
add a comment |
Problem. Show that for every positive integer $n$, there is an integer $N > n$ such that the number $5^n$ appears as the last few digits $5^N$. For example, if $n = 3$, we have $5^3 = 125$ and $5^5 = 3125$, so $N = 5$ would satisfy.
This is a problem from the worksheet of the class Putnam Seminar at CMU. Please give hints towards the right direction and not the full solutions. Thanks!!
number-theory contest-math
asked Dec 22 '18 at 4:56
BrianH
637
Why is thecontest-mathtag used? Please edit the question to add that context.
– Shaun
Dec 24 '18 at 20:48
@Shaun Well what I'm I suppose to add? It was a problem on the worksheet from my Putnam class. It feel like saying that is just distracting
– BrianH
Dec 24 '18 at 20:51
1
Well, the fact that it's from your Putnam class. Don't worry about potential distractions. Context is strongly encouraged by many users here and, typically, it can be very helpful for some users for any number of reasons.
– Shaun
Dec 24 '18 at 20:56
add a comment |
Problem. Show that for every positive integer $n$, there is an integer $N > n$ such that the number $5^n$ appears as the last few digits $5^N$. For example, if $n = 3$, we have $5^3 = 125$ and $5^5 = 3125$, so $N = 5$ would satisfy.
This is a problem from the worksheet of the class Putnam Seminar at CMU. Please give hints towards the right direction and not the full solutions. Thanks!!
number-theory contest-math
asked Dec 22 '18 at 4:56
BrianH
637
Problem. Show that for every positive integer $n$, there is an integer $N > n$ such that the number $5^n$ appears as the last few digits $5^N$. For example, if $n = 3$, we have $5^3 = 125$ and $5^5 = 3125$, so $N = 5$ would satisfy.
This is a problem from the worksheet of the class Putnam Seminar at CMU. Please give hints towards the right direction and not the full solutions. Thanks!!
number-theory contest-math
number-theory contest-math
asked Dec 22 '18 at 4:56
BrianH
637
asked Dec 22 '18 at 4:56
BrianH
637
edited Dec 24 '18 at 20:57
asked Dec 22 '18 at 4:56
BrianH
637
asked Dec 22 '18 at 4:56
BrianH
637
asked Dec 22 '18 at 4:56
BrianH
637
637
Why is thecontest-mathtag used? Please edit the question to add that context.
– Shaun
Dec 24 '18 at 20:48
@Shaun Well what I'm I suppose to add? It was a problem on the worksheet from my Putnam class. It feel like saying that is just distracting
– BrianH
Dec 24 '18 at 20:51
1
Well, the fact that it's from your Putnam class. Don't worry about potential distractions. Context is strongly encouraged by many users here and, typically, it can be very helpful for some users for any number of reasons.
– Shaun
Dec 24 '18 at 20:56
add a comment |
Why is thecontest-mathtag used? Please edit the question to add that context.
– Shaun
Dec 24 '18 at 20:48
@Shaun Well what I'm I suppose to add? It was a problem on the worksheet from my Putnam class. It feel like saying that is just distracting
– BrianH
Dec 24 '18 at 20:51
1
Well, the fact that it's from your Putnam class. Don't worry about potential distractions. Context is strongly encouraged by many users here and, typically, it can be very helpful for some users for any number of reasons.
– Shaun
Dec 24 '18 at 20:56
Why is the
contest-math tag used? Please edit the question to add that context.– Shaun
Dec 24 '18 at 20:48
Why is the
contest-math tag used? Please edit the question to add that context.– Shaun
Dec 24 '18 at 20:48
@Shaun Well what I'm I suppose to add? It was a problem on the worksheet from my Putnam class. It feel like saying that is just distracting
– BrianH
Dec 24 '18 at 20:51
@Shaun Well what I'm I suppose to add? It was a problem on the worksheet from my Putnam class. It feel like saying that is just distracting
– BrianH
Dec 24 '18 at 20:51
1
1
Well, the fact that it's from your Putnam class. Don't worry about potential distractions. Context is strongly encouraged by many users here and, typically, it can be very helpful for some users for any number of reasons.
– Shaun
Dec 24 '18 at 20:56
Well, the fact that it's from your Putnam class. Don't worry about potential distractions. Context is strongly encouraged by many users here and, typically, it can be very helpful for some users for any number of reasons.
– Shaun
Dec 24 '18 at 20:56
add a comment |
2 Answers
2
active
oldest
votes
Fix $n$.
The cases $n le 3$ can be handled directly.
We now assume $n > 3$.
Let $m = lceil n log_10 5 rceil$ be the smallest integer such that $10^m > 5^n$. For $n > 3$, we have $m < n$.
You want to find $N$ such that $5^N = k 10^m + 5^n$ for some integer $k$. Dividing both sides by $5^n$ yields $$5^N-n - 1 = k 2^m/ 5^n-m.$$
Thus if you show you can find a large integer $q$ such that $5^q - 1$ is divisible by $2^m$ then you can choose $N$ and $k$ appropriately to conclude the proof.
Base case: For $m=2$ we have $5^1 - 1$ divisible by $2^m$. Inductive step: if $5^q-1$ is divisible by $2^m$, then $5^2q-1 = (5^q-1)(5^q+1)$ is divisible by $2^m+1$.
answered Dec 22 '18 at 5:21
angryavian
39k23180
add a comment |
We will prove that there exists a $N$ such that $5^n$ and $5^N$ have the same last $n$ digits
So what we need to do is to find $5^Nequiv 5^npmod10^n$
This can be achieved by setting $N=n+phi (2^n)$
Since $5^Nequiv 5^npmod5^n$ and $5^Nequiv 5^npmod2^n$
answered Dec 22 '18 at 5:26
bangzheng
211
Could you explain to me how you reached the last two lines?
– BrianH
Dec 22 '18 at 5:39
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%2f3049126%2fevery-positive-power-of-5-appears-in-the-last-digits-of-bigger-power-of-5%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
Fix $n$.
The cases $n le 3$ can be handled directly.
We now assume $n > 3$.
Let $m = lceil n log_10 5 rceil$ be the smallest integer such that $10^m > 5^n$. For $n > 3$, we have $m < n$.
You want to find $N$ such that $5^N = k 10^m + 5^n$ for some integer $k$. Dividing both sides by $5^n$ yields $$5^N-n - 1 = k 2^m/ 5^n-m.$$
Thus if you show you can find a large integer $q$ such that $5^q - 1$ is divisible by $2^m$ then you can choose $N$ and $k$ appropriately to conclude the proof.
Base case: For $m=2$ we have $5^1 - 1$ divisible by $2^m$. Inductive step: if $5^q-1$ is divisible by $2^m$, then $5^2q-1 = (5^q-1)(5^q+1)$ is divisible by $2^m+1$.
answered Dec 22 '18 at 5:21
angryavian
39k23180
add a comment |
Fix $n$.
The cases $n le 3$ can be handled directly.
We now assume $n > 3$.
Let $m = lceil n log_10 5 rceil$ be the smallest integer such that $10^m > 5^n$. For $n > 3$, we have $m < n$.
You want to find $N$ such that $5^N = k 10^m + 5^n$ for some integer $k$. Dividing both sides by $5^n$ yields $$5^N-n - 1 = k 2^m/ 5^n-m.$$
Thus if you show you can find a large integer $q$ such that $5^q - 1$ is divisible by $2^m$ then you can choose $N$ and $k$ appropriately to conclude the proof.
Base case: For $m=2$ we have $5^1 - 1$ divisible by $2^m$. Inductive step: if $5^q-1$ is divisible by $2^m$, then $5^2q-1 = (5^q-1)(5^q+1)$ is divisible by $2^m+1$.
answered Dec 22 '18 at 5:21
angryavian
39k23180
add a comment |
Fix $n$.
The cases $n le 3$ can be handled directly.
We now assume $n > 3$.
Let $m = lceil n log_10 5 rceil$ be the smallest integer such that $10^m > 5^n$. For $n > 3$, we have $m < n$.
You want to find $N$ such that $5^N = k 10^m + 5^n$ for some integer $k$. Dividing both sides by $5^n$ yields $$5^N-n - 1 = k 2^m/ 5^n-m.$$
Thus if you show you can find a large integer $q$ such that $5^q - 1$ is divisible by $2^m$ then you can choose $N$ and $k$ appropriately to conclude the proof.
Base case: For $m=2$ we have $5^1 - 1$ divisible by $2^m$. Inductive step: if $5^q-1$ is divisible by $2^m$, then $5^2q-1 = (5^q-1)(5^q+1)$ is divisible by $2^m+1$.
answered Dec 22 '18 at 5:21
angryavian
39k23180
Fix $n$.
The cases $n le 3$ can be handled directly.
We now assume $n > 3$.
Let $m = lceil n log_10 5 rceil$ be the smallest integer such that $10^m > 5^n$. For $n > 3$, we have $m < n$.
You want to find $N$ such that $5^N = k 10^m + 5^n$ for some integer $k$. Dividing both sides by $5^n$ yields $$5^N-n - 1 = k 2^m/ 5^n-m.$$
Thus if you show you can find a large integer $q$ such that $5^q - 1$ is divisible by $2^m$ then you can choose $N$ and $k$ appropriately to conclude the proof.
Base case: For $m=2$ we have $5^1 - 1$ divisible by $2^m$. Inductive step: if $5^q-1$ is divisible by $2^m$, then $5^2q-1 = (5^q-1)(5^q+1)$ is divisible by $2^m+1$.
answered Dec 22 '18 at 5:21
angryavian
39k23180
answered Dec 22 '18 at 5:21
angryavian
39k23180
answered Dec 22 '18 at 5:21
angryavian
39k23180
answered Dec 22 '18 at 5:21
angryavian
39k23180
39k23180
add a comment |
add a comment |
We will prove that there exists a $N$ such that $5^n$ and $5^N$ have the same last $n$ digits
So what we need to do is to find $5^Nequiv 5^npmod10^n$
This can be achieved by setting $N=n+phi (2^n)$
Since $5^Nequiv 5^npmod5^n$ and $5^Nequiv 5^npmod2^n$
answered Dec 22 '18 at 5:26
bangzheng
211
Could you explain to me how you reached the last two lines?
– BrianH
Dec 22 '18 at 5:39
add a comment |
We will prove that there exists a $N$ such that $5^n$ and $5^N$ have the same last $n$ digits
So what we need to do is to find $5^Nequiv 5^npmod10^n$
This can be achieved by setting $N=n+phi (2^n)$
Since $5^Nequiv 5^npmod5^n$ and $5^Nequiv 5^npmod2^n$
answered Dec 22 '18 at 5:26
bangzheng
211
Could you explain to me how you reached the last two lines?
– BrianH
Dec 22 '18 at 5:39
add a comment |
We will prove that there exists a $N$ such that $5^n$ and $5^N$ have the same last $n$ digits
So what we need to do is to find $5^Nequiv 5^npmod10^n$
This can be achieved by setting $N=n+phi (2^n)$
Since $5^Nequiv 5^npmod5^n$ and $5^Nequiv 5^npmod2^n$
answered Dec 22 '18 at 5:26
bangzheng
211
We will prove that there exists a $N$ such that $5^n$ and $5^N$ have the same last $n$ digits
So what we need to do is to find $5^Nequiv 5^npmod10^n$
This can be achieved by setting $N=n+phi (2^n)$
Since $5^Nequiv 5^npmod5^n$ and $5^Nequiv 5^npmod2^n$
answered Dec 22 '18 at 5:26
bangzheng
211
answered Dec 22 '18 at 5:26
bangzheng
211
answered Dec 22 '18 at 5:26
bangzheng
211
answered Dec 22 '18 at 5:26
bangzheng
211
211
Could you explain to me how you reached the last two lines?
– BrianH
Dec 22 '18 at 5:39
add a comment |
Could you explain to me how you reached the last two lines?
– BrianH
Dec 22 '18 at 5:39
Could you explain to me how you reached the last two lines?
– BrianH
Dec 22 '18 at 5:39
Could you explain to me how you reached the last two lines?
– BrianH
Dec 22 '18 at 5:39
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%2f3049126%2fevery-positive-power-of-5-appears-in-the-last-digits-of-bigger-power-of-5%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
Why is the
contest-mathtag used? Please edit the question to add that context.– Shaun
Dec 24 '18 at 20:48
@Shaun Well what I'm I suppose to add? It was a problem on the worksheet from my Putnam class. It feel like saying that is just distracting
– BrianH
Dec 24 '18 at 20:51
1
Well, the fact that it's from your Putnam class. Don't worry about potential distractions. Context is strongly encouraged by many users here and, typically, it can be very helpful for some users for any number of reasons.
– Shaun
Dec 24 '18 at 20:56