Your Status: Logged out Log in

Emmas Dilema

Member rating: No Rating | Words: 863 | Submitted: Mon Apr 21 2008

Page Preview
Preview
Previous 1 of 5 Next

On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:

Emma's Dilemma In this investigation, we had to find out the number of different combinations that could be made when different amounts and combinations of letters were formed. This includes repeated patterns of letters. Emma and Lucy wanted to find the amount of different combinations each of their names could make. Emma can be represented by the letters AABC as there is the same amount of letters in both and there is one repeat in both as well. Lucy can be represented by ABCD as it contains 4 different letters with no repeats. I also had to attempt to find a formula to work out the amount of combinations for other amounts of letters. To find out the amount of combinations which can be made by non-repeated or repeated patterns of letters, I started off with a combination which contains the same letters, for example for a repeated pattern of letters AA, and...

To see the full version of this document, and 144,847 others

Register Now