<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Generating-Function on Jasper</title><link>https://jasper-aa64.github.io/tags/generating-function/</link><description>Recent content in Generating-Function on Jasper</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 25 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://jasper-aa64.github.io/tags/generating-function/index.xml" rel="self" type="application/rss+xml"/><item><title>Combinatorics #2.1: FFT and Lagrange Interpolation</title><link>https://jasper-aa64.github.io/posts/combinatorics-2-1-fft-lagrange-interpolation/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-2-1-fft-lagrange-interpolation/</guid><description>Polynomial representations, FFT/DFT over complex numbers, Triple Sums, Fuzzy Search (difference convolution), FFT template, Lagrange interpolation (O(n²) and O(n) equidistant), sum of k-th powers, Assigning Prizes polynomial DP.</description></item><item><title>Combinatorics #2.2: Primitive Roots, Discrete Logarithm, NTT, Divide-and-Conquer NTT</title><link>https://jasper-aa64.github.io/posts/combinatorics-2-2-primitive-roots-ntt/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-2-2-primitive-roots-ntt/</guid><description>Order and primitive roots (Euler&amp;rsquo;s theorem, BSGS, exBSGS), discrete index as logarithm analogue, SGU 261 Discrete Roots, NTT theory and templates, divide-and-conquer NTT (product tree), Wannafly D team selection, Nowcoder 50F generating functions.</description></item><item><title>Combinatorics #3.1: Ordinary Generating Functions</title><link>https://jasper-aa64.github.io/posts/combinatorics-3-1-ordinary-generating-functions/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-3-1-ordinary-generating-functions/</guid><description>Formal power series basics, ordinary generating functions, inversion identities, generalized binomial expansions, bounded counting examples, and recurrence-to-closed-form examples such as Fibonacci and Catalan.</description></item><item><title>Combinatorics #3.2: More Operations on Formal Power Series</title><link>https://jasper-aa64.github.io/posts/combinatorics-3-2-more-operations-on-formal-power-series/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-3-2-more-operations-on-formal-power-series/</guid><description>Newton iteration for polynomial inverse and square root, derivative/integral/composition of formal power series, logarithm and exponential of series, and worked examples including CF438E and a bad-modulus complete-knapsack generating function.</description></item></channel></rss>