How Many Unique 4-Letter Codes Can Be Created from Six Different Letters?

  • Thread starter Thread starter wvcaudill2
  • Start date Start date
  • Tags Tags
    Combinations
Click For Summary

Homework Help Overview

The problem involves determining how many unique 4-letter codes can be formed from a set of six different letters: A, B, C, D, E, and F, with the condition that no letter can be used more than once in each code.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants discuss the implications of using letters only once and whether the order of letters matters in forming codes. Some express uncertainty about how to begin solving the problem, while others suggest writing out possibilities or considering the nature of permutations versus combinations.

Discussion Status

There is an ongoing exploration of the problem, with participants questioning the definitions and implications of permutations and combinations. Some guidance has been offered regarding the importance of order in the codes, and there is a recognition of the diminishing choices as letters are selected.

Contextual Notes

Participants note that the problem may stem from a review worksheet and express confusion about the terminology used, particularly in distinguishing between combinations and permutations.

wvcaudill2
Messages
53
Reaction score
0

Homework Statement


How many 4-letter codes can be formed using the letters A, B, C, D, E, and F? No letter can be used more than once.


Homework Equations


N/A?



The Attempt at a Solution


I really didnt know where to begin . . .
 
Physics news on Phys.org
if you can only use a letter once, then just start writing it out on paper. Are you sure a letter can only be used once? Or once in each position?
 
Here is the problem with this question, there is no way to give you a hint without giving you the answer. Seriously.

If this is assigned from a textbook, then the answer is there. The hint is that it is not combinations, that term is not the math term for it.
 
Im not sure how this is so easy for you. I assume that the question means that no lettter can be used more than once within one of the 4-letter codes. If this is the case, then there are way to many codes to write by hand.

This problem came from a review worksheet. If this is not a combinations problem, then what is it?
 
Well, think about it. You've got 5 letters, right? And you know that you can't use each letter more than once. So what does that imply each time you've chosen a letter?
 
frankfjf said:
Well, think about it. You've got 5 letters, right? And you know that you can't use each letter more than once. So what does that imply each time you've chosen a letter?

This implies that after each time I have chosen a letter, there is one less to choose from.

I tried to use n! to find an answer by doing 6x5x4x3x2x1, but the resulting answer was way to large.
 
Okay, so you know that the available choices diminish by 1 each time you choose a letter. Only other hint I can think of without giving the answer away is to consider if the order the letters appear in is important. IE: Is, say, FBACE the same code as ECABF?
 
frankfjf said:
Okay, so you know that the available choices diminish by 1 each time you choose a letter. Only other hint I can think of without giving the answer away is to consider if the order the letters appear in is important. IE: Is, say, FBACE the same code as ECABF?

I would think the order is important, but how does that help me?
 
Well, check your textbook. What are you dealing with when order is important?
 
  • #10
frankfjf said:
Well, check your textbook. What are you dealing with when order is important?

I don't have a textbook, but I am thinking permutations. I don't really know how they differ functionally from a combination though.
 
  • #11
Sounds good. Permutations are employed when the order in which the objects are chosen matters, such as when ABCDE (in this case) is not the same as EDCBA. If the order of the letters didn't matter (Such as if I asked you to tell me how many ways you can throw 5 random letters together rather than asking you for 5-letter codes) you'd use the formula for combinations instead.
 
  • #12
Ok, so I should use n!/(n-r)!

so, 6!/(6-4)! = 360?
 
  • #13
The formula you want is one that is used for combinations, i THINK. You want 6 choose 4 or in other words, how many ways can you choose 4 from 6. The formula for n choose r is [tex]\frac{n!}{(n-r)!r!} \Rightarrow \frac{6!}{(6-4)!4!}[/tex]
 
Last edited:
  • #14
mynameisfunk said:
The formula you want is one that is used for combinations, i THINK. You want 6 choose 4 or in other words, how many ways can you choose 4 from 6. The formula for n choose r is [tex]\frac{n!}{(n-r)!r!} \Rightarrow \frac{6!}{(6-4)!4!}[/tex]

Originally, I had thought this too, however, I think the order matters here, so the permutation formula must be used.
 
  • #15
ok sorry. I might do [tex]6 \times 5 \times 4 \times 3[/tex]
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 28 ·
Replies
28
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
10
Views
4K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K