Logged out
Access All our Essays in an Instant
Swap your work for FREE access, or pay £4.99 for instant access
Emma's Dilemma
Member rating: No Rating | Words: | Submitted: Tue Sep 02 2003
Page Preview
On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:
Mathematics GCSE coursework: Emma's Dilemma In my investigation I am going to investigate the number of possible arrangements of the letters in peoples names. I start with the least possible amount of letters, which is one: J This clearly only has one arrangement. I will now go on to investigate the number of arrangements of letters in names going up in order of the number of letters that they contain: AL LA (2 arrangements) SAM SMA ASM AMS MSA MAS (6 arrangements) LUCY LCUY LCYU LUYC LYCU LYUC ULYC ULCY UCLY UCYL UYCL UYLC CLUY CLYU CUYL CULY CYLU CUUL YLUC YLCU YULC YUCL YCUL YCLU (24 arrangements) I can see that if the name has no letters that are repeated I can work out the number of different possibilities more easily. I have worked out that when I have exhausted the different number of possible combinations starting with the same letter I can times that by the number of letters in the word to work out the number of formulas. For example, when doing the name Lucy I can cut down the time it would take to...
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 146,871 others
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
