Let a “lonely coefficient” be a coefficient that only appears once in a trinomial expansion.
For example, when the trinomial ( a + b + c ) 2 is expanded, it becomes a 2 + b 2 + c 2 + 2 a b + 2 a c + 2 b c , where a coefficient of 1 appears 3 times and a coefficient of 2 appears 3 times. No coefficient appears only once, so there are no lonely coefficients in the trinomial expansion of ( a + b + c ) 2 .
However, when the trinomial ( a + b + c ) 3 is expanded, it becomes a 3 + b 3 + c 3 + 3 a 2 b + 3 a b 2 + 3 a 2 c + 3 a c 2 + 3 b 2 c + 3 b c 2 + 6 a b c , where a coefficient of 1 appears 3 times, a coefficient of 3 appears 6 times, and a coefficient of 6 appears 1 time. Therefore, 6 is a lonely coefficient because it appears only once in the trinomial expansion of ( a + b + c ) 3 .
Let the function A ( n ) represent the total number of positive integer exponents less than or equal to n of the trinomial expansion ( a + b + c ) n that has at least 1 lonely coefficient. For example, A ( 2 ) = 0 , because neither ( a + b + c ) 1 nor ( a + b + c ) 2 have any lonely coefficients, but A ( 3 ) = 1 because ( a + b + c ) 3 has 1 lonely coefficient.
n → ∞ lim n A ( n ) can be expressed as q p , where p and q are coprime positive integers. Find p + q .
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.
Nice solution!
The coefficients of an expanded trinomial correspond to the numbers in different layers of Pascal's pyramid , in which each layer is a triangle with three-way symmetry that can be obtained by adding the three numbers above it. The first few layers are:
The only time a "lonely coefficient" appears is in the center of a triangular layer, which is only possible if the triangular number 2 ( n + 1 ) ( n + 2 ) (for each Layer n ) is not divisible by 3 . Inspecting the equation, we see that this can only occur if n ≡ 0 ( m o d 3 ) (as n + 2 is divisible by 3 for n ≡ 1 ( m o d 3 ) and n + 1 is divisible by 3 for n ≡ 2 ( m o d 3 ) ).
Therefore, n → ∞ lim n A ( n ) = 3 1 , so p = 1 and q = 3 , and p + q = 1 + 3 = 4 .
Problem Loading...
Note Loading...
Set Loading...
Let p + q + r = n , then the coefficent of a p b q c r in the expansion of ( a + b + c ) n is equal to p ! q ! r ! n ! , so it is also the same as the coefficent of a q b q c r .
So, if there exists a lonely coefficent, that means p = q = r , and we cannot "trade the places of the exponential".
We have n must be a multiple of 3 (because n = p + q + r = 3 p ), but we are not sure about if every multiple of 3 will work.
Fortunely, the maximum value of p ! q ! r ! n ! occurs when p = q = r , so of course that coefficent is lonely for every n is a multiple of 3
Hence, the probability equals 3 1