Your Status: Logged out Log in

Emma’s Dilemma  

Member rating: 1 out of 10 stars (1 vote) | Words: | Submitted: Thu Jul 11 2002

Page Preview
Preview
Previous 1 of 7 Next

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...

Get instant access



  • Instant, unlimited access to our documents in full
  • Swap your work for free access, or pay £4.99
  • To see the full version of this document and 145,970 others
Register Now
OR

Receive email updates for this category



  • Simply tell us your email address and receive a weekly Study Help Email for FREE
  • Receive 3 FREE essay views with each email
  • Get all the latest essays from Coursework.Info & discussion from TheStudentRoom.co.uk