Happy Easter!

If we randomly scramble the letters of HAPPYEASTER, what is the the probability the scramble will result in the A next to the A, the E next to the E, and the P next to the P?

Example of Desired Outcome: AAHYSPPTEER

Let the probability be: P = a b \displaystyle P = \frac{a}{b}

where a a and b b are positive coprime integers.

Enter the answer as a + b \displaystyle a+b


The answer is 499.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

David Vreken
Apr 7, 2021

With 11 11 letters total and 3 3 letters that are repeated 2 2 times, the letters of H A P P Y E A S T E R HAPPYEASTER can be rearranged in 11 ! 2 ! 2 ! 2 ! \cfrac{11!}{2!2!2!} ways.

Treating double letters as a single letter, H A 2 P 2 Y E 2 S T R HA_2P_2YE_2STR has 8 8 different letters and can be rearranged in 8 ! 8! different ways.

The probability is then 8 ! 11 ! 2 ! 2 ! 2 ! = 8 11 10 9 = 4 495 \cfrac{8!}{\frac{11!}{2!2!2!}} = \cfrac{8}{11 \cdot 10 \cdot 9} = \cfrac{4}{495} , so a = 4 a = 4 , b = 495 b = 495 , and a + b = 499 a + b = \boxed{499} .

Hi David! Thanks for the solution. Do you know how to get the number of ways where exactly 2 of the doubled sets are next to each other ( Ex: AAPHYPEESTR ). I tried to write a problem, but then I realized my attempt was quite naïve.

Eric Roberts - 2 months ago

Log in to reply

I believe you could do 3 3 for the number of ways to choose one of the three doubled letters to not be beside each other, then 9 ! 2 ! \cfrac{9!}{2!} for the number of arrangements for H A 2 P P Y E 2 S T R HA_2PPYE_2STR , but then subtract out 8 ! 8! for counting the number of rearrangements of H A 2 P 2 Y E 2 S T R HA_2P_2YE_2STR where the two doubled sets that shouldn't be beside each other are beside each other.

So that would be 3 ( 9 ! 2 ! 8 ! ) = 423360 3\bigg(\cfrac{9!}{2!} - 8!\bigg) = 423360 ways.

David Vreken - 2 months ago

Log in to reply

Yep, I see now! Thank You!

Eric Roberts - 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...