Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re(2): Pascal triange...

by gumby (Scribe)
on Jun 19, 2002 at 10:40 UTC ( #175615=note: print w/replies, xml ) Need Help??

in reply to Re: Pascal triange...
in thread Pascal's triangle...

Ok, it's been communicated that using the entropy function would provide a better approximation to nCr. So here is such a formula:

Let H(eps) := -eps.log_2(eps)-(1-eps)log_2(1-eps) be a binary entropy function.

Then binom(n, eps.n) is approximately equal to 2^(n.H(eps)).

Where eps is short for epsilon.

Update: Note that this uses the more common Stirling formula which is slightly less accurate as it truncates terms in the series (instead of approximating them like the formula i posted before).

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://175615]
and a kettle whistles...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (5)
As of 2018-03-17 19:36 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (225 votes). Check out past polls.