Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^3: Algorithm for cancelling common factors between two lists of multiplicands

by QM (Parson)
on Aug 09, 2005 at 15:19 UTC ( #482242=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    sub n_choose_k {
      my ($n, $k) = @_;
      # f($n) = $n!
      return f($n)/f($k)/f($n-$k);
    }
    
  2. or download this
    sub n_choose_k {
      my ($n, $k) = @_;
    ...
      }
      return $t;
    }
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (9)
As of 2019-10-23 21:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?