Help with a recursive equation

From: KP <silverphoenix.kp@xxxxxxxxx>
Date: Sat, 30 Jun 2007 01:43:00 -0700

Hi,

I derived this recursive equation myself when I was trying to come
up with a general equation for the sum of all binary numbers having
"n" digits with m 1's in them.

Let S(n,m) denote the sum I wish to find.

My recursion is

S(n,m) = S(n-1,m) + (2^(n-1))* C(n-1,m-1) + S(n-1,m-1)

where ^ denotes "raised to the power of"

Could somebody give me any pointers or links that could help in
solving this?

Thanks in advance,

KP

.

Follow-Ups:
- Re: Help with a recursive equation
  - From: mensanator@xxxxxxxxxxx

Prev by Date: Re: to JSH and all : tommy's prime factoring tricks
Next by Date: Re: Mathematicians are trained to think and prove theorems. Physicists are trained to imitate chimpanzees.
Previous by thread: A method for an infinite sum of finite powertowers
Next by thread: Re: Help with a recursive equation
Index(es):
- Date
- Thread

Relevant Pages

Re: Exact sequence
... Gmath wrote: ... interger modulo n and + denote the direct sum.?? ...
(sci.math)
Sums of RV, Convolution plots
... My goal is to visualize the sum of iid random variables which I denote L_i. ... Given that I only have the pdf, this is all done in MATLAB using covolutions. ...
(comp.soft-sys.matlab)
Re: what is this equal to
... > Let C_N^i denote choose i out of N ... the known sum should start at 0: ... Don Coppersmith ... Prev by Date: ...
(sci.math)
Re: Exact sequence
... interger modulo n and + denote the direct sum.?? ... isomorphic image of Z_9. ...
(sci.math)
Re: question on variation of subset sum problem
... Reduce subset sum problem with sum b to this problem with k = X + b. ... The correct reduction will be: ... Here I am using N instead of X which denote the sum of all elements of ...
(comp.theory)