Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Possible Combinations

66 views
Skip to first unread message

CAskier

unread,
Mar 6, 2010, 11:49:54 PM3/6/10
to
Please let me know if I am in the wrong group for this question. I am
looking for all possible combinations using the letters A - B - E - K
- S & T with each letter being used only once. If there is anyone who
can help I would greatly appreciate it.

EB

Jared

unread,
Mar 7, 2010, 12:10:54 AM3/7/10
to

Does order matter?

sjde...@yahoo.com

unread,
Mar 7, 2010, 12:53:14 AM3/7/10
to
On Mar 6, 11:49 pm, CAskier <embl...@gmail.com> wrote:

This is a combinatorics question, and better suited for a math group
(e.g sci.math) than an English group. It's so basic that you should
probably Google an answer rather than asking over there, though.

If you need to use all six symbols, and the order matters (e.g. ABEKST
is different from ABEKTS, and ABEKS is prohibited), the answer is 6!
(pronounced "six factorial").

For the first position, you have 6 choices. For the second you have 5
(you can't use the symbol chosen first), and so forth. So it's
6*5*4*3*2*1 = 720 different combinations.

If you can use fewer than all 6 symbols and/or order doesn't matter,
the answer changes.

R H Draney

unread,
Mar 7, 2010, 12:36:52 AM3/7/10
to
CAskier filted:

There are six letters, and therefore 6! = 720 ways to arrange them...if you also
want the combinations that omit one or more of the above letters, that's more
complicated....

If you need them listed, the fastest approach is to write a program to generate
the combinations....

(Why is Firefox flagging "combinations" as a spelling error?)...r


--
"Oy! A cat made of lead cannot fly."
- Mark Brader declaims a basic scientific principle

Peter Moylan

unread,
Mar 7, 2010, 1:50:15 AM3/7/10
to

Is the result supposed to be a list of six-letter English words? If so,
the only word I can think of that fits the rules is "bakest". I'd be
curious to know whether there is a second word, but don't have the
patience to read through several pages of permutations to check.

If instead you're looking for _all_ combinations, whether or not they
are words, you are indeed in the wrong group. As others have suggested,
your best bet in that case is to write a small computer program to list
them all.

Luckily, there are fewer than nine billion possible answers.

--
Peter Moylan, Newcastle, NSW, Australia. http://www.pmoylan.org
For an e-mail address, see my web page.

Evan Kirshenbaum

unread,
Mar 7, 2010, 2:42:30 AM3/7/10
to
Peter Moylan <gro.nalyomp@retep> writes:

> CAskier wrote:
>> Please let me know if I am in the wrong group for this question. I
>> am looking for all possible combinations using the letters A - B -
>> E - K - S & T with each letter being used only once. If there is
>> anyone who can help I would greatly appreciate it.
>
> Is the result supposed to be a list of six-letter English words? If
> so, the only word I can think of that fits the rules is
> "bakest". I'd be curious to know whether there is a second word, but
> don't have the patience to read through several pages of
> permutations to check.

You really got "bakest" before "basket"?

--
Evan Kirshenbaum +------------------------------------
HP Laboratories |If to "man" a phone implies handing
1501 Page Mill Road, 1U, MS 1141 |it over to a person of the male
Palo Alto, CA 94304 |gender, then to "monitor" it
|suggests handing it over to a
kirsh...@hpl.hp.com |lizard.
(650)857-7572 | Rohan Oberoi

http://www.kirshenbaum.net/


Mike Easter

unread,
Mar 7, 2010, 2:48:37 AM3/7/10
to

My jumble tool only gives me basket.

The alt.usage.english faq is here http://www.alt-usage-english.org/

I don't see any mention in there of Jumble puzzle type issues :-)


--
Mike Easter

R H Draney

unread,
Mar 7, 2010, 2:51:07 AM3/7/10
to
Evan Kirshenbaum filted:

>
>Peter Moylan <gro.nalyomp@retep> writes:
>
>> CAskier wrote:
>>> Please let me know if I am in the wrong group for this question. I
>>> am looking for all possible combinations using the letters A - B -
>>> E - K - S & T with each letter being used only once. If there is
>>> anyone who can help I would greatly appreciate it.
>>
>> Is the result supposed to be a list of six-letter English words? If
>> so, the only word I can think of that fits the rules is
>> "bakest". I'd be curious to know whether there is a second word, but
>> don't have the patience to read through several pages of
>> permutations to check.
>
>You really got "bakest" before "basket"?

Is "betask" a word?...it should be....r

Peter Moylan

unread,
Mar 7, 2010, 2:57:42 AM3/7/10
to
Evan Kirshenbaum wrote:
> Peter Moylan <gro.nalyomp@retep> writes:
>
>> CAskier wrote:
>>> Please let me know if I am in the wrong group for this question. I
>>> am looking for all possible combinations using the letters A - B -
>>> E - K - S & T with each letter being used only once. If there is
>>> anyone who can help I would greatly appreciate it.
>> Is the result supposed to be a list of six-letter English words? If
>> so, the only word I can think of that fits the rules is
>> "bakest". I'd be curious to know whether there is a second word, but
>> don't have the patience to read through several pages of
>> permutations to check.
>
> You really got "bakest" before "basket"?
>
<hits head in shock>

Mark Brader

unread,
Mar 7, 2010, 3:24:53 AM3/7/10
to
C. Askier:

>>>> I am looking for all possible combinations using the letters A - B -
>>>> E - K - S & T with each letter being used only once. If there is
>>>> anyone who can help I would greatly appreciate it.

Peter Moylan:


>>> Is the result supposed to be a list of six-letter English words? If
>>> so, the only word I can think of that fits the rules is

>>> "bakest". ...

Evan Kirshenbaum:


>> You really got "bakest" before "basket"?

R.H. Draney:


> Is "betask" a word?...it should be.

It's in the "Webster's 2nd" online word list; that and "basket" are
the only two matches.
--
Mark Brader | "If I quoted each [part] that had serious problems,
Toronto | [the author] could sue me for copyright infringement."
m...@vex.net | -- Steve Summit

My text in this article is in the public domain.

Mark Brader

unread,
Mar 7, 2010, 3:30:58 AM3/7/10
to
R.H. Draney:

> If you need them listed, the fastest approach is to write a program
> to generate the combinations....

You mean there are people who haven't already done that? Here:

#!/usr/bin/perl

sub perm {
my ($prefix, @args) = @_;
if (@args) {
for (my $i = 0; $i < @args; ++$i) {
my @list;
for (my $j = 0; $j < @args; ++$j) {
push @list, $args[$j] if ($i != $j);
}
perm ([@$prefix, $args[$i]], @list);
}
} else {
print @$prefix, "\n";
}
}

perm ([], @ARGV) if (@ARGV);

> (Why is Firefox flagging "combinations" as a spelling error?).

I don't know, but it is the wrong word -- we're talking about permutations.
Combinations are when you may take only some of the letters, but the order
doesn't matter.

Here they are:

basket baskte basekt basetk bastke bastek bakset bakste
bakest bakets baktse baktes baeskt baestk baekst baekts
baetsk baetks batske batsek batkse batkes batesk bateks
bsaket bsakte bsaekt bsaetk bsatke bsatek bskaet bskate
bskeat bsketa bsktae bsktea bseakt bseatk bsekat bsekta
bsetak bsetka bstake bstaek bstkae bstkea bsteak bsteka
bkaset bkaste bkaest bkaets bkatse bkates bksaet bksate
bkseat bkseta bkstae bkstea bkeast bkeats bkesat bkesta
bketas bketsa bktase bktaes bktsae bktsea bkteas bktesa
beaskt beastk beakst beakts beatsk beatks besakt besatk
beskat beskta bestak bestka bekast bekats beksat beksta
bektas bektsa betask betaks betsak betska betkas betksa
btaske btasek btakse btakes btaesk btaeks btsake btsaek
btskae btskea btseak btseka btkase btkaes btksae btksea
btkeas btkesa bteask bteaks btesak bteska btekas bteksa
absket abskte absekt absetk abstke abstek abkset abkste
abkest abkets abktse abktes abeskt abestk abekst abekts
abetsk abetks abtske abtsek abtkse abtkes abtesk abteks
asbket asbkte asbekt asbetk asbtke asbtek askbet askbte
askebt asketb asktbe askteb asebkt asebtk asekbt asektb
asetbk asetkb astbke astbek astkbe astkeb astebk astekb
akbset akbste akbest akbets akbtse akbtes aksbet aksbte
aksebt aksetb akstbe aksteb akebst akebts akesbt akestb
aketbs aketsb aktbse aktbes aktsbe aktseb aktebs aktesb
aebskt aebstk aebkst aebkts aebtsk aebtks aesbkt aesbtk
aeskbt aesktb aestbk aestkb aekbst aekbts aeksbt aekstb
aektbs aektsb aetbsk aetbks aetsbk aetskb aetkbs aetksb
atbske atbsek atbkse atbkes atbesk atbeks atsbke atsbek
atskbe atskeb atsebk atsekb atkbse atkbes atksbe atkseb
atkebs atkesb atebsk atebks atesbk ateskb atekbs ateksb
sbaket sbakte sbaekt sbaetk sbatke sbatek sbkaet sbkate
sbkeat sbketa sbktae sbktea sbeakt sbeatk sbekat sbekta
sbetak sbetka sbtake sbtaek sbtkae sbtkea sbteak sbteka
sabket sabkte sabekt sabetk sabtke sabtek sakbet sakbte
sakebt saketb saktbe sakteb saebkt saebtk saekbt saektb
saetbk saetkb satbke satbek satkbe satkeb satebk satekb
skbaet skbate skbeat skbeta skbtae skbtea skabet skabte
skaebt skaetb skatbe skateb skebat skebta skeabt skeatb
sketba sketab sktbae sktbea sktabe sktaeb skteba skteab
sebakt sebatk sebkat sebkta sebtak sebtka seabkt seabtk
seakbt seaktb seatbk seatkb sekbat sekbta sekabt sekatb
sektba sektab setbak setbka setabk setakb setkba setkab
stbake stbaek stbkae stbkea stbeak stbeka stabke stabek
stakbe stakeb staebk staekb stkbae stkbea stkabe stkaeb
stkeba stkeab stebak stebka steabk steakb stekba stekab
kbaset kbaste kbaest kbaets kbatse kbates kbsaet kbsate
kbseat kbseta kbstae kbstea kbeast kbeats kbesat kbesta
kbetas kbetsa kbtase kbtaes kbtsae kbtsea kbteas kbtesa
kabset kabste kabest kabets kabtse kabtes kasbet kasbte
kasebt kasetb kastbe kasteb kaebst kaebts kaesbt kaestb
kaetbs kaetsb katbse katbes katsbe katseb katebs katesb
ksbaet ksbate ksbeat ksbeta ksbtae ksbtea ksabet ksabte
ksaebt ksaetb ksatbe ksateb ksebat ksebta kseabt kseatb
ksetba ksetab kstbae kstbea kstabe kstaeb ksteba ksteab
kebast kebats kebsat kebsta kebtas kebtsa keabst keabts
keasbt keastb keatbs keatsb kesbat kesbta kesabt kesatb
kestba kestab ketbas ketbsa ketabs ketasb ketsba ketsab
ktbase ktbaes ktbsae ktbsea ktbeas ktbesa ktabse ktabes
ktasbe ktaseb ktaebs ktaesb ktsbae ktsbea ktsabe ktsaeb
ktseba ktseab ktebas ktebsa kteabs kteasb ktesba ktesab
ebaskt ebastk ebakst ebakts ebatsk ebatks ebsakt ebsatk
ebskat ebskta ebstak ebstka ebkast ebkats ebksat ebksta
ebktas ebktsa ebtask ebtaks ebtsak ebtska ebtkas ebtksa
eabskt eabstk eabkst eabkts eabtsk eabtks easbkt easbtk
easkbt easktb eastbk eastkb eakbst eakbts eaksbt eakstb
eaktbs eaktsb eatbsk eatbks eatsbk eatskb eatkbs eatksb
esbakt esbatk esbkat esbkta esbtak esbtka esabkt esabtk
esakbt esaktb esatbk esatkb eskbat eskbta eskabt eskatb
esktba esktab estbak estbka estabk estakb estkba estkab
ekbast ekbats ekbsat ekbsta ekbtas ekbtsa ekabst ekabts
ekasbt ekastb ekatbs ekatsb eksbat eksbta eksabt eksatb
ekstba ekstab ektbas ektbsa ektabs ektasb ektsba ektsab
etbask etbaks etbsak etbska etbkas etbksa etabsk etabks
etasbk etaskb etakbs etaksb etsbak etsbka etsabk etsakb
etskba etskab etkbas etkbsa etkabs etkasb etksba etksab
tbaske tbasek tbakse tbakes tbaesk tbaeks tbsake tbsaek
tbskae tbskea tbseak tbseka tbkase tbkaes tbksae tbksea
tbkeas tbkesa tbeask tbeaks tbesak tbeska tbekas tbeksa
tabske tabsek tabkse tabkes tabesk tabeks tasbke tasbek
taskbe taskeb tasebk tasekb takbse takbes taksbe takseb
takebs takesb taebsk taebks taesbk taeskb taekbs taeksb
tsbake tsbaek tsbkae tsbkea tsbeak tsbeka tsabke tsabek
tsakbe tsakeb tsaebk tsaekb tskbae tskbea tskabe tskaeb
tskeba tskeab tsebak tsebka tseabk tseakb tsekba tsekab
tkbase tkbaes tkbsae tkbsea tkbeas tkbesa tkabse tkabes
tkasbe tkaseb tkaebs tkaesb tksbae tksbea tksabe tksaeb
tkseba tkseab tkebas tkebsa tkeabs tkeasb tkesba tkesab
tebask tebaks tebsak tebska tebkas tebksa teabsk teabks
teasbk teaskb teakbs teaksb tesbak tesbka tesabk tesakb
teskba teskab tekbas tekbsa tekabs tekasb teksba teksab
--
Mark Brader "You can do this in a number of ways.
Toronto IBM chose to do all of them...
m...@vex.net why do you find that funny?" --D. Taylor

My text, tetx, txet, txte, ttex, ttxe, etxt, ettx, extt, xtet, xtte,
xett, and code in this article are in the public domain.

Lewis

unread,
Mar 7, 2010, 5:56:10 AM3/7/10
to
On 07-Mar-10 00:57, Peter Moylan wrote:
> Evan Kirshenbaum wrote:
>> Peter Moylan<gro.nalyomp@retep> writes:
>>
>>> CAskier wrote:
>>>> Please let me know if I am in the wrong group for this question. I
>>>> am looking for all possible combinations using the letters A - B -
>>>> E - K - S& T with each letter being used only once. If there is

>>>> anyone who can help I would greatly appreciate it.
>>> Is the result supposed to be a list of six-letter English words? If
>>> so, the only word I can think of that fits the rules is
>>> "bakest". I'd be curious to know whether there is a second word, but
>>> don't have the patience to read through several pages of
>>> permutations to check.
>>
>> You really got "bakest" before "basket"?
>>
> <hits head in shock>

The word for that is 'facepalm'

or, if you prefer, "Doh!"


--
I WILL NOT ENCOURAGE OTHERS TO FLY
Bart chalkboard Ep. 7F03

CDB

unread,
Mar 7, 2010, 8:06:18 AM3/7/10
to
Peter Moylan wrote:
> Evan Kirshenbaum wrote:
>> Peter Moylan <gro.nalyomp@retep> writes:
>>> CAskier wrote:
>
>>>> Please let me know if I am in the wrong group for this question.
>>>> I am looking for all possible combinations using the letters A -
>>>> B - E - K - S & T with each letter being used only once. If
>>>> there is anyone who can help I would greatly appreciate it.
>
>>> Is the result supposed to be a list of six-letter English words?
>>> If so, the only word I can think of that fits the rules is
>>> "bakest". I'd be curious to know whether there is a second word,
>>> but don't have the patience to read through several pages of
>>> permutations to check.
>>
>> You really got "bakest" before "basket"?
>>
> <hits head in shock>
>
The OP didn't actually specify a one-word solution. Should he be askt
about it?


HVS

unread,
Mar 7, 2010, 8:13:56 AM3/7/10
to
On 07 Mar 2010, CDB wrote

I wondered about that, too -- and I also wasn't sure if the combinations
were to be restricted to those and only those letters, or if longer words
using each of the letters once were to be included.


--
Cheers, Harvey
CanEng and BrEng, indiscriminately mixed


CAskier

unread,
Mar 7, 2010, 11:55:39 AM3/7/10
to

Thanky you, this is exactly what I was looking for!

EB

R H Draney

unread,
Mar 7, 2010, 1:28:40 PM3/7/10
to
HVS filted:

>
>On 07 Mar 2010, CDB wrote
>
>>>>> CAskier wrote:
>>>
>>>>>> I am looking for all possible combinations using the letters A -
>>>>>> B - E - K - S & T with each letter being used only once. If
>>>>>> there is anyone who can help I would greatly appreciate it.
>>>
>> The OP didn't actually specify a one-word solution. Should he be askt
>> about it?
>
>I wondered about that, too -- and I also wasn't sure if the combinations
>were to be restricted to those and only those letters, or if longer words
>using each of the letters once were to be included.

The OP has confirmed that only the six letters given were to be included, and
Mark Brader has thoughtfully done his homework for him....r

HVS

unread,
Mar 7, 2010, 1:36:52 PM3/7/10
to
On 07 Mar 2010, R H Draney wrote

> HVS filted:
>>
>> On 07 Mar 2010, CDB wrote
>>
>>>>>> CAskier wrote:
>>>>
>>>>>>> I am looking for all possible combinations using the letters A -
>>>>>>> B - E - K - S & T with each letter being used only once. If
>>>>>>> there is anyone who can help I would greatly appreciate it.
>>>>
>>> The OP didn't actually specify a one-word solution. Should he be askt
>>> about it?
>>
>> I wondered about that, too -- and I also wasn't sure if the
>> combinations were to be restricted to those and only those letters, or
>> if longer words using each of the letters once were to be included.
>
> The OP has confirmed that only the six letters given were to be
> included, and Mark Brader has thoughtfully done his homework for
> him....r

Ah; I missed that. Thanks.

Mike Lyle

unread,
Mar 7, 2010, 3:23:23 PM3/7/10
to
Peter Moylan wrote:
> Evan Kirshenbaum wrote:
>> Peter Moylan <gro.nalyomp@retep> writes:
>>
>>> CAskier wrote:
>>>> Please let me know if I am in the wrong group for this question. I
>>>> am looking for all possible combinations using the letters A - B -
>>>> E - K - S & T with each letter being used only once. If there is
>>>> anyone who can help I would greatly appreciate it.
>>> Is the result supposed to be a list of six-letter English words? If
>>> so, the only word I can think of that fits the rules is
>>> "bakest". I'd be curious to know whether there is a second word, but
>>> don't have the patience to read through several pages of
>>> permutations to check.
>>
>> You really got "bakest" before "basket"?
>>
> <hits head in shock>

Me too: it's our age, Peter. Best -ak- it gracefully.

--
Mike.


David Taylor

unread,
Mar 8, 2010, 3:41:23 AM3/8/10
to CAskier

Easiest way is to use an Anagram Server such as this one:

http://wordsmith.org/anagram/

(Internet Anagram Server = "I Rearrangement Server". Good eh?)

Just 4 found for ABEKST:

Basket
Ska Bet
Ask Bet
Task Be

As this is an English language newsgroup, I assume that you only want
English words, but if you wished to include words in other languages,
you can do a search on the server for that too.

If you google 'anagram servers' you'll see that there are thousands of them.


Hope that helps.

David,
Nr Hull,
N.E. Coast of England

David Taylor

unread,
Mar 8, 2010, 3:42:49 AM3/8/10
to

Askier wrote:

Easiest way is to use an Anagram Server such as this one:

0 new messages