Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with combinatorics
Search options answers only
not deleted
user 57495
Questions on the use of Mathematica in combinatorics, including the Combinatorica add-on package.
0
votes
Permutations with subsets not containing the same elements
Here is one possible solution:
perm[set_List, k_Integer] := If[Length[set]<2k,
List/@Subsets[set,{k}],
Flatten[
Function[s,Prepend[#,s]&/@perm[Complement[
Drop[set,First@FirstPosition[set …
- 926
7
votes
Accepted
Help with a very ugly piece of code
You can use MapThread like this:
elementos = {Red, Blue, Green, Orange, Black};
permutaciones = Permutations[elementos];
desarreglos = Select[permutaciones,And @@ MapThread[Not@*Equal, {elementos, #}] …
- 926