If $2^n=(… underbrace{aa…aaa}_{xtext{ times}})_{10}$ what is maximum of $x$?
up vote
3
down vote
favorite
If $2^n=(... underbrace{aa...aaa}_{xtext{ times}})_{10}$ for positive integer $n$ then we have
$$2^n=(... underbrace{aa...aaa}_{xtext{ times}})_{10}=(bunderbrace{aa...aaa}_{xtext{ times}})_{10}=10^x b+a(10^{x-1}+...+1)$$
Where $a$ is a digit between $0$ and $9$ and $b$ is a natural number.
Simplifying more gives
$$9 times2^n=9b times 10^x + a (10^x-1)$$
Now if $n>3$ and $x>3$ then taking mod 2 gives $v_2(a)>3$ which is impossible. So one $x$ or $n$ is not greater than $3$. But the book says answer is $x=125$. Am I interpret this wrong?
elementary-number-theory
add a comment |
up vote
3
down vote
favorite
If $2^n=(... underbrace{aa...aaa}_{xtext{ times}})_{10}$ for positive integer $n$ then we have
$$2^n=(... underbrace{aa...aaa}_{xtext{ times}})_{10}=(bunderbrace{aa...aaa}_{xtext{ times}})_{10}=10^x b+a(10^{x-1}+...+1)$$
Where $a$ is a digit between $0$ and $9$ and $b$ is a natural number.
Simplifying more gives
$$9 times2^n=9b times 10^x + a (10^x-1)$$
Now if $n>3$ and $x>3$ then taking mod 2 gives $v_2(a)>3$ which is impossible. So one $x$ or $n$ is not greater than $3$. But the book says answer is $x=125$. Am I interpret this wrong?
elementary-number-theory
2
Yeah, $x=125$ definitely seems wrong.
– Thomas Andrews
Nov 15 at 22:47
1
I see that your solution is right. For a different approach, one can prove that $2^{n+500} equiv 2^n pmod{10^4}$ for all $n geq 4$ (by using $varphi(5^4)=500$, for instance), and up to $n leq 503$, $x$ only takes the values ${1, 2, 3}$, with $2^{39} = 549755813888$ the smallest case with $x=3$.
– Sangchul Lee
Nov 15 at 22:57
add a comment |
up vote
3
down vote
favorite
up vote
3
down vote
favorite
If $2^n=(... underbrace{aa...aaa}_{xtext{ times}})_{10}$ for positive integer $n$ then we have
$$2^n=(... underbrace{aa...aaa}_{xtext{ times}})_{10}=(bunderbrace{aa...aaa}_{xtext{ times}})_{10}=10^x b+a(10^{x-1}+...+1)$$
Where $a$ is a digit between $0$ and $9$ and $b$ is a natural number.
Simplifying more gives
$$9 times2^n=9b times 10^x + a (10^x-1)$$
Now if $n>3$ and $x>3$ then taking mod 2 gives $v_2(a)>3$ which is impossible. So one $x$ or $n$ is not greater than $3$. But the book says answer is $x=125$. Am I interpret this wrong?
elementary-number-theory
If $2^n=(... underbrace{aa...aaa}_{xtext{ times}})_{10}$ for positive integer $n$ then we have
$$2^n=(... underbrace{aa...aaa}_{xtext{ times}})_{10}=(bunderbrace{aa...aaa}_{xtext{ times}})_{10}=10^x b+a(10^{x-1}+...+1)$$
Where $a$ is a digit between $0$ and $9$ and $b$ is a natural number.
Simplifying more gives
$$9 times2^n=9b times 10^x + a (10^x-1)$$
Now if $n>3$ and $x>3$ then taking mod 2 gives $v_2(a)>3$ which is impossible. So one $x$ or $n$ is not greater than $3$. But the book says answer is $x=125$. Am I interpret this wrong?
elementary-number-theory
elementary-number-theory
asked Nov 15 at 22:31
Ghartal
2,86211335
2,86211335
2
Yeah, $x=125$ definitely seems wrong.
– Thomas Andrews
Nov 15 at 22:47
1
I see that your solution is right. For a different approach, one can prove that $2^{n+500} equiv 2^n pmod{10^4}$ for all $n geq 4$ (by using $varphi(5^4)=500$, for instance), and up to $n leq 503$, $x$ only takes the values ${1, 2, 3}$, with $2^{39} = 549755813888$ the smallest case with $x=3$.
– Sangchul Lee
Nov 15 at 22:57
add a comment |
2
Yeah, $x=125$ definitely seems wrong.
– Thomas Andrews
Nov 15 at 22:47
1
I see that your solution is right. For a different approach, one can prove that $2^{n+500} equiv 2^n pmod{10^4}$ for all $n geq 4$ (by using $varphi(5^4)=500$, for instance), and up to $n leq 503$, $x$ only takes the values ${1, 2, 3}$, with $2^{39} = 549755813888$ the smallest case with $x=3$.
– Sangchul Lee
Nov 15 at 22:57
2
2
Yeah, $x=125$ definitely seems wrong.
– Thomas Andrews
Nov 15 at 22:47
Yeah, $x=125$ definitely seems wrong.
– Thomas Andrews
Nov 15 at 22:47
1
1
I see that your solution is right. For a different approach, one can prove that $2^{n+500} equiv 2^n pmod{10^4}$ for all $n geq 4$ (by using $varphi(5^4)=500$, for instance), and up to $n leq 503$, $x$ only takes the values ${1, 2, 3}$, with $2^{39} = 549755813888$ the smallest case with $x=3$.
– Sangchul Lee
Nov 15 at 22:57
I see that your solution is right. For a different approach, one can prove that $2^{n+500} equiv 2^n pmod{10^4}$ for all $n geq 4$ (by using $varphi(5^4)=500$, for instance), and up to $n leq 503$, $x$ only takes the values ${1, 2, 3}$, with $2^{39} = 549755813888$ the smallest case with $x=3$.
– Sangchul Lee
Nov 15 at 22:57
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
accepted
If $nge 4$, then $2^n$ must be a multiple of $16$, therefore so are its last four digits. There are no factors of $5$ so the last four digits cannot be $0000$. Now, which other possibilities for four identical last digits will give a multiple of $16$? Try them out and see.
The comments identify $2^{39}=...888$. If you work out the part above you are left with what must be the answer.
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
If $nge 4$, then $2^n$ must be a multiple of $16$, therefore so are its last four digits. There are no factors of $5$ so the last four digits cannot be $0000$. Now, which other possibilities for four identical last digits will give a multiple of $16$? Try them out and see.
The comments identify $2^{39}=...888$. If you work out the part above you are left with what must be the answer.
add a comment |
up vote
1
down vote
accepted
If $nge 4$, then $2^n$ must be a multiple of $16$, therefore so are its last four digits. There are no factors of $5$ so the last four digits cannot be $0000$. Now, which other possibilities for four identical last digits will give a multiple of $16$? Try them out and see.
The comments identify $2^{39}=...888$. If you work out the part above you are left with what must be the answer.
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
If $nge 4$, then $2^n$ must be a multiple of $16$, therefore so are its last four digits. There are no factors of $5$ so the last four digits cannot be $0000$. Now, which other possibilities for four identical last digits will give a multiple of $16$? Try them out and see.
The comments identify $2^{39}=...888$. If you work out the part above you are left with what must be the answer.
If $nge 4$, then $2^n$ must be a multiple of $16$, therefore so are its last four digits. There are no factors of $5$ so the last four digits cannot be $0000$. Now, which other possibilities for four identical last digits will give a multiple of $16$? Try them out and see.
The comments identify $2^{39}=...888$. If you work out the part above you are left with what must be the answer.
edited Nov 16 at 1:30
answered Nov 16 at 1:21
Oscar Lanzi
11.8k11936
11.8k11936
add a comment |
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%2f3000427%2fif-2n-underbraceaa-aaa-x-text-times-10-what-is-maximum-of-x%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
2
Yeah, $x=125$ definitely seems wrong.
– Thomas Andrews
Nov 15 at 22:47
1
I see that your solution is right. For a different approach, one can prove that $2^{n+500} equiv 2^n pmod{10^4}$ for all $n geq 4$ (by using $varphi(5^4)=500$, for instance), and up to $n leq 503$, $x$ only takes the values ${1, 2, 3}$, with $2^{39} = 549755813888$ the smallest case with $x=3$.
– Sangchul Lee
Nov 15 at 22:57