Create all possible words using a set or lettersFinding all length-n words on an alphabet that have a specified number of each letterFinding all dictionary words that can be made with a given set of characters (Wordfeud/Scrabble)How to enumerate all possible binary associations?Sorting an Array with words in different languagesUsing StringCases and treating certain phrases as single wordsGraph showing valid English words obtained by insertion of single charactersTrim a list of elementsList all possible microstates and corresponding energy using mathematica.Selecting words having a specific number of letters from a textSelecting elements using two lists
Did arcade monitors have same pixel aspect ratio as TV sets?
What is the evidence for the "tyranny of the majority problem" in a direct democracy context?
Is this toilet slogan correct usage of the English language?
Why does the Sun have different day lengths, but not the gas giants?
Store Credit Card Information in Password Manager?
On a tidally locked planet, would time be quantized?
How to explain what's wrong with this application of the chain rule?
Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?
250 Floor Tower
It grows, but water kills it
What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?
Start making guitar arrangements
Should I outline or discovery write my stories?
How do I color the graph in datavisualization?
What should you do when eye contact makes your subordinate uncomfortable?
Are paving bricks differently sized for sand bedding vs mortar bedding?
Why can Carol Danvers change her suit colours in the first place?
Is it safe to use olive oil to clean the ear wax?
Drawing ramified coverings with tikz
Is there a name for this algorithm to calculate the concentration of a mixture of two solutions containing the same solute?
What does chmod -u do?
Existing of non-intersecting rays
Yosemite Fire Rings - What to Expect?
How should I respond when I lied about my education and the company finds out through background check?
Create all possible words using a set or letters
Finding all length-n words on an alphabet that have a specified number of each letterFinding all dictionary words that can be made with a given set of characters (Wordfeud/Scrabble)How to enumerate all possible binary associations?Sorting an Array with words in different languagesUsing StringCases and treating certain phrases as single wordsGraph showing valid English words obtained by insertion of single charactersTrim a list of elementsList all possible microstates and corresponding energy using mathematica.Selecting words having a specific number of letters from a textSelecting elements using two lists
$begingroup$
Given a list of letters,
letters = "A", "B", ..., "F"
is it possible to get Mathematica to generate all ‘words’ (in this example, 6 letter words), if only one letter can be used one time only, e.g. ABCDEF, ABCDFE, …? TIA.
string-manipulation combinatorics
$endgroup$
add a comment |
$begingroup$
Given a list of letters,
letters = "A", "B", ..., "F"
is it possible to get Mathematica to generate all ‘words’ (in this example, 6 letter words), if only one letter can be used one time only, e.g. ABCDEF, ABCDFE, …? TIA.
string-manipulation combinatorics
$endgroup$
add a comment |
$begingroup$
Given a list of letters,
letters = "A", "B", ..., "F"
is it possible to get Mathematica to generate all ‘words’ (in this example, 6 letter words), if only one letter can be used one time only, e.g. ABCDEF, ABCDFE, …? TIA.
string-manipulation combinatorics
$endgroup$
Given a list of letters,
letters = "A", "B", ..., "F"
is it possible to get Mathematica to generate all ‘words’ (in this example, 6 letter words), if only one letter can be used one time only, e.g. ABCDEF, ABCDFE, …? TIA.
string-manipulation combinatorics
string-manipulation combinatorics
edited 1 hour ago
J. M. is slightly pensive♦
98.3k10306466
98.3k10306466
asked 1 hour ago
mf67mf67
975
975
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You can create permutations with all of the letters as strings with:
StringJoin /@ Permutations[letters]
If you want lists of the individual letters just use:
Permutations[letters]
Check the documentation of Permutations to learn about permutations with subsets of letters. If you want to use each letter more than once, look at the documentation for Tuples.
$endgroup$
add a comment |
$begingroup$
Pemutations will do it:
letters = "a", "b", "c";
Permutations[letters, 3]
"a", "b", "c", "a", "c", "b", "b", "a", "c",
"b", "c", "a", "c", "a", "b", "c", "b", "a"
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "387"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f193857%2fcreate-all-possible-words-using-a-set-or-letters%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You can create permutations with all of the letters as strings with:
StringJoin /@ Permutations[letters]
If you want lists of the individual letters just use:
Permutations[letters]
Check the documentation of Permutations to learn about permutations with subsets of letters. If you want to use each letter more than once, look at the documentation for Tuples.
$endgroup$
add a comment |
$begingroup$
You can create permutations with all of the letters as strings with:
StringJoin /@ Permutations[letters]
If you want lists of the individual letters just use:
Permutations[letters]
Check the documentation of Permutations to learn about permutations with subsets of letters. If you want to use each letter more than once, look at the documentation for Tuples.
$endgroup$
add a comment |
$begingroup$
You can create permutations with all of the letters as strings with:
StringJoin /@ Permutations[letters]
If you want lists of the individual letters just use:
Permutations[letters]
Check the documentation of Permutations to learn about permutations with subsets of letters. If you want to use each letter more than once, look at the documentation for Tuples.
$endgroup$
You can create permutations with all of the letters as strings with:
StringJoin /@ Permutations[letters]
If you want lists of the individual letters just use:
Permutations[letters]
Check the documentation of Permutations to learn about permutations with subsets of letters. If you want to use each letter more than once, look at the documentation for Tuples.
answered 1 hour ago
LeeLee
46027
46027
add a comment |
add a comment |
$begingroup$
Pemutations will do it:
letters = "a", "b", "c";
Permutations[letters, 3]
"a", "b", "c", "a", "c", "b", "b", "a", "c",
"b", "c", "a", "c", "a", "b", "c", "b", "a"
$endgroup$
add a comment |
$begingroup$
Pemutations will do it:
letters = "a", "b", "c";
Permutations[letters, 3]
"a", "b", "c", "a", "c", "b", "b", "a", "c",
"b", "c", "a", "c", "a", "b", "c", "b", "a"
$endgroup$
add a comment |
$begingroup$
Pemutations will do it:
letters = "a", "b", "c";
Permutations[letters, 3]
"a", "b", "c", "a", "c", "b", "b", "a", "c",
"b", "c", "a", "c", "a", "b", "c", "b", "a"
$endgroup$
Pemutations will do it:
letters = "a", "b", "c";
Permutations[letters, 3]
"a", "b", "c", "a", "c", "b", "b", "a", "c",
"b", "c", "a", "c", "a", "b", "c", "b", "a"
answered 1 hour ago
bill sbill s
54.6k377156
54.6k377156
add a comment |
add a comment |
Thanks for contributing an answer to Mathematica Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f193857%2fcreate-all-possible-words-using-a-set-or-letters%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown