Expected size of the maximal prime gap below x under Hardy-Littlewood conjecture
Let $ pi_{n}(x) $ denote the number of prime gaps of size $ n $ below $ x $ for even $ n $. The Hardy-Littlewood conjecture predicts that $ pi_{n}(x)sim C_{n}frac{x}{log^{2}x} $ with $ C_{n}=C_{2}prod_{qmid n}frac{(q-1)}{(q-2)} $, $ C_{2}=0.66016... $ is the so called twin prime constant and $ q $ runs among odd primes dividing $ n $. Let $ Q_{a,b}(x) $ be the largest primorial not exceeding $ x^{a}log^{b} x $.
Assuming the conjecture above, can we determine $ a $ and $ b $ so that $ pi_{Q_{a,b}(x)}(x)asymp 1 $ as $ x $ tends to $ infty $?
number-theory prime-numbers prime-gaps
edited Dec 20 '18 at 10:14
Klangen
1,65711334
asked Nov 11 '18 at 15:57
Sylvain JulienSylvain Julien
1,122918
add a comment |
Let $ pi_{n}(x) $ denote the number of prime gaps of size $ n $ below $ x $ for even $ n $. The Hardy-Littlewood conjecture predicts that $ pi_{n}(x)sim C_{n}frac{x}{log^{2}x} $ with $ C_{n}=C_{2}prod_{qmid n}frac{(q-1)}{(q-2)} $, $ C_{2}=0.66016... $ is the so called twin prime constant and $ q $ runs among odd primes dividing $ n $. Let $ Q_{a,b}(x) $ be the largest primorial not exceeding $ x^{a}log^{b} x $.
Assuming the conjecture above, can we determine $ a $ and $ b $ so that $ pi_{Q_{a,b}(x)}(x)asymp 1 $ as $ x $ tends to $ infty $?
number-theory prime-numbers prime-gaps
edited Dec 20 '18 at 10:14
Klangen
1,65711334
asked Nov 11 '18 at 15:57
Sylvain JulienSylvain Julien
1,122918
add a comment |
Let $ pi_{n}(x) $ denote the number of prime gaps of size $ n $ below $ x $ for even $ n $. The Hardy-Littlewood conjecture predicts that $ pi_{n}(x)sim C_{n}frac{x}{log^{2}x} $ with $ C_{n}=C_{2}prod_{qmid n}frac{(q-1)}{(q-2)} $, $ C_{2}=0.66016... $ is the so called twin prime constant and $ q $ runs among odd primes dividing $ n $. Let $ Q_{a,b}(x) $ be the largest primorial not exceeding $ x^{a}log^{b} x $.
Assuming the conjecture above, can we determine $ a $ and $ b $ so that $ pi_{Q_{a,b}(x)}(x)asymp 1 $ as $ x $ tends to $ infty $?
number-theory prime-numbers prime-gaps
edited Dec 20 '18 at 10:14
Klangen
1,65711334
asked Nov 11 '18 at 15:57
Sylvain JulienSylvain Julien
1,122918
Let $ pi_{n}(x) $ denote the number of prime gaps of size $ n $ below $ x $ for even $ n $. The Hardy-Littlewood conjecture predicts that $ pi_{n}(x)sim C_{n}frac{x}{log^{2}x} $ with $ C_{n}=C_{2}prod_{qmid n}frac{(q-1)}{(q-2)} $, $ C_{2}=0.66016... $ is the so called twin prime constant and $ q $ runs among odd primes dividing $ n $. Let $ Q_{a,b}(x) $ be the largest primorial not exceeding $ x^{a}log^{b} x $.
Assuming the conjecture above, can we determine $ a $ and $ b $ so that $ pi_{Q_{a,b}(x)}(x)asymp 1 $ as $ x $ tends to $ infty $?
number-theory prime-numbers prime-gaps
number-theory prime-numbers prime-gaps
edited Dec 20 '18 at 10:14
Klangen
1,65711334
asked Nov 11 '18 at 15:57
Sylvain JulienSylvain Julien
1,122918
edited Dec 20 '18 at 10:14
Klangen
1,65711334
asked Nov 11 '18 at 15:57
Sylvain JulienSylvain Julien
1,122918
edited Dec 20 '18 at 10:14
Klangen
1,65711334
edited Dec 20 '18 at 10:14
Klangen
1,65711334
edited Dec 20 '18 at 10:14
Klangen
1,65711334
1,65711334
asked Nov 11 '18 at 15:57
Sylvain JulienSylvain Julien
1,122918
asked Nov 11 '18 at 15:57
Sylvain JulienSylvain Julien
1,122918
asked Nov 11 '18 at 15:57
Sylvain JulienSylvain Julien
1,122918
1,122918
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%2f2994047%2fexpected-size-of-the-maximal-prime-gap-below-x-under-hardy-littlewood-conjecture%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%2f2994047%2fexpected-size-of-the-maximal-prime-gap-below-x-under-hardy-littlewood-conjecture%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
