Mixing
error term of primes in arithmetic progression
Given a positive integer $n>1$, do we have some bound on the sequence
$$a_n=sum_{chineq 1} sum_{p} frac{chi(p)}{p},$$
where $chi$ runs over the nontrivial characters modulo $n$ and $p$ runs over all primes.
This is a real number, since
$$sum_{chineq 1} sum_{p} frac{chi(p)}{p^s}=sum_{pequiv1(n)}frac{phi(n)}{p^s}-sum_{p}frac{1}{p^s}.$$
Here $phi$ is Euler's function. Since by Dirichlet's theorem, ratio of the two terms on the right is $1$ when $srightarrow 1$. So I say this is an error term.
number-theory prime-numbers analytic-number-theory
edited Nov 21 '18 at 13:01
Klangen
1,65711334
asked Jan 11 '18 at 12:06
J.Li
406
add a comment |
Given a positive integer $n>1$, do we have some bound on the sequence
$$a_n=sum_{chineq 1} sum_{p} frac{chi(p)}{p},$$
where $chi$ runs over the nontrivial characters modulo $n$ and $p$ runs over all primes.
This is a real number, since
$$sum_{chineq 1} sum_{p} frac{chi(p)}{p^s}=sum_{pequiv1(n)}frac{phi(n)}{p^s}-sum_{p}frac{1}{p^s}.$$
Here $phi$ is Euler's function. Since by Dirichlet's theorem, ratio of the two terms on the right is $1$ when $srightarrow 1$. So I say this is an error term.
number-theory prime-numbers analytic-number-theory
edited Nov 21 '18 at 13:01
Klangen
1,65711334
asked Jan 11 '18 at 12:06
J.Li
406
$phi$ is euler's totient function, but was is $chi$?
– unseen_rider
Jan 11 '18 at 19:37
@unseen_rider Yes, $phi$ is Euler's function and $chi$ is a character modulo $n$
– J.Li
Jan 12 '18 at 3:05
en.wikipedia.org/wiki/Siegel_zero
– reuns
Nov 21 '18 at 13:10
add a comment |
Given a positive integer $n>1$, do we have some bound on the sequence
$$a_n=sum_{chineq 1} sum_{p} frac{chi(p)}{p},$$
where $chi$ runs over the nontrivial characters modulo $n$ and $p$ runs over all primes.
This is a real number, since
$$sum_{chineq 1} sum_{p} frac{chi(p)}{p^s}=sum_{pequiv1(n)}frac{phi(n)}{p^s}-sum_{p}frac{1}{p^s}.$$
Here $phi$ is Euler's function. Since by Dirichlet's theorem, ratio of the two terms on the right is $1$ when $srightarrow 1$. So I say this is an error term.
number-theory prime-numbers analytic-number-theory
edited Nov 21 '18 at 13:01
Klangen
1,65711334
asked Jan 11 '18 at 12:06
J.Li
406
Given a positive integer $n>1$, do we have some bound on the sequence
$$a_n=sum_{chineq 1} sum_{p} frac{chi(p)}{p},$$
where $chi$ runs over the nontrivial characters modulo $n$ and $p$ runs over all primes.
This is a real number, since
$$sum_{chineq 1} sum_{p} frac{chi(p)}{p^s}=sum_{pequiv1(n)}frac{phi(n)}{p^s}-sum_{p}frac{1}{p^s}.$$
Here $phi$ is Euler's function. Since by Dirichlet's theorem, ratio of the two terms on the right is $1$ when $srightarrow 1$. So I say this is an error term.
number-theory prime-numbers analytic-number-theory
number-theory prime-numbers analytic-number-theory
edited Nov 21 '18 at 13:01
Klangen
1,65711334
asked Jan 11 '18 at 12:06
J.Li
406
edited Nov 21 '18 at 13:01
Klangen
1,65711334
asked Jan 11 '18 at 12:06
J.Li
406
edited Nov 21 '18 at 13:01
Klangen
1,65711334
edited Nov 21 '18 at 13:01
Klangen
1,65711334
edited Nov 21 '18 at 13:01
Klangen
1,65711334
1,65711334
asked Jan 11 '18 at 12:06
J.Li
406
asked Jan 11 '18 at 12:06
J.Li
406
asked Jan 11 '18 at 12:06
J.Li
406
406
$phi$ is euler's totient function, but was is $chi$?
– unseen_rider
Jan 11 '18 at 19:37
@unseen_rider Yes, $phi$ is Euler's function and $chi$ is a character modulo $n$
– J.Li
Jan 12 '18 at 3:05
en.wikipedia.org/wiki/Siegel_zero
– reuns
Nov 21 '18 at 13:10
add a comment |
$phi$ is euler's totient function, but was is $chi$?
– unseen_rider
Jan 11 '18 at 19:37
@unseen_rider Yes, $phi$ is Euler's function and $chi$ is a character modulo $n$
– J.Li
Jan 12 '18 at 3:05
en.wikipedia.org/wiki/Siegel_zero
– reuns
Nov 21 '18 at 13:10
$phi$ is euler's totient function, but was is $chi$?
– unseen_rider
Jan 11 '18 at 19:37
$phi$ is euler's totient function, but was is $chi$?
– unseen_rider
Jan 11 '18 at 19:37
@unseen_rider Yes, $phi$ is Euler's function and $chi$ is a character modulo $n$
– J.Li
Jan 12 '18 at 3:05
@unseen_rider Yes, $phi$ is Euler's function and $chi$ is a character modulo $n$
– J.Li
Jan 12 '18 at 3:05
en.wikipedia.org/wiki/Siegel_zero
– reuns
Nov 21 '18 at 13:10
en.wikipedia.org/wiki/Siegel_zero
– reuns
Nov 21 '18 at 13:10
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%2f2600872%2ferror-term-of-primes-in-arithmetic-progression%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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f2600872%2ferror-term-of-primes-in-arithmetic-progression%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
$phi$ is euler's totient function, but was is $chi$?
– unseen_rider
Jan 11 '18 at 19:37
@unseen_rider Yes, $phi$ is Euler's function and $chi$ is a character modulo $n$
– J.Li
Jan 12 '18 at 3:05
en.wikipedia.org/wiki/Siegel_zero
– reuns
Nov 21 '18 at 13:10