对任意有限集合 X,令 ∣X∣ 表示 X 中元素的个数。定义其中求和遍历所有有序数对 (A,B),满足 A 和 B 都是 {1,2,3,…,n} 的子集且 ∣A∣=∣B∣。例如,S2=4,因为求和遍历以下子集对:给出 S2=0+1+0+0+1+2=4。设 S2021S2022=qp,其中 p 和 q 是互质正整数。求 p+q 除以 1000 的余数。 Sn=∑∣A∩B∣,(A,B)∈⎩⎨⎧(∅,∅),({1},{1}),({1},{2}),({2},{1}),({2},{2}),({1,2},{1,2})⎭⎬⎫,
For any finite set X, let ∣X∣ denote the number of elements in X. Define Sn=∑∣A∩B∣, where the sum is taken over all ordered pairs (A,B) such that A and B are subsets of {1,2,3,…,n} with ∣A∣=∣B∣. For example, S2=4 because the sum is taken over the pairs of subsets (A,B)∈⎩⎨⎧(∅,∅),({1},{1}),({1},{2}),({2},{1}),({2},{2}),({1,2},{1,2})⎭⎬⎫, giving S2=0+1+0+0+1+2=4. Let S2021S2022=qp, where p and q are relatively prime positive integers. Find the remainder when p+q is divided by 1000.
Count element by element: Sn equals the number of triples (x,A,B) with ∣A∣=∣B∣ and x∈A∩B. For a fixed x and size k, there are (k−1n−1) choices for each of A and B containing x, so by the Vandermonde identity Sn=nk=1∑n(k−1n−1)2=n(n−12n−2).
Therefore S2021S2022=2021(20204040)2022(20214042)=20212022⋅202124042⋅4041=202122⋅2022⋅4041. Since 2021=43⋅47 divides neither 2022,4041=32⋅449, nor 2, this fraction is in lowest terms: p=2⋅2022⋅4041=16341804 and q=20212=4084441.
Then p+q=20426245, whose remainder modulo 1000 is 245.