:Determining Maximum Pool Sets Using Binomial Coefficients On Linux and Unix
Determining Maximum Pool Sets Using Binomial Coefficients On Linux and Unix Sep 9, 2008, 00 :01 UTC (0 Talkback[s]) (4300 reads) (Other stories by Mike Tremell)
"Our objective in this whole set of exercises, again is: Given a Number Pool of "x through y," create the maximum possible Fixed List Length variations of our Fixed List that contain some variation of our Guaranteed Combination, without any duplication (i.e. 1, 2, 3 is equal to 2, 3, 1 and would only count as one match), and return the results."
