Are there infinite many perfect powers consisting of at most two decimal digits?
$begingroup$
Suppose, $a,bge 2$ are integers. Then $$N=a^b$$ is a perfect power. Assuming that $a$ is not divisible by $10$, are there infinite many such perfect powers consisting of at most $2$ distinct decimal digits ?
The first few perfect powers with the desired property are :
? for(j=1,10^7,if(Mod(j,10)<>0,if(ispower(j)>0,if(length(Set(digits(j)))<=2,prin
t1(j," ")))))
4 8 9 16 25 27 32 36 49 64 81 121 144 225 343 441 484 676 1331 1444 7744 7776 11
881 29929 44944 55225 69696 9696996
?
Additionally, I found the square $$6661661161$$
Are there more examples, and if yes, are there infinite many examples ?
number-theory elementary-number-theory perfect-powers
asked Dec 28 '18 at 20:18
PeterPeter
48.1k1139133
$endgroup$
add a comment |
$begingroup$
Suppose, $a,bge 2$ are integers. Then $$N=a^b$$ is a perfect power. Assuming that $a$ is not divisible by $10$, are there infinite many such perfect powers consisting of at most $2$ distinct decimal digits ?
The first few perfect powers with the desired property are :
? for(j=1,10^7,if(Mod(j,10)<>0,if(ispower(j)>0,if(length(Set(digits(j)))<=2,prin
t1(j," ")))))
4 8 9 16 25 27 32 36 49 64 81 121 144 225 343 441 484 676 1331 1444 7744 7776 11
881 29929 44944 55225 69696 9696996
?
Additionally, I found the square $$6661661161$$
Are there more examples, and if yes, are there infinite many examples ?
number-theory elementary-number-theory perfect-powers
asked Dec 28 '18 at 20:18
PeterPeter
48.1k1139133
$endgroup$
$begingroup$
Note: If you want empiric evidence, find all 3 digit numbers n with only two different digits in the last three digits. To find the 4 digit numbers with only two different digits in the last four digits, examine n, n+1000, n+2000, ..., n+9000. You can examine all numbers up to 10^k in very roughly 2^n operations.
$endgroup$
– gnasher729
Dec 28 '18 at 20:44
1
$begingroup$
Quote from oeis.org/A018885 : Is 6661661161 the largest term not of the form 10^k, 4*10^k or 9*10^k? Any larger ones must have >= 22 digits.
$endgroup$
– Oldboy
Dec 29 '18 at 11:37
add a comment |
$begingroup$
Suppose, $a,bge 2$ are integers. Then $$N=a^b$$ is a perfect power. Assuming that $a$ is not divisible by $10$, are there infinite many such perfect powers consisting of at most $2$ distinct decimal digits ?
The first few perfect powers with the desired property are :
? for(j=1,10^7,if(Mod(j,10)<>0,if(ispower(j)>0,if(length(Set(digits(j)))<=2,prin
t1(j," ")))))
4 8 9 16 25 27 32 36 49 64 81 121 144 225 343 441 484 676 1331 1444 7744 7776 11
881 29929 44944 55225 69696 9696996
?
Additionally, I found the square $$6661661161$$
Are there more examples, and if yes, are there infinite many examples ?
number-theory elementary-number-theory perfect-powers
asked Dec 28 '18 at 20:18
PeterPeter
48.1k1139133
$endgroup$
Suppose, $a,bge 2$ are integers. Then $$N=a^b$$ is a perfect power. Assuming that $a$ is not divisible by $10$, are there infinite many such perfect powers consisting of at most $2$ distinct decimal digits ?
The first few perfect powers with the desired property are :
? for(j=1,10^7,if(Mod(j,10)<>0,if(ispower(j)>0,if(length(Set(digits(j)))<=2,prin
t1(j," ")))))
4 8 9 16 25 27 32 36 49 64 81 121 144 225 343 441 484 676 1331 1444 7744 7776 11
881 29929 44944 55225 69696 9696996
?
Additionally, I found the square $$6661661161$$
Are there more examples, and if yes, are there infinite many examples ?
number-theory elementary-number-theory perfect-powers
number-theory elementary-number-theory perfect-powers
asked Dec 28 '18 at 20:18
PeterPeter
48.1k1139133
asked Dec 28 '18 at 20:18
PeterPeter
48.1k1139133
asked Dec 28 '18 at 20:18
PeterPeter
48.1k1139133
asked Dec 28 '18 at 20:18
PeterPeter
48.1k1139133
asked Dec 28 '18 at 20:18
PeterPeter
48.1k1139133
48.1k1139133
$begingroup$
Note: If you want empiric evidence, find all 3 digit numbers n with only two different digits in the last three digits. To find the 4 digit numbers with only two different digits in the last four digits, examine n, n+1000, n+2000, ..., n+9000. You can examine all numbers up to 10^k in very roughly 2^n operations.
$endgroup$
– gnasher729
Dec 28 '18 at 20:44
1
$begingroup$
Quote from oeis.org/A018885 : Is 6661661161 the largest term not of the form 10^k, 4*10^k or 9*10^k? Any larger ones must have >= 22 digits.
$endgroup$
– Oldboy
Dec 29 '18 at 11:37
add a comment |
$begingroup$
Note: If you want empiric evidence, find all 3 digit numbers n with only two different digits in the last three digits. To find the 4 digit numbers with only two different digits in the last four digits, examine n, n+1000, n+2000, ..., n+9000. You can examine all numbers up to 10^k in very roughly 2^n operations.
$endgroup$
– gnasher729
Dec 28 '18 at 20:44
1
$begingroup$
Quote from oeis.org/A018885 : Is 6661661161 the largest term not of the form 10^k, 4*10^k or 9*10^k? Any larger ones must have >= 22 digits.
$endgroup$
– Oldboy
Dec 29 '18 at 11:37
$begingroup$
Note: If you want empiric evidence, find all 3 digit numbers n with only two different digits in the last three digits. To find the 4 digit numbers with only two different digits in the last four digits, examine n, n+1000, n+2000, ..., n+9000. You can examine all numbers up to 10^k in very roughly 2^n operations.
$endgroup$
– gnasher729
Dec 28 '18 at 20:44
$begingroup$
Note: If you want empiric evidence, find all 3 digit numbers n with only two different digits in the last three digits. To find the 4 digit numbers with only two different digits in the last four digits, examine n, n+1000, n+2000, ..., n+9000. You can examine all numbers up to 10^k in very roughly 2^n operations.
$endgroup$
– gnasher729
Dec 28 '18 at 20:44
1
1
$begingroup$
Quote from oeis.org/A018885 : Is 6661661161 the largest term not of the form 10^k, 4*10^k or 9*10^k? Any larger ones must have >= 22 digits.
$endgroup$
– Oldboy
Dec 29 '18 at 11:37
$begingroup$
Quote from oeis.org/A018885 : Is 6661661161 the largest term not of the form 10^k, 4*10^k or 9*10^k? Any larger ones must have >= 22 digits.
$endgroup$
– Oldboy
Dec 29 '18 at 11:37
add a comment |
0
active
oldest
votes
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%2f3055250%2fare-there-infinite-many-perfect-powers-consisting-of-at-most-two-decimal-digits%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3055250%2fare-there-infinite-many-perfect-powers-consisting-of-at-most-two-decimal-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
$begingroup$
Note: If you want empiric evidence, find all 3 digit numbers n with only two different digits in the last three digits. To find the 4 digit numbers with only two different digits in the last four digits, examine n, n+1000, n+2000, ..., n+9000. You can examine all numbers up to 10^k in very roughly 2^n operations.
$endgroup$
– gnasher729
Dec 28 '18 at 20:44
1
$begingroup$
Quote from oeis.org/A018885 : Is 6661661161 the largest term not of the form 10^k, 4*10^k or 9*10^k? Any larger ones must have >= 22 digits.
$endgroup$
– Oldboy
Dec 29 '18 at 11:37