Mixing
Proving that $sum_{n = 1}^{infty} frac{1}{n^s} = prod_{k=1}^{infty}frac{1}{1-p_k^{-s}}$
$begingroup$
Could you please have a look at my solution of the following exercise?
Show that for $s>1$ holds
$$sum_{n = 1}^{infty} frac{1}{n^s} = prod_{k=1}^{infty}frac{1}{1-p_k^{-s}}$$
where $(p_k)_k$ is the increasing sequence of primes.
I came up with the following solution:
At first we note that
$$prod_{k=1}^{infty}frac{1}{1-p_k^{-s}} = prod_{k=1}^{infty} frac{p_k^s}{p_k^s-1} = prod_{k=1}^{infty} biggl( sum_{j=0}^{infty} frac{1}{p_k^{s cdot j}}biggr)$$
Now we show both $ge$ and $le$:
$ge:$
$$prod_{k=1}^{N}frac{1}{1-p_k^{-s}} = prod_{k=1}^{N} frac{p_k^s}{p_k^s-1} $$
To make things easier we take care that the exponents are natural numbers
$$le prod_{k=1}^{N} frac{p_k^{lceil s rceil}}{p_k^{lfloor s rfloor -1}}$$
For fitting natural numbers $A,B$ we may write
$$ = frac{A}{B} = sum_{n=1}^{A} frac{1}{B} $$
And since $A ge B$
$$le sum_{n=1}^{A} frac{1}{n}$$
$le:$
We make the observation that in the result of the multiplication
$$biggl( sum_{i=0}^{a} frac{1}{p_1^i} biggr) cdot biggl( sum_{j=0}^{b} frac{1}{p_2^j}biggr) = sum_{i=0}^{a} sum_{j=0}^{b} frac{1}{p_1^i cdot p_2^j} $$
each combination of powers of $p_1$ and $p_2$ up to $p_1^a$ and $p_2^b$ appears exactly once in the denomiators on the right side above. By generalising this and remembering about the fundametal theorem of arithmetic we obtain:
$$sum_{n = 1}^{N} frac{1}{n^s} = prod_{k=1}^{A} biggl( sum_{j=0}^{B} frac{1}{p_k^{s cdot j}}biggr) $$
for some natural numbers $A$ and $B$ and further:
$$le prod_{k=1}^{A} biggl( sum_{j=0}^{infty} frac{1}{p_k^{s cdot j}}biggr) = prod_{k=1}^{A} frac{p_k^s}{p_k^s-1} le prod_{k=1}^{infty} frac{p_k^s}{p_k^s-1}$$
Is this correct and if yes, could you tell me where exactly we need that $s>1$; I do not see why this is required.
sequences-and-series number-theory
edited Jan 6 at 16:53
J.G.
24.8k22539
asked Jan 6 at 16:47
3nondatur3nondatur
387111
$endgroup$
add a comment |
$begingroup$
Could you please have a look at my solution of the following exercise?
Show that for $s>1$ holds
$$sum_{n = 1}^{infty} frac{1}{n^s} = prod_{k=1}^{infty}frac{1}{1-p_k^{-s}}$$
where $(p_k)_k$ is the increasing sequence of primes.
I came up with the following solution:
At first we note that
$$prod_{k=1}^{infty}frac{1}{1-p_k^{-s}} = prod_{k=1}^{infty} frac{p_k^s}{p_k^s-1} = prod_{k=1}^{infty} biggl( sum_{j=0}^{infty} frac{1}{p_k^{s cdot j}}biggr)$$
Now we show both $ge$ and $le$:
$ge:$
$$prod_{k=1}^{N}frac{1}{1-p_k^{-s}} = prod_{k=1}^{N} frac{p_k^s}{p_k^s-1} $$
To make things easier we take care that the exponents are natural numbers
$$le prod_{k=1}^{N} frac{p_k^{lceil s rceil}}{p_k^{lfloor s rfloor -1}}$$
For fitting natural numbers $A,B$ we may write
$$ = frac{A}{B} = sum_{n=1}^{A} frac{1}{B} $$
And since $A ge B$
$$le sum_{n=1}^{A} frac{1}{n}$$
$le:$
We make the observation that in the result of the multiplication
$$biggl( sum_{i=0}^{a} frac{1}{p_1^i} biggr) cdot biggl( sum_{j=0}^{b} frac{1}{p_2^j}biggr) = sum_{i=0}^{a} sum_{j=0}^{b} frac{1}{p_1^i cdot p_2^j} $$
each combination of powers of $p_1$ and $p_2$ up to $p_1^a$ and $p_2^b$ appears exactly once in the denomiators on the right side above. By generalising this and remembering about the fundametal theorem of arithmetic we obtain:
$$sum_{n = 1}^{N} frac{1}{n^s} = prod_{k=1}^{A} biggl( sum_{j=0}^{B} frac{1}{p_k^{s cdot j}}biggr) $$
for some natural numbers $A$ and $B$ and further:
$$le prod_{k=1}^{A} biggl( sum_{j=0}^{infty} frac{1}{p_k^{s cdot j}}biggr) = prod_{k=1}^{A} frac{p_k^s}{p_k^s-1} le prod_{k=1}^{infty} frac{p_k^s}{p_k^s-1}$$
Is this correct and if yes, could you tell me where exactly we need that $s>1$; I do not see why this is required.
sequences-and-series number-theory
edited Jan 6 at 16:53
J.G.
24.8k22539
asked Jan 6 at 16:47
3nondatur3nondatur
387111
$endgroup$
1
$begingroup$
Let $A_K$ be the set of integers whose prime factors are all $le p_K$. Then for $s > 0$, $prod_{k=1}^K frac{1}{1-p_k^{-s}} = prod_{k=1}^K (1+ sum_{j=1}^infty (p_k^j)^{-s}) = sum_{n in A_K} n^{-s}$. For $s > 1$ then $sum_{n=1}^infty n^{-s} - prod_{k=1}^K frac{1}{1-p_k^{-s}}=sum_{n not in A_K}n^{-s}le sum_{n=P_K+1}^infty n^{-s}$ whence $lim_{K to infty}sum_{n=1}^infty n^{-s}-prod_{k=1}^Kfrac{1}{1-p_k^{-s}} = 0$. For $sin (0,1]$ then $lim_{K to infty}prod_{k=1}^Kfrac{1}{1-p_k^{-s}}=lim_{K to infty}sum_{nin A_K}n^{-s}=sum_{n=1}^infty n^{-s}= infty$
$endgroup$
– reuns
Jan 6 at 17:36
2
$begingroup$
"could you tell me where exactly we need that $s>1$" Actually, we do not. When $sleqslant1$, the identity in the question holds as well, but it reads $infty=infty$.
$endgroup$
– Did
Jan 6 at 17:54
add a comment |
$begingroup$
Could you please have a look at my solution of the following exercise?
Show that for $s>1$ holds
$$sum_{n = 1}^{infty} frac{1}{n^s} = prod_{k=1}^{infty}frac{1}{1-p_k^{-s}}$$
where $(p_k)_k$ is the increasing sequence of primes.
I came up with the following solution:
At first we note that
$$prod_{k=1}^{infty}frac{1}{1-p_k^{-s}} = prod_{k=1}^{infty} frac{p_k^s}{p_k^s-1} = prod_{k=1}^{infty} biggl( sum_{j=0}^{infty} frac{1}{p_k^{s cdot j}}biggr)$$
Now we show both $ge$ and $le$:
$ge:$
$$prod_{k=1}^{N}frac{1}{1-p_k^{-s}} = prod_{k=1}^{N} frac{p_k^s}{p_k^s-1} $$
To make things easier we take care that the exponents are natural numbers
$$le prod_{k=1}^{N} frac{p_k^{lceil s rceil}}{p_k^{lfloor s rfloor -1}}$$
For fitting natural numbers $A,B$ we may write
$$ = frac{A}{B} = sum_{n=1}^{A} frac{1}{B} $$
And since $A ge B$
$$le sum_{n=1}^{A} frac{1}{n}$$
$le:$
We make the observation that in the result of the multiplication
$$biggl( sum_{i=0}^{a} frac{1}{p_1^i} biggr) cdot biggl( sum_{j=0}^{b} frac{1}{p_2^j}biggr) = sum_{i=0}^{a} sum_{j=0}^{b} frac{1}{p_1^i cdot p_2^j} $$
each combination of powers of $p_1$ and $p_2$ up to $p_1^a$ and $p_2^b$ appears exactly once in the denomiators on the right side above. By generalising this and remembering about the fundametal theorem of arithmetic we obtain:
$$sum_{n = 1}^{N} frac{1}{n^s} = prod_{k=1}^{A} biggl( sum_{j=0}^{B} frac{1}{p_k^{s cdot j}}biggr) $$
for some natural numbers $A$ and $B$ and further:
$$le prod_{k=1}^{A} biggl( sum_{j=0}^{infty} frac{1}{p_k^{s cdot j}}biggr) = prod_{k=1}^{A} frac{p_k^s}{p_k^s-1} le prod_{k=1}^{infty} frac{p_k^s}{p_k^s-1}$$
Is this correct and if yes, could you tell me where exactly we need that $s>1$; I do not see why this is required.
sequences-and-series number-theory
edited Jan 6 at 16:53
J.G.
24.8k22539
asked Jan 6 at 16:47
3nondatur3nondatur
387111
$endgroup$
Could you please have a look at my solution of the following exercise?
Show that for $s>1$ holds
$$sum_{n = 1}^{infty} frac{1}{n^s} = prod_{k=1}^{infty}frac{1}{1-p_k^{-s}}$$
where $(p_k)_k$ is the increasing sequence of primes.
I came up with the following solution:
At first we note that
$$prod_{k=1}^{infty}frac{1}{1-p_k^{-s}} = prod_{k=1}^{infty} frac{p_k^s}{p_k^s-1} = prod_{k=1}^{infty} biggl( sum_{j=0}^{infty} frac{1}{p_k^{s cdot j}}biggr)$$
Now we show both $ge$ and $le$:
$ge:$
$$prod_{k=1}^{N}frac{1}{1-p_k^{-s}} = prod_{k=1}^{N} frac{p_k^s}{p_k^s-1} $$
To make things easier we take care that the exponents are natural numbers
$$le prod_{k=1}^{N} frac{p_k^{lceil s rceil}}{p_k^{lfloor s rfloor -1}}$$
For fitting natural numbers $A,B$ we may write
$$ = frac{A}{B} = sum_{n=1}^{A} frac{1}{B} $$
And since $A ge B$
$$le sum_{n=1}^{A} frac{1}{n}$$
$le:$
We make the observation that in the result of the multiplication
$$biggl( sum_{i=0}^{a} frac{1}{p_1^i} biggr) cdot biggl( sum_{j=0}^{b} frac{1}{p_2^j}biggr) = sum_{i=0}^{a} sum_{j=0}^{b} frac{1}{p_1^i cdot p_2^j} $$
each combination of powers of $p_1$ and $p_2$ up to $p_1^a$ and $p_2^b$ appears exactly once in the denomiators on the right side above. By generalising this and remembering about the fundametal theorem of arithmetic we obtain:
$$sum_{n = 1}^{N} frac{1}{n^s} = prod_{k=1}^{A} biggl( sum_{j=0}^{B} frac{1}{p_k^{s cdot j}}biggr) $$
for some natural numbers $A$ and $B$ and further:
$$le prod_{k=1}^{A} biggl( sum_{j=0}^{infty} frac{1}{p_k^{s cdot j}}biggr) = prod_{k=1}^{A} frac{p_k^s}{p_k^s-1} le prod_{k=1}^{infty} frac{p_k^s}{p_k^s-1}$$
Is this correct and if yes, could you tell me where exactly we need that $s>1$; I do not see why this is required.
sequences-and-series number-theory
sequences-and-series number-theory
edited Jan 6 at 16:53
J.G.
24.8k22539
asked Jan 6 at 16:47
3nondatur3nondatur
387111
edited Jan 6 at 16:53
J.G.
24.8k22539
asked Jan 6 at 16:47
3nondatur3nondatur
387111
edited Jan 6 at 16:53
J.G.
24.8k22539
edited Jan 6 at 16:53
J.G.
24.8k22539
edited Jan 6 at 16:53
J.G.
24.8k22539
24.8k22539
asked Jan 6 at 16:47
3nondatur3nondatur
387111
asked Jan 6 at 16:47
3nondatur3nondatur
387111
asked Jan 6 at 16:47
3nondatur3nondatur
387111
387111
1
$begingroup$
Let $A_K$ be the set of integers whose prime factors are all $le p_K$. Then for $s > 0$, $prod_{k=1}^K frac{1}{1-p_k^{-s}} = prod_{k=1}^K (1+ sum_{j=1}^infty (p_k^j)^{-s}) = sum_{n in A_K} n^{-s}$. For $s > 1$ then $sum_{n=1}^infty n^{-s} - prod_{k=1}^K frac{1}{1-p_k^{-s}}=sum_{n not in A_K}n^{-s}le sum_{n=P_K+1}^infty n^{-s}$ whence $lim_{K to infty}sum_{n=1}^infty n^{-s}-prod_{k=1}^Kfrac{1}{1-p_k^{-s}} = 0$. For $sin (0,1]$ then $lim_{K to infty}prod_{k=1}^Kfrac{1}{1-p_k^{-s}}=lim_{K to infty}sum_{nin A_K}n^{-s}=sum_{n=1}^infty n^{-s}= infty$
$endgroup$
– reuns
Jan 6 at 17:36
2
$begingroup$
"could you tell me where exactly we need that $s>1$" Actually, we do not. When $sleqslant1$, the identity in the question holds as well, but it reads $infty=infty$.
$endgroup$
– Did
Jan 6 at 17:54
add a comment |
1
$begingroup$
Let $A_K$ be the set of integers whose prime factors are all $le p_K$. Then for $s > 0$, $prod_{k=1}^K frac{1}{1-p_k^{-s}} = prod_{k=1}^K (1+ sum_{j=1}^infty (p_k^j)^{-s}) = sum_{n in A_K} n^{-s}$. For $s > 1$ then $sum_{n=1}^infty n^{-s} - prod_{k=1}^K frac{1}{1-p_k^{-s}}=sum_{n not in A_K}n^{-s}le sum_{n=P_K+1}^infty n^{-s}$ whence $lim_{K to infty}sum_{n=1}^infty n^{-s}-prod_{k=1}^Kfrac{1}{1-p_k^{-s}} = 0$. For $sin (0,1]$ then $lim_{K to infty}prod_{k=1}^Kfrac{1}{1-p_k^{-s}}=lim_{K to infty}sum_{nin A_K}n^{-s}=sum_{n=1}^infty n^{-s}= infty$
$endgroup$
– reuns
Jan 6 at 17:36
2
$begingroup$
"could you tell me where exactly we need that $s>1$" Actually, we do not. When $sleqslant1$, the identity in the question holds as well, but it reads $infty=infty$.
$endgroup$
– Did
Jan 6 at 17:54
1
1
$begingroup$
Let $A_K$ be the set of integers whose prime factors are all $le p_K$. Then for $s > 0$, $prod_{k=1}^K frac{1}{1-p_k^{-s}} = prod_{k=1}^K (1+ sum_{j=1}^infty (p_k^j)^{-s}) = sum_{n in A_K} n^{-s}$. For $s > 1$ then $sum_{n=1}^infty n^{-s} - prod_{k=1}^K frac{1}{1-p_k^{-s}}=sum_{n not in A_K}n^{-s}le sum_{n=P_K+1}^infty n^{-s}$ whence $lim_{K to infty}sum_{n=1}^infty n^{-s}-prod_{k=1}^Kfrac{1}{1-p_k^{-s}} = 0$. For $sin (0,1]$ then $lim_{K to infty}prod_{k=1}^Kfrac{1}{1-p_k^{-s}}=lim_{K to infty}sum_{nin A_K}n^{-s}=sum_{n=1}^infty n^{-s}= infty$
$endgroup$
– reuns
Jan 6 at 17:36
$begingroup$
Let $A_K$ be the set of integers whose prime factors are all $le p_K$. Then for $s > 0$, $prod_{k=1}^K frac{1}{1-p_k^{-s}} = prod_{k=1}^K (1+ sum_{j=1}^infty (p_k^j)^{-s}) = sum_{n in A_K} n^{-s}$. For $s > 1$ then $sum_{n=1}^infty n^{-s} - prod_{k=1}^K frac{1}{1-p_k^{-s}}=sum_{n not in A_K}n^{-s}le sum_{n=P_K+1}^infty n^{-s}$ whence $lim_{K to infty}sum_{n=1}^infty n^{-s}-prod_{k=1}^Kfrac{1}{1-p_k^{-s}} = 0$. For $sin (0,1]$ then $lim_{K to infty}prod_{k=1}^Kfrac{1}{1-p_k^{-s}}=lim_{K to infty}sum_{nin A_K}n^{-s}=sum_{n=1}^infty n^{-s}= infty$
$endgroup$
– reuns
Jan 6 at 17:36
2
2
$begingroup$
"could you tell me where exactly we need that $s>1$" Actually, we do not. When $sleqslant1$, the identity in the question holds as well, but it reads $infty=infty$.
$endgroup$
– Did
Jan 6 at 17:54
$begingroup$
"could you tell me where exactly we need that $s>1$" Actually, we do not. When $sleqslant1$, the identity in the question holds as well, but it reads $infty=infty$.
$endgroup$
– Did
Jan 6 at 17:54
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%2f3064099%2fproving-that-sum-n-1-infty-frac1ns-prod-k-1-infty-frac1%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%2f3064099%2fproving-that-sum-n-1-infty-frac1ns-prod-k-1-infty-frac1%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
1
$begingroup$
Let $A_K$ be the set of integers whose prime factors are all $le p_K$. Then for $s > 0$, $prod_{k=1}^K frac{1}{1-p_k^{-s}} = prod_{k=1}^K (1+ sum_{j=1}^infty (p_k^j)^{-s}) = sum_{n in A_K} n^{-s}$. For $s > 1$ then $sum_{n=1}^infty n^{-s} - prod_{k=1}^K frac{1}{1-p_k^{-s}}=sum_{n not in A_K}n^{-s}le sum_{n=P_K+1}^infty n^{-s}$ whence $lim_{K to infty}sum_{n=1}^infty n^{-s}-prod_{k=1}^Kfrac{1}{1-p_k^{-s}} = 0$. For $sin (0,1]$ then $lim_{K to infty}prod_{k=1}^Kfrac{1}{1-p_k^{-s}}=lim_{K to infty}sum_{nin A_K}n^{-s}=sum_{n=1}^infty n^{-s}= infty$
$endgroup$
– reuns
Jan 6 at 17:36
2
$begingroup$
"could you tell me where exactly we need that $s>1$" Actually, we do not. When $sleqslant1$, the identity in the question holds as well, but it reads $infty=infty$.
$endgroup$
– Did
Jan 6 at 17:54