Digits in an algebraic irrational number
$begingroup$
I am trying to solve a problem and I got a conditional result related to normality of algebraic irrational numbers (Borel conjecture).
I know that by using Ridout theorem or Schmidt subspace theorem is possible to find a good lower bound for the number of nonzero "digits" in the $g$-ary expansion of an algebraic irrational number (for any basis $ggeq 2$).
However, my question is in the opposite direction:
Is it possible to prove that every algebraic irrational number has at least one 0 in its $g$-ary expansion, for all sufficiently large $ggeq 2$?
Of course, if this statement is true, then it is possible to prove that, in fact, there are infinitely many $0$'s in its $g$-ary expansion (by multiplying the algebraic number for some convenient power of $10$).
Any help will be welcomed.
nt.number-theory measure-theory diophantine-approximation transcendental-number-theory equidistribution
$endgroup$
add a comment |
$begingroup$
I am trying to solve a problem and I got a conditional result related to normality of algebraic irrational numbers (Borel conjecture).
I know that by using Ridout theorem or Schmidt subspace theorem is possible to find a good lower bound for the number of nonzero "digits" in the $g$-ary expansion of an algebraic irrational number (for any basis $ggeq 2$).
However, my question is in the opposite direction:
Is it possible to prove that every algebraic irrational number has at least one 0 in its $g$-ary expansion, for all sufficiently large $ggeq 2$?
Of course, if this statement is true, then it is possible to prove that, in fact, there are infinitely many $0$'s in its $g$-ary expansion (by multiplying the algebraic number for some convenient power of $10$).
Any help will be welcomed.
nt.number-theory measure-theory diophantine-approximation transcendental-number-theory equidistribution
$endgroup$
add a comment |
$begingroup$
I am trying to solve a problem and I got a conditional result related to normality of algebraic irrational numbers (Borel conjecture).
I know that by using Ridout theorem or Schmidt subspace theorem is possible to find a good lower bound for the number of nonzero "digits" in the $g$-ary expansion of an algebraic irrational number (for any basis $ggeq 2$).
However, my question is in the opposite direction:
Is it possible to prove that every algebraic irrational number has at least one 0 in its $g$-ary expansion, for all sufficiently large $ggeq 2$?
Of course, if this statement is true, then it is possible to prove that, in fact, there are infinitely many $0$'s in its $g$-ary expansion (by multiplying the algebraic number for some convenient power of $10$).
Any help will be welcomed.
nt.number-theory measure-theory diophantine-approximation transcendental-number-theory equidistribution
$endgroup$
I am trying to solve a problem and I got a conditional result related to normality of algebraic irrational numbers (Borel conjecture).
I know that by using Ridout theorem or Schmidt subspace theorem is possible to find a good lower bound for the number of nonzero "digits" in the $g$-ary expansion of an algebraic irrational number (for any basis $ggeq 2$).
However, my question is in the opposite direction:
Is it possible to prove that every algebraic irrational number has at least one 0 in its $g$-ary expansion, for all sufficiently large $ggeq 2$?
Of course, if this statement is true, then it is possible to prove that, in fact, there are infinitely many $0$'s in its $g$-ary expansion (by multiplying the algebraic number for some convenient power of $10$).
Any help will be welcomed.
nt.number-theory measure-theory diophantine-approximation transcendental-number-theory equidistribution
nt.number-theory measure-theory diophantine-approximation transcendental-number-theory equidistribution
asked 12 hours ago
JeanJean
843
843
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
What is known is that every real irrational has a $0$ in its $g$-ary expansion for infinitely many $g$. WLOG take $0 < x < 1$.
Taking an even-numbered convergent of the continued fraction of $x$ gives us a rational $p/q$ such that
$$frac{p}{q} < x < frac{p}{q} + frac{1}{q^2}$$
so that the first two digits in the base-$q$ expansion of $x$ are $p$ and $0$.
Of course, this is a far cry from all sufficiently large $g$ (which is surely true, but I very much doubt it's provable in the current state of the art).
$endgroup$
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: "504"
};
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%2fmathoverflow.net%2fquestions%2f324358%2fdigits-in-an-algebraic-irrational-number%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$
What is known is that every real irrational has a $0$ in its $g$-ary expansion for infinitely many $g$. WLOG take $0 < x < 1$.
Taking an even-numbered convergent of the continued fraction of $x$ gives us a rational $p/q$ such that
$$frac{p}{q} < x < frac{p}{q} + frac{1}{q^2}$$
so that the first two digits in the base-$q$ expansion of $x$ are $p$ and $0$.
Of course, this is a far cry from all sufficiently large $g$ (which is surely true, but I very much doubt it's provable in the current state of the art).
$endgroup$
add a comment |
$begingroup$
What is known is that every real irrational has a $0$ in its $g$-ary expansion for infinitely many $g$. WLOG take $0 < x < 1$.
Taking an even-numbered convergent of the continued fraction of $x$ gives us a rational $p/q$ such that
$$frac{p}{q} < x < frac{p}{q} + frac{1}{q^2}$$
so that the first two digits in the base-$q$ expansion of $x$ are $p$ and $0$.
Of course, this is a far cry from all sufficiently large $g$ (which is surely true, but I very much doubt it's provable in the current state of the art).
$endgroup$
add a comment |
$begingroup$
What is known is that every real irrational has a $0$ in its $g$-ary expansion for infinitely many $g$. WLOG take $0 < x < 1$.
Taking an even-numbered convergent of the continued fraction of $x$ gives us a rational $p/q$ such that
$$frac{p}{q} < x < frac{p}{q} + frac{1}{q^2}$$
so that the first two digits in the base-$q$ expansion of $x$ are $p$ and $0$.
Of course, this is a far cry from all sufficiently large $g$ (which is surely true, but I very much doubt it's provable in the current state of the art).
$endgroup$
What is known is that every real irrational has a $0$ in its $g$-ary expansion for infinitely many $g$. WLOG take $0 < x < 1$.
Taking an even-numbered convergent of the continued fraction of $x$ gives us a rational $p/q$ such that
$$frac{p}{q} < x < frac{p}{q} + frac{1}{q^2}$$
so that the first two digits in the base-$q$ expansion of $x$ are $p$ and $0$.
Of course, this is a far cry from all sufficiently large $g$ (which is surely true, but I very much doubt it's provable in the current state of the art).
answered 11 hours ago
Robert IsraelRobert Israel
42.6k51122
42.6k51122
add a comment |
add a comment |
Thanks for contributing an answer to MathOverflow!
- 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%2fmathoverflow.net%2fquestions%2f324358%2fdigits-in-an-algebraic-irrational-number%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