Analyzing the Setup
The problem asks us to find the coefficient of
x2 in the expression:
(1+x)2+(1+x)3+⋯+(1+x)49+(1+mx)50
To simplify this, we split the expression into two distinct parts: the geometric-like series ∑k=249(1+x)k and the final term (1+mx)50. By isolating these, we transform a complex expansion into two manageable components.
The Hockey-stick Magic
For any binomial expansion (1+x)k, the general term is (rk)xr. To find the coefficient of x2, we set r=2, yielding the term (2k).
The coefficient of
x2 in the series is the sum:
k=2∑49(2k)=(22)+(23)+(24)+⋯+(249)
We invoke the
Hockey-stick Identity, which states that
∑r=kn(kr)=(k+1n+1). Applying this with
k=2 and
n=49, the entire sum collapses into:
(350)
The Algebraic Dance
Next, we examine the term
(1+mx)50. The general term is
(r50)(mx)r, and setting
r=2 gives the coefficient:
(250)m2
Combining these, the total coefficient of
x2 is
(350)+(250)m2. We are given that this must equal
(3n+1)(351), leading to the master equation:
(350)+(250)m2=(3n+1)(351)
The Final Calculation
Expanding the combinations, we have:
650⋅49⋅48+250⋅49m2=(3n+1)651⋅50⋅49
Dividing the entire equation by the common factor
650⋅49, we simplify the expression significantly:
48+3m2=(3n+1)⋅51
Expanding the right side yields
48+3m2=153n+51. Subtracting
48 from both sides and dividing by
3, we arrive at the elegant relation:
m2=51n+1
We seek the smallest positive integer
n such that
51n+1 is a perfect square. Testing values for
n, we find that for
n=5:
m2=51(5)+1=255+1=256=162
Thus, the smallest positive integer n is 5.