Timeline for Computing Permutations with Partial Duplicates
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15, 2011 at 1:03 | comment | added | dustin | That's off in just a couple of cases: pastebin.com/LUd8BMSR | |
| Sep 15, 2011 at 0:14 | history | edited | nullghost | CC BY-SA 3.0 |
edited body; added 6 characters in body
|
| Sep 15, 2011 at 0:08 | comment | added | nullghost | Okay, I missed the bit where you can only choose a number a maximum of D times. If D is greater than or equal to K, number of rows = N^K If D is less than K, number of rows should = N^K - N^(K-D) Test that for me, see if the results make sense. | |
| Sep 15, 2011 at 0:00 | comment | added | nullghost | I don't know why I was making this far too hard. D will not matter, because no matter what it is, it will get deduplicated. Since what you're doing is (n*d)Pk with deduplication, your result is just n^k. | |
| Sep 14, 2011 at 23:10 | comment | added | dustin | It's not deduplicated in the sense that the same item doesn't show up, but that the same sequence doesn't show up in the result. i.e. AAAB, AAAC, but not another AAAB where the As were rearranged. | |
| Sep 14, 2011 at 23:04 | history | answered | nullghost | CC BY-SA 3.0 |