http://pear.php.net/bugs/search.php?cmd=display&package_name%5B0%5D=Math_Combinatorics Search Results en-us pear-webmaster@lists.php.net pear-webmaster@lists.php.net hourly 1 2000-01-01T12:00+00:00 http://pear.php.net/gifs/pearsmall.gif http://pear.php.net/bugs http://pear.php.net/bugs/16874 Math_Combinatorics Feature/Change Request Reported by ifeghali 2009-12-05T08:19:08+00:00 PHP: 5.3.0 OS: NA Package Version: 1.0.0 Description: ------------ It would be great to generate permutations with repetitions as well. For example: Given a set = [A, B, C] It's permutation, two by two is: P{2} = [A,B] [A,C] [B,A] [B,C] [C,A] [C,B] I propose a switch (function argument) that would make the output: PR{2} = [A,A] [A,B] [A,C] [B,A] [B,B] [B,C] [C,A] [C,B] [C,C] That would me able to specify a higher subset size. For the above example, currently the highest subset size possible is 3. With repetitions that number can be any positive integer. For example, it makes sense to have: PR{5} = [A,A,A,A,A] [A,A,A,A,B] ...]]> Math_Combinatorics Feature/Change Request Reported by ifeghali 2009-12-05T08:19:08+00:00 PHP: 5.3.0 OS: NA Package Version: 1.0.0 Description: ------------ It would be great to generate permutations with repetitions as well. For example: Given a set = [A, B, C] It's permutation, two by two is: P{2} = [A,B] [A,C] [B,A] [B,C] [C,A] [C,B] I propose a switch (function argument) that would make the output: PR{2} = [A,A] [A,B] [A,C] [B,A] [B,B] [B,C] [C,A] [C,B] [C,C] That would me able to specify a higher subset size. For the above example, currently the highest subset size possible is 3. With repetitions that number can be any positive integer. For example, it makes sense to have: PR{5} = [A,A,A,A,A] [A,A,A,A,B] ...]]> 2009-12-05T08:20:35+00:00 ifeghali at php dot net Math_Combinatorics Feature/Change Request