Re: what is coefficients of expanding (1+x+x^2+....+x^k)^n?

From: Phil Carmody (thefatphil_demunged_at_yahoo.co.uk)
Date: 07/06/04


Date: 06 Jul 2004 19:01:40 +0300

zhora@univ.kiev-dot-ua.no-spam.invalid (zhora) writes:

> > L.P.wrote:
> The formulae is well known for k=2,3,4,5..-binomial, trinomial,
> > quadromial , hexanomial numbers..What is general fornulae for
> > arbitrary k???
> If you mean x^k "x to the power k", then the coefficient before x^j in
> your expansion is equal to the number of non-negative integer
> solutions to the equation j_1+...+j_k=j, the last number equals to
> the binomial coefficient ((k+j-1)c(k-1)).

That doesn't depend on n.

Phil

-- 
1st bug in MS win2k source code found after 20 minutes: scanline.cpp
2nd and 3rd bug found after 10 more minutes: gethost.c
Both non-exploitable. (The 2nd/3rd ones might be, depending on the CRTL)


Relevant Pages

  • Re: Nth Prime
    ... > expend all that energy working for them on some futile ... > Did you ever check to see whether a reasonable compiler ... Phil ... 1st bug in MS win2k source code found after 20 minutes: ...
    (alt.lang.asm)
  • SSE2 int/fp query - MOVHPD
    ... Is there any reason I can't move an arbitrary 64-bit _integral_ ... value, rather than FP, using this instruction? ... Phil ... 1st bug in MS win2k source code found after 20 minutes: ...
    (alt.lang.asm)
  • Re: Linux partitions
    ... > Thanks Phil, ... > This is exactly what I searched for, and it's in my preferred format too. ... 1st bug in MS win2k source code found after 20 minutes: ...
    (alt.lang.asm)
  • Re: ASM vs HLL : absurd war
    ... > The compiled EXE file is 2,560 bytes in size. ... would assemble to? ... Phil ... 1st bug in MS win2k source code found after 20 minutes: ...
    (alt.lang.asm)
  • Re: Why There are no Asm Apps
    ... and I refuse to share it with the French! ... Phil ... 1st bug in MS win2k source code found after 20 minutes: ...
    (alt.lang.asm)