The growth-rate of a sum over a prime-counting function thing
$begingroup$
What might the growth rate of
$$S(n)=sum_{k=1}^{lfloor n/2 rfloor-1} pi(n-2k)^{k+1}$$
(where $pi$ is being used to represent the prime-counting function) be and what techniques are suggested to prove it?
Is the prime number theorem needed here?
(I am trying to use this function as a way to bound another one)
number-theory prime-numbers asymptotics
asked Jan 6 at 16:44
Cardioid_Ass_22Cardioid_Ass_22
47815
$endgroup$
add a comment |
$begingroup$
What might the growth rate of
$$S(n)=sum_{k=1}^{lfloor n/2 rfloor-1} pi(n-2k)^{k+1}$$
(where $pi$ is being used to represent the prime-counting function) be and what techniques are suggested to prove it?
Is the prime number theorem needed here?
(I am trying to use this function as a way to bound another one)
number-theory prime-numbers asymptotics
asked Jan 6 at 16:44
Cardioid_Ass_22Cardioid_Ass_22
47815
$endgroup$
add a comment |
$begingroup$
What might the growth rate of
$$S(n)=sum_{k=1}^{lfloor n/2 rfloor-1} pi(n-2k)^{k+1}$$
(where $pi$ is being used to represent the prime-counting function) be and what techniques are suggested to prove it?
Is the prime number theorem needed here?
(I am trying to use this function as a way to bound another one)
number-theory prime-numbers asymptotics
asked Jan 6 at 16:44
Cardioid_Ass_22Cardioid_Ass_22
47815
$endgroup$
What might the growth rate of
$$S(n)=sum_{k=1}^{lfloor n/2 rfloor-1} pi(n-2k)^{k+1}$$
(where $pi$ is being used to represent the prime-counting function) be and what techniques are suggested to prove it?
Is the prime number theorem needed here?
(I am trying to use this function as a way to bound another one)
number-theory prime-numbers asymptotics
number-theory prime-numbers asymptotics
asked Jan 6 at 16:44
Cardioid_Ass_22Cardioid_Ass_22
47815
asked Jan 6 at 16:44
Cardioid_Ass_22Cardioid_Ass_22
47815
asked Jan 6 at 16:44
Cardioid_Ass_22Cardioid_Ass_22
47815
asked Jan 6 at 16:44
Cardioid_Ass_22Cardioid_Ass_22
47815
asked Jan 6 at 16:44
Cardioid_Ass_22Cardioid_Ass_22
47815
47815
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%2f3064093%2fthe-growth-rate-of-a-sum-over-a-prime-counting-function-thing%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%2f3064093%2fthe-growth-rate-of-a-sum-over-a-prime-counting-function-thing%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
