Understanding Erdos' Proof on Weird Number Density
$begingroup$
In this 1974 paper, Paul Erdos proves that the set of weird numbers has positive density in the natural numbers.
THEOREM 5. The density of weird numbers is positive .
Proof. If $n$ is weird, then let $epsilon_n$be as in the proof of the lemma. Now, by the
lemma, if $t$ is an integer and $a-(t)/t < 1 + epsilon_n$ then $nt$ is weird . But the density of the
integers $t$ with $Q(t)/t < 1 + epsilon_n$ is positive for any $epsilon_n > 0$.
Actually, we proved a slightly stronger result . If $n$ is weird, then the density of
{$m; n I m$ and $m$ is weird} is positive .
The lemma he is referring to in his proof is the following.
LEMMA. If $n$ is weird, then there is an $epsilon_n > 0$ such that $nt$ is weird if
$$sum_{d|t}{frac{1}{d}}<1+epsilon_n$$
I understand the heuristics behind this theorem, it is easy to make more weird numbers from multiples of other weird numbers, however, I am confused about the following statement.
But the density of the
integers $t$ with $Q(t)/t < 1 + epsilon_n$ is positive for any $epsilon_n > 0$.
Could someone show/explain to me where this statement comes from? It seems to be the crux of the proof, however, I don't see where it comes from.
Thank you in advance.
number-theory asymptotics
$endgroup$
add a comment |
$begingroup$
In this 1974 paper, Paul Erdos proves that the set of weird numbers has positive density in the natural numbers.
THEOREM 5. The density of weird numbers is positive .
Proof. If $n$ is weird, then let $epsilon_n$be as in the proof of the lemma. Now, by the
lemma, if $t$ is an integer and $a-(t)/t < 1 + epsilon_n$ then $nt$ is weird . But the density of the
integers $t$ with $Q(t)/t < 1 + epsilon_n$ is positive for any $epsilon_n > 0$.
Actually, we proved a slightly stronger result . If $n$ is weird, then the density of
{$m; n I m$ and $m$ is weird} is positive .
The lemma he is referring to in his proof is the following.
LEMMA. If $n$ is weird, then there is an $epsilon_n > 0$ such that $nt$ is weird if
$$sum_{d|t}{frac{1}{d}}<1+epsilon_n$$
I understand the heuristics behind this theorem, it is easy to make more weird numbers from multiples of other weird numbers, however, I am confused about the following statement.
But the density of the
integers $t$ with $Q(t)/t < 1 + epsilon_n$ is positive for any $epsilon_n > 0$.
Could someone show/explain to me where this statement comes from? It seems to be the crux of the proof, however, I don't see where it comes from.
Thank you in advance.
number-theory asymptotics
$endgroup$
add a comment |
$begingroup$
In this 1974 paper, Paul Erdos proves that the set of weird numbers has positive density in the natural numbers.
THEOREM 5. The density of weird numbers is positive .
Proof. If $n$ is weird, then let $epsilon_n$be as in the proof of the lemma. Now, by the
lemma, if $t$ is an integer and $a-(t)/t < 1 + epsilon_n$ then $nt$ is weird . But the density of the
integers $t$ with $Q(t)/t < 1 + epsilon_n$ is positive for any $epsilon_n > 0$.
Actually, we proved a slightly stronger result . If $n$ is weird, then the density of
{$m; n I m$ and $m$ is weird} is positive .
The lemma he is referring to in his proof is the following.
LEMMA. If $n$ is weird, then there is an $epsilon_n > 0$ such that $nt$ is weird if
$$sum_{d|t}{frac{1}{d}}<1+epsilon_n$$
I understand the heuristics behind this theorem, it is easy to make more weird numbers from multiples of other weird numbers, however, I am confused about the following statement.
But the density of the
integers $t$ with $Q(t)/t < 1 + epsilon_n$ is positive for any $epsilon_n > 0$.
Could someone show/explain to me where this statement comes from? It seems to be the crux of the proof, however, I don't see where it comes from.
Thank you in advance.
number-theory asymptotics
$endgroup$
In this 1974 paper, Paul Erdos proves that the set of weird numbers has positive density in the natural numbers.
THEOREM 5. The density of weird numbers is positive .
Proof. If $n$ is weird, then let $epsilon_n$be as in the proof of the lemma. Now, by the
lemma, if $t$ is an integer and $a-(t)/t < 1 + epsilon_n$ then $nt$ is weird . But the density of the
integers $t$ with $Q(t)/t < 1 + epsilon_n$ is positive for any $epsilon_n > 0$.
Actually, we proved a slightly stronger result . If $n$ is weird, then the density of
{$m; n I m$ and $m$ is weird} is positive .
The lemma he is referring to in his proof is the following.
LEMMA. If $n$ is weird, then there is an $epsilon_n > 0$ such that $nt$ is weird if
$$sum_{d|t}{frac{1}{d}}<1+epsilon_n$$
I understand the heuristics behind this theorem, it is easy to make more weird numbers from multiples of other weird numbers, however, I am confused about the following statement.
But the density of the
integers $t$ with $Q(t)/t < 1 + epsilon_n$ is positive for any $epsilon_n > 0$.
Could someone show/explain to me where this statement comes from? It seems to be the crux of the proof, however, I don't see where it comes from.
Thank you in advance.
number-theory asymptotics
number-theory asymptotics
edited Jan 29 at 1:03
Gnumbertester
asked Jan 29 at 0:54
GnumbertesterGnumbertester
6701114
6701114
add a comment |
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%2f3091604%2funderstanding-erdos-proof-on-weird-number-density%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%2f3091604%2funderstanding-erdos-proof-on-weird-number-density%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