Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: coding question

by oiskuu (Hermit)
on Jan 04, 2014 at 19:46 UTC ( #1069312=note: print w/ replies, xml ) Need Help??


in reply to coding question

If subset size were known, you'd be counting the combinations.

for my $n (100) { for my $m (1..100) { my $i = 1; $i *= ($n+1-$_)/$_ for 1..$m; printf "C($m,$n) = $i (%.3f bits)\n", log($i)/log(2); } }
Sadly, representing even three elements requires > 16 bits.

Comment on Re: coding question
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1069312]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (4)
As of 2016-04-30 00:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    :nehw tseb si esrever ni gnitirW







    Results (441 votes). Check out past polls.