If subset size were known, you'd be counting the combinations.
Sadly, representing even three elements requires > 16 bits.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); } }
In reply to Re: coding question
by oiskuu
in thread coding question
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |