NISHIO Hirokazu[English][日本語]

Infinite sum compression using the inverse of a formal power series

Count up the number of ways to express N as a sum of positive integers. However, distinguish between different orders of sums.

  • $F = \sum_{n=1}^\infty x^n$,[$ G = \sum_{n=0}^\infty F^n
  • $[x^n]G$ is the answer
  • Replace the infinite sum of G with the inverse original
    • $G = \sum_{n=0}^\infty F^n = \frac{1}{1 - F}$
  • The infinite sum of F is also replaced by the inverse element
    • $F = \sum_{n=1}^\infty x^n = \sum_{n=0}^\infty x^{n+1} = x\sum_{n=0}^\infty x^n = \frac{x}{1-x}$
  • Substitute F for G
    • $G = \frac{1}{1 - F} = \frac{1}{1-\frac{x}{1-x}} = (1-x) \frac{1}{1-2x}$
  • where the $2x$ part is a formal power series, so we can return to infinite sums, which we will call J
  • $J = \frac{1}{1-2x} = \sum_{n=0}^\infty (2x)^n$
    • $[x^n]J = 2^n$
    • From here $[x^n] G = x^nJ = [x^n]J - [x^{n-1}]J = 2^n - 2^{n-1} = 2^{n-1}$

This page is auto-translated from /nishio/形式的べき級数の逆元を使った無限和圧縮 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.


(C)NISHIO Hirokazu / Converted from Markdown (en)
Source: [GitHub] / [Scrapbox]