Emmas Dilemma
Member rating:
(1 vote)
| Words:
| Submitted: Thu Jul 11 2002
On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:
Catherine Brown Emma's Dilemma During the course of this investigation I hope to find a formula that gives Emma the solution to her problem: how many permutations there are of arranging a given combination of letters. A permutation is different ways of arranging a set combination. A combination is a given set of numbers/ letters/ objects were order doesn't matter. I have decided to start with a 3-lettered word, all different. Where the results I gain from this investigation will help me to predict the next set of results accurately with evidence to back up my claims. My 3-lettered word will be AMY. This is 3 letters, none of them the same. 1. AMY 2. MAY 3. YAM 4. MYA 5. AYM 6. YMA Arranging the three letters has a possible 6 permutations. This could also be written as 3*2*1. I have chosen to write the formula in this format, instead of 3*2 (if it is multiplied by 1 the answer is...

