一道东京大学数学题

发布时间 2023-10-27 06:24:38作者: celerity1

定义集合\(S\)(大小为\(m\))(\(S\)\(\{0,2,.....n-1\}\)的子集)的权值:\(2^{S_1}*2^{S_2}*....*2^{S_m}\)
定义\(a_{n,m}\)\(S\)的所有选法的权值之和。
(2)定义多项式\(f_n(x)=a_{n,0}+a_{n,1}x+a_{n,2}x^2+...+a_{n,n}x^n\),求\(\frac{f_{n+1}(x)}{f_{n}(x)},\frac{f_{n+1}(x)}{f_n(2x)}\)
(3)用\(n,k\)表示\(\frac{a_{n+1,k+1}}{a_{n,k}}\)
(2)显然\(f_n\)是数列\(\{a_{n,k}\}\)的母函数
\(f_n(x)=\prod_{i=0}^{n-1}(2^ix+1)\)
\(f_{n+1}(x)\prod_{i=0}^n(2^ix+1)\)
\(\frac{f_{n+1}(x)}{f_{n}(x)}=(2^nx+1)\)
\(f_n(2x)=\prod_{i=0}^{n-1}(2^{i+1}x+1)=\prod_{i=1}^{n}(2^ix+1)\)
\(\frac{f_{n+1}(x)}{f_{n}(2x)}=x+1\)
(3)考虑\(a\)的递推公式:考虑让\(n\)\(1\):枚举有没有选择\(2^{n-1}\)
\(a_{n,m}=a_{n-1,m-1}*2^{n-1}+a_{n-1,m}\)