#solution
58 messages ยท Page 1 of 1 (latest)
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close - Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
Anyone???
general hint
if you wanna solve x+y=N you have solutions like (0,N), (1,N-1), (2,N-2) etc
how many are there?
for x+y+2z = 33, fix a possible value of z and solve x+y = 33-2z as before
e.g z=0 has you solve x+y=33, z=1 x+y=31 etc
@tulip coral
when z=1
So i am getting sum
34+32+30+28+.....0
there are a million formulas
Max z is 16
when is this formula true?
x+y+z=33
Then it is true i guess
33+3-1C2
35C2
2+4+6+8+....34
I got 306
@distant nimbus
Stop laughing please ๐ญ๐๐๐๐๐
if it is true, then prove it
the formula you were talking aboutรค
No formula doesn't work here. It works only for the i guess
Let me count it and check
306 is correct?
@distant nimbus
Formula works fine here
Bro see
@distant nimbus
the coefficient of v^33 in the expansion of 1/[(1-v)^2 (1-v^2)] near 0
$\underbrace{(v^0+v^1+v^2+\ldots)}{x} \underbrace{(v^0+v^1+v^2+\ldots)}{y}\underbrace{(v^0+v^2+v^4+\ldots)}_{z}$
Heavily cooked
Interesting
Where did you get the idea?
from the problem
I saw a same comment on math exchange
gfs are very common in this territory
gfs?
generating functions
The number of non negative integer solutions to ax_1 + bx_2 + cx_3 +... = n where a, b, c,... are integers is the coefficient of x^n in 1/[(1-x^a)(1-x^b)(1-x^c)...]
if a_1, a_2,...,a_k are coprime then the number of solutions to a_1 x_1 +...+ a_k x_k = n is ~ k^n/[(n-1)!a_1 a_2...a_k]
it helps if n is huge
+close