设 n ≥ k n \geq k n≥k是两个正整数。集合 A = { 1 , 2 , 2 2 , 2 3 , … , 2 n − 1 } A=\{1, 2, 2^2, 2^3, \ldots, 2^{n-1}\} A={1,2,22,23,…,2n−1}共 n n n个数。从 A A A中任取 k k k个数相乘,这样的乘积共有 ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k}=\frac{n!}{k!(n-k)!} (kn)=k!(n−k)!n!个. 把这 ( n k ) \binom{n}{k} (kn)个乘积相加,得到的和记作 a n , k a_{n, k} an,k.
例子: A = { 1 , 2 , 4 } A=\{1, 2, 4\} A={1,2,4}, 则 n = 3 , a 3 , 2 = 2 + 4 + 2 × 4 = 14 n=3, a_{3, 2} = 2+4+2\times 4=14 n=3,a3,2=2+4+2×4=14.
解答下面的问题:
- 设 n ≥ 2 n \geq 2 n≥2. 求 a n , 2 a_{n, 2} an,2.
- 设有多项式 f n ( x ) = 1 + a n , 1 x + a n , 2 x 2 + … + a n , n x n . f_n(x)=1+a_{n, 1}x+a_{n, 2}x^2 + \ldots +a_{n, n}x^n. fn(x)=1+an,1x+an,2x2+…+an,nxn. 已知 f n + 1 ( x ) f n ( x ) \frac{f_{n+1}(x)}{f_n(x)} fn(x)fn+1(x)与 f n + 1 ( x ) f n ( 2 x ) \frac{f_{n+1}(x)}{f_n(2x)} fn(2x)fn+1(x)都是整系数多项式。计算这两个多项式。
- 计算 f n ( x ) f_{n}(x) fn(x).
- 求 a n + 1 , k + 1 a n , k \frac{a_{n+1, k+1}}{a_{n, k}} an,kan+1,k+1. (结果用 n , k n, k n,k表示)
答案:
- a n , 2 = ( 1 / 3 ) ⋅ ( 4 n + 2 ) − 2 n a_{n, 2} = (1/3)\cdot (4^n+2)-2^n an,2=(1/3)⋅(4n+2)−2n.
- f n + 1 ( x ) f n ( x ) = 2 n x + 1 , f n + 1 ( x ) f n ( 2 x ) = x + 1 \frac{f_{n+1}(x)}{f_n(x)}=2^n x + 1, \frac{f_{n+1}(x)}{f_n(2x)}=x+1 fn(x)fn+1(x)=2nx+1,fn(2x)fn+1(x)=x+1.
- f n ( x ) = ∏ j = 0 n − 1 ( 2 j x + 1 ) f_n(x)= \prod_{j=0}^{n-1} (2^jx + 1) fn(x)=∏j=0n−1(2jx+1).
- a n + 1 , k + 1 a n , k = 2 n + k + 1 − 2 k 2 k + 1 − 1 \frac{a_{n+1, k+1}}{a_{n, k}}=\frac{2^{n+k+1}-2^k}{2^{k+1}-1} an,kan+1,k+1=2k+1−12n+k+1−2k.