Really Amazing Dudes

Radleigh and Bradley both think that they are very cool; in fact, they are "RAD!!!". However, they dispute who is more "RAD!!!". Sameer came up with a metric of testing "RAD!!!"-ness: the person who has more permutations of their name starting with "RAD" has x x more "RAD!!!"-ness points than the other, where x x is the difference in the number of permutations.

If Adam says Bradley has 120 120 "RAD!!!"-ness points, then how many "RAD!!!"-ness points does Radleigh have?


The answer is 216.

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.

5 solutions

Ivan Koswara
Dec 25, 2013

Main idea : Fix RAD at the front and compute the number of permutations of the remaining letters.

Complete proof :

Call "RAD!!!"-ness points Rp for short; not to be confused with Rupiah .

Since all permutations considered for Rp begin with RAD, we can fix RAD at the front and ignore them. This way, RADLEIGH becomes LEIGH, which has 5 ! = 120 5! = 120 permutations, and BRADLEY becomes BLEY, which has 4 ! = 24 4! = 24 permutations. Thus Radleigh's Rp is 120 + ( 120 24 ) = 216 120 + (120 - 24) = \boxed{216} .

Motivation : Eh, it's pretty obvious you want to compute the number of permutations of each name.

Generalization : Using different names is not fun. Even when they have multiple R, A, D, as they are indistinguishable, they have no effect; we can still pick an arbitrary R, A, and D to remove and arrange the rest using multinomial coefficients. A more fun generalization is "!!RAD!!"-ness points, where RAD can occur anywhere in the permutation. With at most one R, at most one A, or at most one D, this is easy: gather the RAD into a single block and use multinomial coefficient again. When there are two or more of each letter though (like ARDRAD), it becomes pretty hard, as RADRAD should be counted only once (and not twice due to the double RAD blocks).

If Adam says Bradley has 120 "RAD!!!"-ness points, then how many "RAD!!!"-ness points does Radleigh have?

Here how Bradley has 120 "RAD!!!"-ness points ??? Am I missing anything ??? Please clear me...

Mukit Chowdhury - 7 years, 5 months ago

Log in to reply

A name without any permutation beginning with RAD doesn't necessarily have zero Rp.

Ivan Koswara - 7 years, 5 months ago
Trevor B.
Dec 23, 2013

Radleigh's name must start with "RAD", but the other 5 5 letters can be in any order. Because all 5 5 of the letters are distinct, there are 5 ! = 120 5!=\textbf{120} ways to arrange Radleigh's name so it starts with "RAD". For Bradley, his name must start with "RAD", but the other 4 4 letters can be in any order. Because all 4 4 of the letters are distinct, there are 4 ! = 24 4!=\textbf{24} ways to arrange Bradley's name so it starts with "RAD".

The difference between these is 96 96 . Based off of Sameer's metric and Adam's information, Radleigh has 120 + 96 = 216 120+96=\boxed{216} "RAD!!!"-ness points.

This question is an inside joke within the math team I am on. I haven't gone crazy and come up with some weird problem that doesn't make sense... Oh wait, that's exactly what I did.

Trevor B. - 7 years, 5 months ago

I don't get how Bradley's "RAD!!!"-ness points is 120 ?

Athmika Senthilkumar - 7 years, 4 months ago

This problem is really weird. What is the whole x x thing about? I was completely clueless on the whole RAD thing. I thought that the RAD-ness was a function of the number of permutations, so it would be ( n + 1 ) ! (n+1)! , which would make having 4 extra letters (in Bradley's case) equate to 120 RAD points. The whole thing was a complete mess.

Finn Hulse - 7 years, 3 months ago

Consider "RADleigh" and "bRADley".

  • RADleigh: RAD* * * * * * * * * -> 5 missing letters to choose. ( 5 ! 5! ways)
  • bRADley: RAD* * * * * * -> 4 missing letters to choose. ( 4 ! 4! ways)

Difference = 5 ! 4 ! = 96 = 5! -4! = 96 .

If Bradley has 120 (less) "RAD!!!"-ness points, Radleigh will have 120 + 96 = 216 120+96 = \boxed{216} points.

PS: This question almost confused me that number of ways = "RAD!!!"-ness points.

Jeremi Litarowicz
Jan 13, 2014

First, we calculate that Bradley has 4 ! = 24 4!=24 permutations of his name starting with "Rad". Since the points have a one to one ratio to the permutations, they must equal 120 24 = 96 120-24=96 more than the actual permutations. We thus deduce that Radleigh has 5 ! + 96 = 120 + 96 = 216 5!+96=120+96=\boxed{216} "Rad"-ness points.

David Austen
Jan 4, 2014

Why such a high rating?

Radleigh has 5! - 4! = 96 more points than Bradley, so he has 120+96=216... Trivial

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...