Emma's Dilemma

Authors Avatar

GCSE Mathematics Coursework

Emma’s Dilemma

In my investigation I am going to investigate the number of different arrangements of letters for names and words and try to find a formula that can be used to predict this.

For example:                TOM        is one arrangement

                and        OTM        is another arrangement

First, I am going to investigate the number of different arrangements of letters for the name LUCY (a 4-letter name, where all the letters are different).

LUCY                ULCY                CLUY                YLUC

LUYC                ULYC                CLYU                YLCU

LCUY                UCLY                CULY                YULC

LCYU                UCYL                CUYL                 YUCL

LYUC                UYLC                CYLU                YCLU

LYCU                UYCL                CYUL                YCUL

There are 4 different letters and 24 different arrangements.

Once I have investigated the number of different arrangements for one 4-letter name/word where all the letters are different, I do not need to try any more. If I tried the name DAVE for example, there would still be 24 different arrangements. I could substitute the L in LUCY for the D in DAVE, the U for A, the C for V, and the Y for E; and would therefore end up with the same result. The same is true for names/words with 3 letters or 5 letters, etc. As long as the number of letters and the number of different letters are the same, the number of different arrangements will be the same.

Now I will investigate a 3-letter name where all the letters are different.

SAM                ASM                MSA

SMA                AMS                MAS

There are 6 different arrangements.

Now I will investigate a 2-letter name where all the letters are different.

JO                OJ

There are 2 different arrangements.

Now I am going to investigate a 5-letter name where all the letters are different.

KATIE                AKTIE                TKAIE                IKATE                EKATI

KATEI                AKTEI                TKAEI                IKAET                EKAIT

KAITE                AKITE                TKIAE                IKTAE                EKTAI

KAIET                AKIET                TKIEA                IKTEA                EKTIA

KAETI                AKETI                TKEAI                IKEAT                EKIAT

KAEIT                AKEIT                TKEIA                IKETA                EKITA

KTAIE                ATKIE                TAKIE                IAKTE                EAKTI

KTAEI                ATKEI                TAKEI                IAKET                EAKIT

KTIAE                ATIKE                TAIKE                IATKE                EATKI

KTIEA                ATIEK                TAIEK                IATEK                EATIK

KTEAI                ATEKI                TAEKI                IAEKT                EAIKT

KTEIA                ATEIK                TAEIK                IAETK                EAITK

KIATE                AIKTE                TIKAE                ITKAE                ETKAI

KIAET                AIKET                TIKEA                ITKEA                ETKIA

KITAE                AITKE                TIAKE                ITAKE                ETAKI

KITEA                AITEK                TIAEK                ITAEK                ETAIK

KIEAT                AIEKT                TIEKA                ITEKA                ETIKA

KIETA                AIETK                TIEAK                ITEAK                ETIAK

KEATI                AEKTI                TEKAI                IEKAT                EIKAT

KEAIT                AEKIT                TEKIA                IEKTA                EIKTA

KETAI                AETKI                TEAKI                IEAKT                EIAKT

KETIA                AETIK                TEAIK                IEATK                EIATK

KEIAT         AEIKT                TEIKA                IETKA                EITKA

KEITA                AEITK                TEIAK                IETAK                EITAK

There are 120 different arrangements.

Table of Results

From looking at the table of results, I have noticed that the number of different arrangements (a) for a word that has a certain amount of letters can be found by multiplying the number of letters in that word (n) by the number of different arrangements for a word with one less letter.

For example:

To find the number of different arrangements for a word with 4 letters you calculate

4 × 6 (the number of different arrangements for a 3-letter word),

which equals 24.

Why this works:

When you have a 1-letter word there is only 1 arrangement.

e.g.        A

When you rearrange a 2-letter word there are 2 arrangements.

e.g.         JO        OJ

When you rearrange a 3-letter word you can fix the first letter and then rearrange the other 2.

e.g.        TOM        TMO

Giving 2 different arrangements for each different letter at the beginning.

e.g.        TOM        TMO             There are 2 different arrangements when T is at the beginning.

        OTM        OMT             There are 2 different arrangements when O is at the beginning.

Join now!

        MTO        MOT             There are 2 different arrangements when M is at the beginning.

Giving a total of 6 different arrangements because there are 3 different letters in TOM, all of which can be placed at the beginning.

3 × 2 = 6 different arrangements.

This works for words (where all the letters are different) of any length. If you were doing a 5-letter word for example, the same principle would apply. You could fix the first letter, then rearrange the other 4; giving the number of different arrangements for 4-letter words. But since there are 5 different letters, you ...

This is a preview of the whole essay