Sfrgttk

Creepy dinosaur pc game identification

Non-trope happy ending?

Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?

Closed-form expression for certain product

Problem with TransformedDistribution

Multiplicative persistence

A social experiment. What is the worst that can happen?

2.8 Why are collections grayed out? How can I open them?

copy and scale one figure (wheel)

Why Shazam when there is already Superman?

When were female captains banned from Starfleet?

If a character has darkvision, can they see through an area of nonmagical darkness filled with lightly obscuring gas?

Pre-mixing cryogenic fuels and using only one fuel tank

"Spoil" vs "Ruin"

Melting point of aspirin, contradicting sources

Longest common substring in linear time

The IT department bottlenecks progress. How should I handle this?

250 Floor Tower

How to indicate a cut out for a product window

Delivering sarcasm

Existing of non-intersecting rays

Why can Carol Danvers change her suit colours in the first place?

Which one is correct as adjective “protruding” or “protruded”?

Why electric field inside a cavity of a non-conducting sphere not zero?

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

1

$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

share|improve this question

edited 1 hour ago

J. M. is slightly pensive♦

98.3k10306466

asked 1 hour ago

mf67mf67

975

$endgroup$

add a comment | 

1

$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

share|improve this question

edited 1 hour ago

J. M. is slightly pensive♦

98.3k10306466

asked 1 hour 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

share|improve this question

edited 1 hour ago

J. M. is slightly pensive♦

98.3k10306466

asked 1 hour ago

mf67mf67

975

$endgroup$

letters = { "A", "B", ..., "F" }

share|improve this question

edited 1 hour ago

J. M. is slightly pensive♦

98.3k10306466

asked 1 hour ago

mf67mf67

975

share|improve this question

edited 1 hour ago

J. M. is slightly pensive♦

98.3k10306466

asked 1 hour 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

asked 1 hour ago

mf67mf67

975

asked 1 hour ago

mf67mf67

975

2 Answers
2

active

oldest

votes

2

$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.

share|improve this answer

answered 1 hour ago

LeeLee

45027

$endgroup$

add a comment | 

1

$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"}}

share|improve this answer

answered 1 hour ago

bill sbill s

54.6k377156

$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
});


}
});

draft saved

draft discarded

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

Name

Email

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

Name

Email

Required, but never shown

2

$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.

share|improve this answer

answered 1 hour ago

LeeLee

45027

$endgroup$

add a comment | 

2

$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.

share|improve this answer

answered 1 hour ago

LeeLee

45027

$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.

share|improve this answer

answered 1 hour ago

LeeLee

45027

$endgroup$

StringJoin /@ Permutations[letters]

Permutations[letters]

share|improve this answer

answered 1 hour ago

LeeLee

45027

answered 1 hour ago

LeeLee

45027

answered 1 hour ago

LeeLee

45027

1

$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"}}

share|improve this answer

answered 1 hour ago

bill sbill s

54.6k377156

$endgroup$

add a comment | 

1

$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"}}

share|improve this answer

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"}}

share|improve this answer

answered 1 hour ago

bill sbill s

54.6k377156

$endgroup$

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"}}

share|improve this answer

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