Let f ( x ) be the unique polynomial that satisfies
f ( n ) = i = 1 ∑ n i 1 0 1 , for all positive integers n .
The leading coefficient of f ( n ) can be expressed as b a , where a and b are positive coprime integers. What is the value of a + b ?
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.
Nicely done!
I was wondering if we can use the Pattern recognition here.
i = 1 ∑ n i = 2 n ( n + 1 ) The leading coefficient is 1/2.
i = 1 ∑ n i 2 = 6 n ( n + 1 ) ( 2 n + 1 ) The leading coefficient is 1/3.
i = 1 ∑ n i 3 = ( 2 n ( n + 1 ) ) 2 The leading coefficient is 1/4.
From the pattern, the leading coefficient for i = 1 ∑ n i x is 1/(x+1). Is this enough or do we need to be more rigorous?
I didn't get the third line...
Log in to reply
Me too, how does the subtraction give a(k)kn^(k-1) ?
You may also see Faulhaber's formula
f ( n ) = n 1 0 1 + f ( n − 1 ) , f ( 1 ) = 1 . We shall assume f(x) is a polynomial of degree 102. It follows that i = 0 ∑ 1 0 2 a i n i = n 1 0 1 + i = 0 ∑ 1 0 2 a i ( n − 1 ) i i = 0 ∑ 1 0 2 a i ( n i − ( n − 1 ) i ) = n 1 0 1 By the difference of powers formula n 1 0 1 = i = 0 ∑ 1 0 2 a i ( n i − ( n i − 1 ) ) ( n i − 1 + n i − 2 ( n − 1 ) + . . . + n ( n − 1 ) i − 2 + ( n − 1 ) i − 1 ) = i = 0 ∑ 1 0 2 a i ( n i − 1 + n i − 2 ( n − 1 ) + . . . + n ( n − 1 ) i − 2 + ( n − 1 ) i − 1 ) In the i=102 term of the summation, we have a polynomial of degree 101 with a leading term of a i 1 0 2 n 1 0 1 . As this is the only source of n 1 0 1 in the summation, a i = 1 0 2 1
Why can we "assume f ( x ) is a polynomial of degree 102"?
What happens if your assumption doesn't hold?
Log in to reply
Thanks, I should have mentioned at the end that if f ( n ) is of degree i , there must be some n i − 1 terms left behind by the final summation above. Since only n 1 0 1 is left over, this cannot be true. Also by the summation the degree can't be less than 102 as there will be no n 1 0 1 terms at all.
Note that i = 1 ∑ n ( ( i + 1 ) 1 0 2 − i 1 0 2 ) = ( n + 1 ) 1 0 2 − 1 i.e. i = 1 ∑ n ( ( 1 1 0 2 ) i 1 0 1 + … ) = n 1 0 2 + … where the dots don't denote infinite sum but sum of terms which we don't care about, now just divide the equation by ( 1 1 0 2 ) = 1 0 2 we get leading coefficient $$\frac{1}{102}$$ Hence $$a + b = \boxed{103}$$
use property of converting summation into integral u will get (n^102)/102 so ans is 1+102
Can you please elaborate?
Problem Loading...
Note Loading...
Set Loading...
Let f ( x ) = a 0 + a 1 x + . . . + a k x k . Then f ( n ) = a 0 + . . . + a k n k and f ( n − 1 ) = a 0 + . . . + a k ( n − 1 ) k . f ( n ) − f ( n − 1 ) = n 1 0 1 = a k k n k − 1 + . . . . So we have k − 1 = 1 0 1 and a k k = 1 ⟹ a k = 1 0 2 1 .