Simplifying a product of a series
$begingroup$
I tried simplifying the product $$prod_{k=1}^{infty}left[1-x^kright]$$ by factoring it into $$prod_{k=1}^{infty}left[left(1-xright)sum_{i=0}^{k-1}x^iright].$$ I am not very experienced in solving complicated products , and couldn't seem to find any solving method on the internet. Is there any way of converting the above expression into a mere series and taking the limit, or is there a better way of approaching this problem?
EDIT: By solving I mean finding an expression for $x$ which is not in terms of a product.
algebra-precalculus products infinite-product
$endgroup$
add a comment |
$begingroup$
I tried simplifying the product $$prod_{k=1}^{infty}left[1-x^kright]$$ by factoring it into $$prod_{k=1}^{infty}left[left(1-xright)sum_{i=0}^{k-1}x^iright].$$ I am not very experienced in solving complicated products , and couldn't seem to find any solving method on the internet. Is there any way of converting the above expression into a mere series and taking the limit, or is there a better way of approaching this problem?
EDIT: By solving I mean finding an expression for $x$ which is not in terms of a product.
algebra-precalculus products infinite-product
$endgroup$
$begingroup$
What do you mean by solving? What kind of result do you expect?
$endgroup$
– Klaus
Jan 31 at 0:01
4
$begingroup$
You might be interested in the Pentagonal Number Theorem.
$endgroup$
– aleden
Jan 31 at 0:05
$begingroup$
The most compact result is $(x;x)_{infty }$ using Pochhammer symbols.
$endgroup$
– Claude Leibovici
Jan 31 at 5:40
add a comment |
$begingroup$
I tried simplifying the product $$prod_{k=1}^{infty}left[1-x^kright]$$ by factoring it into $$prod_{k=1}^{infty}left[left(1-xright)sum_{i=0}^{k-1}x^iright].$$ I am not very experienced in solving complicated products , and couldn't seem to find any solving method on the internet. Is there any way of converting the above expression into a mere series and taking the limit, or is there a better way of approaching this problem?
EDIT: By solving I mean finding an expression for $x$ which is not in terms of a product.
algebra-precalculus products infinite-product
$endgroup$
I tried simplifying the product $$prod_{k=1}^{infty}left[1-x^kright]$$ by factoring it into $$prod_{k=1}^{infty}left[left(1-xright)sum_{i=0}^{k-1}x^iright].$$ I am not very experienced in solving complicated products , and couldn't seem to find any solving method on the internet. Is there any way of converting the above expression into a mere series and taking the limit, or is there a better way of approaching this problem?
EDIT: By solving I mean finding an expression for $x$ which is not in terms of a product.
algebra-precalculus products infinite-product
algebra-precalculus products infinite-product
edited Jan 31 at 0:11
A. Lavie
asked Jan 30 at 23:54
A. LavieA. Lavie
274
274
$begingroup$
What do you mean by solving? What kind of result do you expect?
$endgroup$
– Klaus
Jan 31 at 0:01
4
$begingroup$
You might be interested in the Pentagonal Number Theorem.
$endgroup$
– aleden
Jan 31 at 0:05
$begingroup$
The most compact result is $(x;x)_{infty }$ using Pochhammer symbols.
$endgroup$
– Claude Leibovici
Jan 31 at 5:40
add a comment |
$begingroup$
What do you mean by solving? What kind of result do you expect?
$endgroup$
– Klaus
Jan 31 at 0:01
4
$begingroup$
You might be interested in the Pentagonal Number Theorem.
$endgroup$
– aleden
Jan 31 at 0:05
$begingroup$
The most compact result is $(x;x)_{infty }$ using Pochhammer symbols.
$endgroup$
– Claude Leibovici
Jan 31 at 5:40
$begingroup$
What do you mean by solving? What kind of result do you expect?
$endgroup$
– Klaus
Jan 31 at 0:01
$begingroup$
What do you mean by solving? What kind of result do you expect?
$endgroup$
– Klaus
Jan 31 at 0:01
4
4
$begingroup$
You might be interested in the Pentagonal Number Theorem.
$endgroup$
– aleden
Jan 31 at 0:05
$begingroup$
You might be interested in the Pentagonal Number Theorem.
$endgroup$
– aleden
Jan 31 at 0:05
$begingroup$
The most compact result is $(x;x)_{infty }$ using Pochhammer symbols.
$endgroup$
– Claude Leibovici
Jan 31 at 5:40
$begingroup$
The most compact result is $(x;x)_{infty }$ using Pochhammer symbols.
$endgroup$
– Claude Leibovici
Jan 31 at 5:40
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This product is related to partitions. I let Mathematica compute the first terms by actually doing the product. The result is
$$eqalign{f(x)&=1 - x - x^2 + x^5 + x^7 - x^{12} - x^{15} + x^{22} + x^{26}cr &quad - x^{35} - x^{40} +
x^{51} + x^{57} - x^{70} - x^{77} + x^{92} + x^{100}-ldotsquad.cr}$$
One quickly realizes that there is a law in the exponents. It leads to
$$f(x)=1+sum_{n=1}^infty (-1)^n(1+x^n) x^{(3n^2-n)/2} .$$
(This is not a proof. It just shows what hand computing would furnish in the end.)
$endgroup$
add a comment |
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%2f3094301%2fsimplifying-a-product-of-a-series%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$
This product is related to partitions. I let Mathematica compute the first terms by actually doing the product. The result is
$$eqalign{f(x)&=1 - x - x^2 + x^5 + x^7 - x^{12} - x^{15} + x^{22} + x^{26}cr &quad - x^{35} - x^{40} +
x^{51} + x^{57} - x^{70} - x^{77} + x^{92} + x^{100}-ldotsquad.cr}$$
One quickly realizes that there is a law in the exponents. It leads to
$$f(x)=1+sum_{n=1}^infty (-1)^n(1+x^n) x^{(3n^2-n)/2} .$$
(This is not a proof. It just shows what hand computing would furnish in the end.)
$endgroup$
add a comment |
$begingroup$
This product is related to partitions. I let Mathematica compute the first terms by actually doing the product. The result is
$$eqalign{f(x)&=1 - x - x^2 + x^5 + x^7 - x^{12} - x^{15} + x^{22} + x^{26}cr &quad - x^{35} - x^{40} +
x^{51} + x^{57} - x^{70} - x^{77} + x^{92} + x^{100}-ldotsquad.cr}$$
One quickly realizes that there is a law in the exponents. It leads to
$$f(x)=1+sum_{n=1}^infty (-1)^n(1+x^n) x^{(3n^2-n)/2} .$$
(This is not a proof. It just shows what hand computing would furnish in the end.)
$endgroup$
add a comment |
$begingroup$
This product is related to partitions. I let Mathematica compute the first terms by actually doing the product. The result is
$$eqalign{f(x)&=1 - x - x^2 + x^5 + x^7 - x^{12} - x^{15} + x^{22} + x^{26}cr &quad - x^{35} - x^{40} +
x^{51} + x^{57} - x^{70} - x^{77} + x^{92} + x^{100}-ldotsquad.cr}$$
One quickly realizes that there is a law in the exponents. It leads to
$$f(x)=1+sum_{n=1}^infty (-1)^n(1+x^n) x^{(3n^2-n)/2} .$$
(This is not a proof. It just shows what hand computing would furnish in the end.)
$endgroup$
This product is related to partitions. I let Mathematica compute the first terms by actually doing the product. The result is
$$eqalign{f(x)&=1 - x - x^2 + x^5 + x^7 - x^{12} - x^{15} + x^{22} + x^{26}cr &quad - x^{35} - x^{40} +
x^{51} + x^{57} - x^{70} - x^{77} + x^{92} + x^{100}-ldotsquad.cr}$$
One quickly realizes that there is a law in the exponents. It leads to
$$f(x)=1+sum_{n=1}^infty (-1)^n(1+x^n) x^{(3n^2-n)/2} .$$
(This is not a proof. It just shows what hand computing would furnish in the end.)
answered Jan 31 at 10:15


Christian BlatterChristian Blatter
176k8115327
176k8115327
add a comment |
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%2f3094301%2fsimplifying-a-product-of-a-series%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
$begingroup$
What do you mean by solving? What kind of result do you expect?
$endgroup$
– Klaus
Jan 31 at 0:01
4
$begingroup$
You might be interested in the Pentagonal Number Theorem.
$endgroup$
– aleden
Jan 31 at 0:05
$begingroup$
The most compact result is $(x;x)_{infty }$ using Pochhammer symbols.
$endgroup$
– Claude Leibovici
Jan 31 at 5:40