My dog takes the AIME, and sees a problem. The question's answer was n m and asked for m + n , where m and n are relatively prime positive integers. She randomly guesses an m and an n such that they are relatively prime positive integers, and adds them up, and gets the answer 5 0 4 to be correct. Knowing she got it correct, what is the probability that she guessed the correct m and the correct n ?
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.
I suppose, you need to divide 1 4 4 by the total number of possibilities, which is 5 0 4 . Please let me know if Im wrong.
Log in to reply
The total number of ways is 1 4 4 and there is only 1 guess. Therefore, the probability is 1 4 4 1 .
No. This is a good point. However, notice how the problem says that the dog chooses m and n such that they are already relatively prime and positive integers. Those add to 504. Therefore, we are only looking at those 144 valid cases. There is only 1 case which would have the correct m and n, because that's how problems work, and therefore that is 1/144.
I think you may be double-counting. {5,499} and {499,5} aren't distinct solutions.
The answer of the problem is of the form n m and 4 9 9 5 = 5 4 9 9 . The dog is guessing one m and one n .
Log in to reply
No, the question says "What is the probability that the dog guessed 'the m and n' correct"? Implying that the pair is correct. As opposed to "What is the probability that the dog guessed m and n correct?"
At least, that's how I read it. The phrasing implies we are selecting from a a set of pairs. Not a set of ordered pairs.
Log in to reply
I read otherwise.
If m is 499, and n is 5, the answer would be 499/5. However, if m is 5, and n is 499, the answer is 5/499. Therefore, guessing them vice versa is NOT guessing the correct m AND the correct n.
Yes, as Chew-Seong Cheong said, m/n for as 499/5 and 5/499 is completely different. Therefore, there is no double counting involved.
If m is 499, and n is 5, the answer would be 499/5. However, if m is 5, and n is 499, the answer is 5/499. Therefore, guessing them vice versa is NOT guessing the correct m AND the correct n.
Log in to reply
It's an issue of grouping things in language. When I see "the correct m and n" I don't think that means the same as "the correct m and the correct n". I see that as "the correct pair: {m,n}."
But don't worry too much about it - apparently nobody else is reading it this way.
Log in to reply
Ok. I see your point. I will change it for good measure.
Hi, sorry i'm reviewing for this topic, but i cant seem to understand why the solution above looks for integers coprime to 504 if we're looking for integers that add up to 504? Am i missing something in my train of thought?
Log in to reply
Yeah. So imagine on an AIME, you get an answer like 3/18, and it asks for fully simplified form, and add the numerator and denominator. If you put 3+18 = 21, you get it WRONG as it isn't simplified (I almost did that in this year's AIME). The correct answer would be 1/6 and 1+6 = 7. Therefore, not all pairs that add up to 504 are eligible as my dog's m and n, as the problem states m and n are both chosen correctly.
Now, let's see when a case is INVALID. say m and n are ak and bk, where k is a multiple of a prime. in that case, 504 = k(a+b). As a result, if m and n are NOT In simplest form, they have a prime factor in common with 504! This is why we find relatively prime integers to 504. How we do that is shown in the other solutions.
The problem is effectively asking how many ways can two relatively prime positive integers add up to 504. If m and n are NOT relatively prime, their GCD can be any factor of 504. This means you want to find how many numbers are relatively prime to 504. This is simply φ(504). This is 504 * 7 6 * 2 1 * 3 2 = 144 .
Problem Loading...
Note Loading...
Set Loading...
Similar explanation as @Arindam Kulkarni's, but with more details.
As mentioned by Arindam, the problem is effectively asking how many two relatively prime positive integers or coprime positive integers add up to 5 0 4 . The integers m and n are coprime integers if their greatest common divisor is 1 or g cd ( m , n ) = 1 . That is m and n don't share any common divisor other than 1 . To find the number of positive integers that are coprime to 5 0 4 , we use the Euler's totient function ϕ ( 5 0 4 ) which is computed as follows:
ϕ ( n ) ⟹ ϕ ( 5 0 4 ) = n ( 1 − p 1 1 ) ( 1 − p 2 1 ) ( 1 − p 3 1 ) ⋯ ( 1 − p k 1 ) = 5 0 4 × 2 1 × 3 2 × 7 6 = 1 4 4 where p 1 , p 2 , p 3 , ⋯ p k are all the prime divisors of n . Since 5 0 4 = 2 3 × 3 3 × 7
Since Arindam's dog makes 1 guess out of 1 4 4 possibilities, the probability of guessing the right answer is 1 4 4 1 .