Chapter V: Titchmarsh's book “The theory of the Riemann Zeta function”












0












$begingroup$


Through chapter V of Titchmarsh's book "The theory of the Riemann Zeta function" it is used a "counting technique" that I am not understanding. In particular, Theorem 5.12, p 106, uses something like: if $bleq 2a$, with $0<a<t$ and $sum_{a<nleq b}n^{-s-it}=O(f(t))$ then $sum_{nleq t}n^{-s-it}=O(f(t)log(t))$, as $ttoinfty$. My question is: how this $log(t)$ appears? That is how is it related to $bleq 2a$ and $0<a<t$?










share|cite|improve this question









$endgroup$












  • $begingroup$
    Here's a link to the book if anyone wants it.
    $endgroup$
    – Mason
    Dec 4 '18 at 19:53
















0












$begingroup$


Through chapter V of Titchmarsh's book "The theory of the Riemann Zeta function" it is used a "counting technique" that I am not understanding. In particular, Theorem 5.12, p 106, uses something like: if $bleq 2a$, with $0<a<t$ and $sum_{a<nleq b}n^{-s-it}=O(f(t))$ then $sum_{nleq t}n^{-s-it}=O(f(t)log(t))$, as $ttoinfty$. My question is: how this $log(t)$ appears? That is how is it related to $bleq 2a$ and $0<a<t$?










share|cite|improve this question









$endgroup$












  • $begingroup$
    Here's a link to the book if anyone wants it.
    $endgroup$
    – Mason
    Dec 4 '18 at 19:53














0












0








0





$begingroup$


Through chapter V of Titchmarsh's book "The theory of the Riemann Zeta function" it is used a "counting technique" that I am not understanding. In particular, Theorem 5.12, p 106, uses something like: if $bleq 2a$, with $0<a<t$ and $sum_{a<nleq b}n^{-s-it}=O(f(t))$ then $sum_{nleq t}n^{-s-it}=O(f(t)log(t))$, as $ttoinfty$. My question is: how this $log(t)$ appears? That is how is it related to $bleq 2a$ and $0<a<t$?










share|cite|improve this question









$endgroup$




Through chapter V of Titchmarsh's book "The theory of the Riemann Zeta function" it is used a "counting technique" that I am not understanding. In particular, Theorem 5.12, p 106, uses something like: if $bleq 2a$, with $0<a<t$ and $sum_{a<nleq b}n^{-s-it}=O(f(t))$ then $sum_{nleq t}n^{-s-it}=O(f(t)log(t))$, as $ttoinfty$. My question is: how this $log(t)$ appears? That is how is it related to $bleq 2a$ and $0<a<t$?







real-analysis sequences-and-series complex-analysis summation






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 4 '18 at 19:39









GoldSoundzGoldSoundz

1098




1098












  • $begingroup$
    Here's a link to the book if anyone wants it.
    $endgroup$
    – Mason
    Dec 4 '18 at 19:53


















  • $begingroup$
    Here's a link to the book if anyone wants it.
    $endgroup$
    – Mason
    Dec 4 '18 at 19:53
















$begingroup$
Here's a link to the book if anyone wants it.
$endgroup$
– Mason
Dec 4 '18 at 19:53




$begingroup$
Here's a link to the book if anyone wants it.
$endgroup$
– Mason
Dec 4 '18 at 19:53










1 Answer
1






active

oldest

votes


















1












$begingroup$

You need to apply the result, as also stated in the book, multiple times: Take $b_n=t 2^{-n}$ and $a_n = t 2^{-(n+1)}$ (e.g. $b_0 =t$, $a_0 =t/2$, $b_1 =t/2$, $a_1 =t/4$, and so on) and apply this until $a_n le 1$. This happens exactly when $n le log(t)/log(2)$ and $log(t)/log(2) le (n+1)$. Thus, we only need to apply the result $ log(t)$-times.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks! I think I got it.
    $endgroup$
    – GoldSoundz
    Dec 4 '18 at 20:59











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3026046%2fchapter-v-titchmarshs-book-the-theory-of-the-riemann-zeta-function%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









1












$begingroup$

You need to apply the result, as also stated in the book, multiple times: Take $b_n=t 2^{-n}$ and $a_n = t 2^{-(n+1)}$ (e.g. $b_0 =t$, $a_0 =t/2$, $b_1 =t/2$, $a_1 =t/4$, and so on) and apply this until $a_n le 1$. This happens exactly when $n le log(t)/log(2)$ and $log(t)/log(2) le (n+1)$. Thus, we only need to apply the result $ log(t)$-times.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks! I think I got it.
    $endgroup$
    – GoldSoundz
    Dec 4 '18 at 20:59
















1












$begingroup$

You need to apply the result, as also stated in the book, multiple times: Take $b_n=t 2^{-n}$ and $a_n = t 2^{-(n+1)}$ (e.g. $b_0 =t$, $a_0 =t/2$, $b_1 =t/2$, $a_1 =t/4$, and so on) and apply this until $a_n le 1$. This happens exactly when $n le log(t)/log(2)$ and $log(t)/log(2) le (n+1)$. Thus, we only need to apply the result $ log(t)$-times.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks! I think I got it.
    $endgroup$
    – GoldSoundz
    Dec 4 '18 at 20:59














1












1








1





$begingroup$

You need to apply the result, as also stated in the book, multiple times: Take $b_n=t 2^{-n}$ and $a_n = t 2^{-(n+1)}$ (e.g. $b_0 =t$, $a_0 =t/2$, $b_1 =t/2$, $a_1 =t/4$, and so on) and apply this until $a_n le 1$. This happens exactly when $n le log(t)/log(2)$ and $log(t)/log(2) le (n+1)$. Thus, we only need to apply the result $ log(t)$-times.






share|cite|improve this answer









$endgroup$



You need to apply the result, as also stated in the book, multiple times: Take $b_n=t 2^{-n}$ and $a_n = t 2^{-(n+1)}$ (e.g. $b_0 =t$, $a_0 =t/2$, $b_1 =t/2$, $a_1 =t/4$, and so on) and apply this until $a_n le 1$. This happens exactly when $n le log(t)/log(2)$ and $log(t)/log(2) le (n+1)$. Thus, we only need to apply the result $ log(t)$-times.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 4 '18 at 20:46









p4schp4sch

4,995217




4,995217












  • $begingroup$
    Thanks! I think I got it.
    $endgroup$
    – GoldSoundz
    Dec 4 '18 at 20:59


















  • $begingroup$
    Thanks! I think I got it.
    $endgroup$
    – GoldSoundz
    Dec 4 '18 at 20:59
















$begingroup$
Thanks! I think I got it.
$endgroup$
– GoldSoundz
Dec 4 '18 at 20:59




$begingroup$
Thanks! I think I got it.
$endgroup$
– GoldSoundz
Dec 4 '18 at 20:59


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3026046%2fchapter-v-titchmarshs-book-the-theory-of-the-riemann-zeta-function%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Aardman Animations

Are they similar matrix