# Calculate Possible Combinations of Five Letters

I need to calculate all the possible combinations of the letters A, B, C, D, E.

I think there is a formula for this, but I can recall it.

In other words...  My output would be something like this:

A B C D E
A C D E
A D E
A E
A
A B D E
A B E
A C
A D
A E
B C D E
B D E
B E
B
C D E
C E
C

Hopefully you get the idea.

###### Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Commented:
The links above only show for a particular length/sample pair.

You would need to repeat it for each length 1-N where N is the length of the string.

C(5,5) + C(5,4) + C(5,3) + C(5,2) + C(5,1) = 1 + 5 + 10 + 10 + 5 = 31
0

Experts Exchange Solution brought to you by

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Author Commented:
Thank you for the response, but I saw all that stuff when I did a google search.  Of those, I didn't see any that showed the output where sometimes there's a 5 letter combination, sometimes a 4 letter combination, sometimes there's a 3 letter combination, etc.

I need someone to show me the calculations with my letters and show me the answer.

Many thanks!
0
Author Commented:
That was what I was looking for.  Thank you so much!
0
Commented:
He asked for a formula. I gave a website that has the formula. No blind link. Sorry (to disagree).
0
Commented:
2^5-1
(assuming you're not counting the combination with no letters)
0
Commented:
Again, I disagree -- respectfully -- in this particular instance.

Thanks. Regards.
0
Commented:
You are essentially asking for all the subsets of [A B C D E]

One way to think about the problem is count in binary from

00000  = 0  ==> None/Empty Set
00001  = 1  ==> E     If there is a 1 in a position, include the letter
00010  = 2  ==> D
00011  = 3  ==> DE
:
:
11110  = 30  ==> ABCD
11111  = 31  ==> ABCDE

This is the same result as ozo's formula.
0
Commented:
Nice explanation, d-glitch. Thanks.
0
Commented:
Senniger1,

I concur, with ozo's and d-glitch's posts.

While I showed how the individual combination counts sum to produce the number you're looking for, and do produce the correct answer,  I left out the next obvious step of showing the simplification.

Using the exponentiation is the much more efficient means of getting the result.

As a TA I can reopen the question so you can split points to her if you'd like.
0
Commented:
I believe points are not that important -- at least for me. (Individuals may differ.) But the satisfaction (that comes) in providing help or trying to help.  :-)
0
Author Commented:
If you want to reopen the questions I will split some of the points as I deem fair since you answered my question as to what I needed.
0
Commented:
Nice Charitable.  :-)
0
Author Commented:
I based the points on the first response which completely answered my question and the detail which was most useful to me.

Many thanks to all!
0
###### It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Math / Science

From novice to tech pro — start learning today.