Ramanujan's congruence.
$begingroup$
There are the following formula in this link(https://en.wikipedia.org/wiki/Ramanujan%27s_congruences).
$$sum_{k=0}^{ infty } p(5k+4)q^k = 5 frac{(q^5)_{infty}^{5}}{(q)_{infty}^{6}}.$$
$$sum_{k=0}^{ infty } p(7k+5)q^k = 7 frac{(q^7)_{infty}^{3}}{(q)_{infty}^{4}} + 49q frac{(q^7)_{infty}^{7}}{(q)_{infty}^{8}}.$$
Srinivasa Ramanujan discovered the following congruences.
$$ p(11k+6) = 0 mod.11.$$
Do you know the formla of $sum_{k=0}^{ infty } p(11k+6)q^k $?
That is
$$sum_{k=0}^{ infty } p(11k+6)q^k = ???.$$
number-theory integer-partitions
$endgroup$
add a comment |
$begingroup$
There are the following formula in this link(https://en.wikipedia.org/wiki/Ramanujan%27s_congruences).
$$sum_{k=0}^{ infty } p(5k+4)q^k = 5 frac{(q^5)_{infty}^{5}}{(q)_{infty}^{6}}.$$
$$sum_{k=0}^{ infty } p(7k+5)q^k = 7 frac{(q^7)_{infty}^{3}}{(q)_{infty}^{4}} + 49q frac{(q^7)_{infty}^{7}}{(q)_{infty}^{8}}.$$
Srinivasa Ramanujan discovered the following congruences.
$$ p(11k+6) = 0 mod.11.$$
Do you know the formla of $sum_{k=0}^{ infty } p(11k+6)q^k $?
That is
$$sum_{k=0}^{ infty } p(11k+6)q^k = ???.$$
number-theory integer-partitions
$endgroup$
add a comment |
$begingroup$
There are the following formula in this link(https://en.wikipedia.org/wiki/Ramanujan%27s_congruences).
$$sum_{k=0}^{ infty } p(5k+4)q^k = 5 frac{(q^5)_{infty}^{5}}{(q)_{infty}^{6}}.$$
$$sum_{k=0}^{ infty } p(7k+5)q^k = 7 frac{(q^7)_{infty}^{3}}{(q)_{infty}^{4}} + 49q frac{(q^7)_{infty}^{7}}{(q)_{infty}^{8}}.$$
Srinivasa Ramanujan discovered the following congruences.
$$ p(11k+6) = 0 mod.11.$$
Do you know the formla of $sum_{k=0}^{ infty } p(11k+6)q^k $?
That is
$$sum_{k=0}^{ infty } p(11k+6)q^k = ???.$$
number-theory integer-partitions
$endgroup$
There are the following formula in this link(https://en.wikipedia.org/wiki/Ramanujan%27s_congruences).
$$sum_{k=0}^{ infty } p(5k+4)q^k = 5 frac{(q^5)_{infty}^{5}}{(q)_{infty}^{6}}.$$
$$sum_{k=0}^{ infty } p(7k+5)q^k = 7 frac{(q^7)_{infty}^{3}}{(q)_{infty}^{4}} + 49q frac{(q^7)_{infty}^{7}}{(q)_{infty}^{8}}.$$
Srinivasa Ramanujan discovered the following congruences.
$$ p(11k+6) = 0 mod.11.$$
Do you know the formla of $sum_{k=0}^{ infty } p(11k+6)q^k $?
That is
$$sum_{k=0}^{ infty } p(11k+6)q^k = ???.$$
number-theory integer-partitions
number-theory integer-partitions
edited Nov 13 '16 at 13:06
Manyama
asked Nov 13 '16 at 11:59
ManyamaManyama
5021415
5021415
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, a formula for the series $sum_{k=0}^{ infty } p(11k+6)q^k $, written as $sum_{n=1}^{ infty } p(11n-5)q^n$, can be found in the paper Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary by Bruce C. Berndt and Ken Ono, on page $39$, formula $(18.7)$:
$$
sum_{n=1}^{ infty } p(11n-5)q^n(q_{11};q_{11})_{infty}=11sigma_7(n)q^n+121J,
$$
which can be rewritten as you want, I suppose.
$endgroup$
$begingroup$
In the case of 5 and 7, there are the formula in the paper(Those are (4.7) and (8.3)). Are there the formula in the case of not 121 but 11?
$endgroup$
– Manyama
Nov 13 '16 at 13:01
1
$begingroup$
Berndt and Ono would have noted further nice formulas of this type, I suppose. So perhaps it is more complicated.
$endgroup$
– Dietrich Burde
Nov 13 '16 at 13:15
add a comment |
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%2f2011779%2framanujans-congruence%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
$begingroup$
Yes, a formula for the series $sum_{k=0}^{ infty } p(11k+6)q^k $, written as $sum_{n=1}^{ infty } p(11n-5)q^n$, can be found in the paper Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary by Bruce C. Berndt and Ken Ono, on page $39$, formula $(18.7)$:
$$
sum_{n=1}^{ infty } p(11n-5)q^n(q_{11};q_{11})_{infty}=11sigma_7(n)q^n+121J,
$$
which can be rewritten as you want, I suppose.
$endgroup$
$begingroup$
In the case of 5 and 7, there are the formula in the paper(Those are (4.7) and (8.3)). Are there the formula in the case of not 121 but 11?
$endgroup$
– Manyama
Nov 13 '16 at 13:01
1
$begingroup$
Berndt and Ono would have noted further nice formulas of this type, I suppose. So perhaps it is more complicated.
$endgroup$
– Dietrich Burde
Nov 13 '16 at 13:15
add a comment |
$begingroup$
Yes, a formula for the series $sum_{k=0}^{ infty } p(11k+6)q^k $, written as $sum_{n=1}^{ infty } p(11n-5)q^n$, can be found in the paper Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary by Bruce C. Berndt and Ken Ono, on page $39$, formula $(18.7)$:
$$
sum_{n=1}^{ infty } p(11n-5)q^n(q_{11};q_{11})_{infty}=11sigma_7(n)q^n+121J,
$$
which can be rewritten as you want, I suppose.
$endgroup$
$begingroup$
In the case of 5 and 7, there are the formula in the paper(Those are (4.7) and (8.3)). Are there the formula in the case of not 121 but 11?
$endgroup$
– Manyama
Nov 13 '16 at 13:01
1
$begingroup$
Berndt and Ono would have noted further nice formulas of this type, I suppose. So perhaps it is more complicated.
$endgroup$
– Dietrich Burde
Nov 13 '16 at 13:15
add a comment |
$begingroup$
Yes, a formula for the series $sum_{k=0}^{ infty } p(11k+6)q^k $, written as $sum_{n=1}^{ infty } p(11n-5)q^n$, can be found in the paper Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary by Bruce C. Berndt and Ken Ono, on page $39$, formula $(18.7)$:
$$
sum_{n=1}^{ infty } p(11n-5)q^n(q_{11};q_{11})_{infty}=11sigma_7(n)q^n+121J,
$$
which can be rewritten as you want, I suppose.
$endgroup$
Yes, a formula for the series $sum_{k=0}^{ infty } p(11k+6)q^k $, written as $sum_{n=1}^{ infty } p(11n-5)q^n$, can be found in the paper Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary by Bruce C. Berndt and Ken Ono, on page $39$, formula $(18.7)$:
$$
sum_{n=1}^{ infty } p(11n-5)q^n(q_{11};q_{11})_{infty}=11sigma_7(n)q^n+121J,
$$
which can be rewritten as you want, I suppose.
edited Jan 29 at 10:01
MichalisN
4,6071327
4,6071327
answered Nov 13 '16 at 12:30
Dietrich BurdeDietrich Burde
81.6k648106
81.6k648106
$begingroup$
In the case of 5 and 7, there are the formula in the paper(Those are (4.7) and (8.3)). Are there the formula in the case of not 121 but 11?
$endgroup$
– Manyama
Nov 13 '16 at 13:01
1
$begingroup$
Berndt and Ono would have noted further nice formulas of this type, I suppose. So perhaps it is more complicated.
$endgroup$
– Dietrich Burde
Nov 13 '16 at 13:15
add a comment |
$begingroup$
In the case of 5 and 7, there are the formula in the paper(Those are (4.7) and (8.3)). Are there the formula in the case of not 121 but 11?
$endgroup$
– Manyama
Nov 13 '16 at 13:01
1
$begingroup$
Berndt and Ono would have noted further nice formulas of this type, I suppose. So perhaps it is more complicated.
$endgroup$
– Dietrich Burde
Nov 13 '16 at 13:15
$begingroup$
In the case of 5 and 7, there are the formula in the paper(Those are (4.7) and (8.3)). Are there the formula in the case of not 121 but 11?
$endgroup$
– Manyama
Nov 13 '16 at 13:01
$begingroup$
In the case of 5 and 7, there are the formula in the paper(Those are (4.7) and (8.3)). Are there the formula in the case of not 121 but 11?
$endgroup$
– Manyama
Nov 13 '16 at 13:01
1
1
$begingroup$
Berndt and Ono would have noted further nice formulas of this type, I suppose. So perhaps it is more complicated.
$endgroup$
– Dietrich Burde
Nov 13 '16 at 13:15
$begingroup$
Berndt and Ono would have noted further nice formulas of this type, I suppose. So perhaps it is more complicated.
$endgroup$
– Dietrich Burde
Nov 13 '16 at 13:15
add a comment |
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%2f2011779%2framanujans-congruence%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