Just looked at my HW and i have very little idea to how solve even the first problem. So, if someone here has any idea how to solver for "Permutations" and "Combinations" please explain it to me. Here is one of the problems: An employer wants to give each employee an ID, defined as two letters followed by 4 number(e.g., TY751). Solve for the maximum number of employees that the firm can hire and still give each a unique ID?:ugh: Thanks, Taras
Here is my guess: 26 letters for the first character 26 letters for the second character 10 numbers for the third character (using 0-9 as the numbers) 10 numbers for the fourth character 10 numbers for the fifth character numbers for the sixth character 26x26x10x10x10x10=6,760,000??? Reminder! Only a guess!!!
0-9 is actually 10 possible numbers. So by your method it would be 6,760,000, though for some reason I don't think that's the formula.