Determining Maximum Pool Sets Using Binomial Coefficients On Linux and Unix

[ Thanks to Mike Golvach for this link. ]

"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."

Complete Story

Related Stories:

• Unique Sorting Of Lists And Lists Of Lists With Perl For Linux Or Unix(Sep 06, 2008)
• Lists vs. Strings: Perl List Permutations For Linux Or Unix(Sep 03, 2008)
• More Funny Unix, Linux and Mainframe Error Messages(Aug 31, 2008)
• The Upside Down Of HTML On Unix and Linux: Backward(Aug 29, 2008)
• Displaying System Information On Linux or Unix With Cfg2html(Aug 24, 2008)
• More Weekend Humor Of The Linux and Unix Variety(Aug 23, 2008)