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
Closed-form expression for certain product
why `nmap 192.168.1.97` returns less services than `nmap 127.0.0.1`?
What is the evidence for the "tyranny of the majority problem" in a direct democracy context?
Melting point of aspirin, contradicting sources
How to explain what's wrong with this application of the chain rule?
Why electric field inside a cavity of a non-conducting sphere not zero?
Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?
Start making guitar arrangements
Is there a name for this algorithm to calculate the concentration of a mixture of two solutions containing the same solute?
On a tidally locked planet, would time be quantized?
How do I color the graph in datavisualization?
Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?
Open a doc from terminal, but not by its name
Can I sign legal documents with a smiley face?
Is the U.S. Code copyrighted by the Government?
What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?
Energy measurement from position eigenstate
Travelling outside the UK without a passport
It grows, but water kills it
Did arcade monitors have same pixel aspect ratio as TV sets?
Is there a working SACD iso player for Ubuntu?
Has any country ever had 2 former presidents in jail simultaneously?
What does routing an IP address mean?
Is it possible to have a strip of cold climate in the middle of a planet?
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
edited 1 hour ago
J. M. is slightly pensive♦
98.3k10306466
asked 2 hours ago
mf67mf67
975
$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
edited 1 hour ago
J. M. is slightly pensive♦
98.3k10306466
asked 2 hours ago
mf67mf67
975
$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
edited 1 hour ago
J. M. is slightly pensive♦
98.3k10306466
asked 2 hours ago
mf67mf67
975
$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
asked 2 hours ago
mf67mf67
975
edited 1 hour ago
J. M. is slightly pensive♦
98.3k10306466
asked 2 hours ago
mf67mf67
975
edited 1 hour ago
J. M. is slightly pensive♦
98.3k10306466
edited 1 hour ago
J. M. is slightly pensive♦
98.3k10306466
edited 1 hour ago
J. M. is slightly pensive♦
98.3k10306466
98.3k10306466
asked 2 hours ago
mf67mf67
975
asked 2 hours ago
mf67mf67
975
asked 2 hours ago
mf67mf67
975
975
add a comment |
add a comment |
3 Answers
3
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.
answered 1 hour ago
LeeLee
46027
$endgroup$
$begingroup$
Thanks(x2). Is there some way to check how many words contain a ‘sub-word’, like ‘ab’ or even a set of ‘sub-words’ like ‘ab’ and ‘cd’? And is there any web page or text book that deals with combinatorics in Mathematica (on a more ‘basic’ level) that I could visit/buy and read?
$endgroup$
– mf67
10 mins ago
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"
answered 1 hour ago
bill sbill s
54.6k377156
$endgroup$
add a comment |
$begingroup$
If I follow the OP's question, I think they want the following:
letters = "a", "b", "c";
p = Permutations[letters, #] & /@ Range[Length[letters]];
(StringJoin[#] & /@ #) & /@ p
a, b, c, ab, ac, ba, bc, ca, cb, abc, acb, bac, bca, cab, cba
answered 13 mins ago
JagraJagra
7,85312159
$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
3 Answers
3
active
oldest
votes
3 Answers
3
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.
answered 1 hour ago
LeeLee
46027
$endgroup$
$begingroup$
Thanks(x2). Is there some way to check how many words contain a ‘sub-word’, like ‘ab’ or even a set of ‘sub-words’ like ‘ab’ and ‘cd’? And is there any web page or text book that deals with combinatorics in Mathematica (on a more ‘basic’ level) that I could visit/buy and read?
$endgroup$
– mf67
10 mins ago
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.
answered 1 hour ago
LeeLee
46027
$endgroup$
$begingroup$
Thanks(x2). Is there some way to check how many words contain a ‘sub-word’, like ‘ab’ or even a set of ‘sub-words’ like ‘ab’ and ‘cd’? And is there any web page or text book that deals with combinatorics in Mathematica (on a more ‘basic’ level) that I could visit/buy and read?
$endgroup$
– mf67
10 mins ago
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.
answered 1 hour ago
LeeLee
46027
$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
answered 1 hour ago
LeeLee
46027
answered 1 hour ago
LeeLee
46027
answered 1 hour ago
LeeLee
46027
46027
$begingroup$
Thanks(x2). Is there some way to check how many words contain a ‘sub-word’, like ‘ab’ or even a set of ‘sub-words’ like ‘ab’ and ‘cd’? And is there any web page or text book that deals with combinatorics in Mathematica (on a more ‘basic’ level) that I could visit/buy and read?
$endgroup$
– mf67
10 mins ago
add a comment |
$begingroup$
Thanks(x2). Is there some way to check how many words contain a ‘sub-word’, like ‘ab’ or even a set of ‘sub-words’ like ‘ab’ and ‘cd’? And is there any web page or text book that deals with combinatorics in Mathematica (on a more ‘basic’ level) that I could visit/buy and read?
$endgroup$
– mf67
10 mins ago
$begingroup$
Thanks(x2). Is there some way to check how many words contain a ‘sub-word’, like ‘ab’ or even a set of ‘sub-words’ like ‘ab’ and ‘cd’? And is there any web page or text book that deals with combinatorics in Mathematica (on a more ‘basic’ level) that I could visit/buy and read?
$endgroup$
– mf67
10 mins ago
$begingroup$
Thanks(x2). Is there some way to check how many words contain a ‘sub-word’, like ‘ab’ or even a set of ‘sub-words’ like ‘ab’ and ‘cd’? And is there any web page or text book that deals with combinatorics in Mathematica (on a more ‘basic’ level) that I could visit/buy and read?
$endgroup$
– mf67
10 mins ago
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"
answered 1 hour ago
bill sbill s
54.6k377156
$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"
answered 1 hour ago
bill sbill s
54.6k377156
$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"
answered 1 hour ago
bill sbill s
54.6k377156
$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
answered 1 hour ago
bill sbill s
54.6k377156
answered 1 hour ago
bill sbill s
54.6k377156
answered 1 hour ago
bill sbill s
54.6k377156
54.6k377156
add a comment |
add a comment |
$begingroup$
If I follow the OP's question, I think they want the following:
letters = "a", "b", "c";
p = Permutations[letters, #] & /@ Range[Length[letters]];
(StringJoin[#] & /@ #) & /@ p
a, b, c, ab, ac, ba, bc, ca, cb, abc, acb, bac, bca, cab, cba
answered 13 mins ago
JagraJagra
7,85312159
$endgroup$
add a comment |
$begingroup$
If I follow the OP's question, I think they want the following:
letters = "a", "b", "c";
p = Permutations[letters, #] & /@ Range[Length[letters]];
(StringJoin[#] & /@ #) & /@ p
a, b, c, ab, ac, ba, bc, ca, cb, abc, acb, bac, bca, cab, cba
answered 13 mins ago
JagraJagra
7,85312159
$endgroup$
add a comment |
$begingroup$
If I follow the OP's question, I think they want the following:
letters = "a", "b", "c";
p = Permutations[letters, #] & /@ Range[Length[letters]];
(StringJoin[#] & /@ #) & /@ p
a, b, c, ab, ac, ba, bc, ca, cb, abc, acb, bac, bca, cab, cba
answered 13 mins ago
JagraJagra
7,85312159
$endgroup$
If I follow the OP's question, I think they want the following:
letters = "a", "b", "c";
p = Permutations[letters, #] & /@ Range[Length[letters]];
(StringJoin[#] & /@ #) & /@ p
a, b, c, ab, ac, ba, bc, ca, cb, abc, acb, bac, bca, cab, cba
answered 13 mins ago
JagraJagra
7,85312159
answered 13 mins ago
JagraJagra
7,85312159
answered 13 mins ago
JagraJagra
7,85312159
answered 13 mins ago
JagraJagra
7,85312159
7,85312159
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
