Strange identity for 1?
Show that
product from i=1 to infinity of
(1+x^(2i))(1+x^(3i)) (1-x^(4i-2))(1-x^(6i-3))
= 1.
Notes: This is a formal product; don't worry about convergence issues. I have a solution, but I feel I may have missed a simpler one. There is a combinatorial interpretation in the background I can give if anyone is interested.
@Zsolt: Your proof by cases could probably use some rearranging for clarity, but your general approach seems sound and is similar to what I did. [Eg. for the n=2 mod 12 case, it's important to note that we cannot produce extra -n's besides the original -n, since they would have to come from n/2 and -n/2, yet n/2 is 1 or 7 mod 12 and canceling produces no such elements. It follows that we only need to deal with canceling the original n and -n, which we can do. You sort of said this, but I found your wording and order confusing.] I'd be happy to give my version if anyone is interested. I think it's a bit cleaner and briefer, though this is subjective.
The combinatorial interpretation is the following: the product of (1 x^(2i) x^(3i) x^(5i)) for i =1 is the ordinary generating function for the number of integer partitions of n with each part repeated exactly 2, 3, or 5 times. Note that (1 x^(2i))(1 x^(3i)) = 1 x^(2i) x^(3i) x^(5i). On the other hand, the product of 1/(1
[Wow, Y!A's typesetting has reached new lows. In addition to removing +'s, /'s, and >'s, and converting %20's in web addresses to spaces--thereby breaking links--it's now just cutting things off too. Let's try that last part again.]
The combinatorial interpretation is the following: the product of (1 + x^(2i) + x^(3i) + x^(5i)) for i>=1 is the ordinary generating function for the number A(n) of integer partitions of n with each part repeated exactly 2, 3, or 5 times. Note that (1 + x^(2i))(1 + x^(3i)) = 1 + x^(2i) + x^(3i) + x^(5i). On the other hand, the product of 1/(1-x^(2i)) 1/(1-x^(3i)) for i>=1 is the ordinary generating function for the number B(n) of integer partitions of n with each part congruent to 2 mod 4 or 3 mod 6. To see this, use the geometric series and look at which terms contribute to the nth coefficient.
The identity I gave can then be interpreted as just saying A(n) = B(n).
Wonderful, thanks Eugene, that's simpler than my solution and is probably as straightforward as it gets. I'll close this soon.