<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Math on Jasper</title><link>https://jasper-aa64.github.io/tags/math/</link><description>Recent content in Math on Jasper</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Tue, 28 Apr 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://jasper-aa64.github.io/tags/math/index.xml" rel="self" type="application/rss+xml"/><item><title>Matrix #1: Matrix Fast Power — Linear Recurrence, DP Semirings &amp; Kitamasa</title><link>https://jasper-aa64.github.io/posts/matrix-1-fast-exponentiation/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/matrix-1-fast-exponentiation/</guid><description>Matrix fast power for linear recurrences (4 patterns), 4 semiring templates (count/bool/min-plus/max-plus), matrix+segment tree for range-add Fibonacci queries, Kitamasa O(k²logn) and NTT O(k log²k logn).</description></item><item><title>Matrix #2: Gaussian Elimination — Real, Mod, Mod-2, Incremental</title><link>https://jasper-aa64.github.io/posts/matrix-2-gaussian-elimination/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/matrix-2-gaussian-elimination/</guid><description>Gauss elimination: real/mod/mod-2 templates (solve, det, inv, rank); incremental online RREF; Extended Lights Out, CF 1344F abstract GF(2) modelling, 2024 ICPC Kunming interactive tree queries.</description></item><item><title>Matrix #3: Linear Basis (XOR Basis) &amp; Simplex Method</title><link>https://jasper-aa64.github.io/posts/matrix-3-linear-basis/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/matrix-3-linear-basis/</guid><description>XOR linear basis: full template with kth, range basis, normalisation; Nowcoder median example; CF 1101G prefix-XOR rank; gym 104768 C XOR-divisibility; Simplex LP solver.</description></item><item><title>Matrix #4: Matrix Problems — Fibonacci Subarray Sums, Gaussian Elimination &amp; Expected Value</title><link>https://jasper-aa64.github.io/posts/matrix-4-problems/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/matrix-4-problems/</guid><description>Hard matrix problems: Fibonacci squared subarray sum with segment-tree 4-tuple and companion matrix; cycle-decomposition partition state space for random-swap sorting, first-step analysis, and Gaussian elimination.</description></item><item><title>Number Theory #0: Common Formulae — Legendre's Formula &amp; Divisor Convolutions</title><link>https://jasper-aa64.github.io/posts/number-theory-0-common-formulae/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-0-common-formulae/</guid><description>Legendre&amp;rsquo;s formula, divisor and multiple convolutions in O(n log n), offline-difference batch processing for H(n)=Σf(d)g(⌊n/d⌋).</description></item><item><title>Number Theory #1: Elementary Number Theory — GCD, LCM, Euler, CRT</title><link>https://jasper-aa64.github.io/posts/number-theory-1-elementary/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-1-elementary/</guid><description>GCD/LCM properties, Bézout/Frobenius, Euler&amp;rsquo;s theorem with power-tower reduction and φ-chain technique, congruence system merging via exGCD, CRT, and n! prime factorisation via Legendre&amp;rsquo;s formula.</description></item><item><title>Number Theory #1.1: Divisibility Blocking (Floor-Division Decomposition)</title><link>https://jasper-aa64.github.io/posts/number-theory-1-1-divisibility-blocking/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-1-1-divisibility-blocking/</guid><description>Divisibility blocking for O(sqrt n) floor-sum evaluation: lemma, single-variable loop, O(1) interval sum requirements, two-variable min-trick, multi-variable pseudocode, and ceiling-division blocking.</description></item><item><title>Number Theory #2-ex: Möbius Practice — LCM Sums, Divisor-Count, Omega Numbers</title><link>https://jasper-aa64.github.io/posts/number-theory-2-ex-mobius-practice/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-2-ex-mobius-practice/</guid><description>Practice problems for Möbius inversion: LCMSUM, two-variable lcm sum (O(n^3/4)), FSF&amp;rsquo;s game with offline difference, divisor-count sum d(ij), Omega Numbers with Dirichlet suffix sum.</description></item><item><title>Number Theory #2-ex: Möbius Techniques</title><link>https://jasper-aa64.github.io/posts/number-theory-2-ex-mobius-techniques/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-2-ex-mobius-techniques/</guid><description>Seven core techniques for Möbius inversion problems: loop shortening, gcd indicator expansion, coprimality reduction, Dirichlet convolution via T=dk, divisor symmetry, diagonal symmetry, and value-domain cnt[] tricks.</description></item><item><title>Number Theory #2: Multiplicative Functions, Möbius Inversion &amp; Dirichlet Convolution</title><link>https://jasper-aa64.github.io/posts/number-theory-2-multiplicative-functions/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-2-multiplicative-functions/</guid><description>Multiplicative functions, single-point and linear-sieve evaluation; Möbius function, both forms of Möbius inversion with full derivations and examples; Dirichlet convolution, key identities, Du Jiao sieve; generalized Möbius inversion on posets.</description></item><item><title>Number Theory #3: From Eratosthenes to Möbius Inclusion-Exclusion</title><link>https://jasper-aa64.github.io/posts/number-theory-3-sieve-mobius-inclusion-exclusion/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-3-sieve-mobius-inclusion-exclusion/</guid><description>Eratosthenes sieve for μ; g/f/h framework; Conclusions 1 and 2 with derivations and tables; GCD table intuition; CF 803F Coprime Subsequences with bottom-up and Möbius approaches.</description></item><item><title>Number Theory #3.1: Sieve Problems — Coin System DP via Sieve</title><link>https://jasper-aa64.github.io/posts/number-theory-3-1-sieve-problems/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-3-1-sieve-problems/</guid><description>Greedy optimality for divisibility-chain coin systems, DP over the maximum denomination, and a sieve-style transition by adding one larger coin.</description></item><item><title>Number Theory #4: Min_25 Sieve and Du Jiao Sieve</title><link>https://jasper-aa64.github.io/posts/number-theory-4-min25-du-jiao-sieve/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-4-min25-du-jiao-sieve/</guid><description>Min_25 sieve: theory, two complete examples, Lagrange interpolation for power sums. Du Jiao sieve: template, P3768, GCD sum, LCM sum.</description></item><item><title>Number Theory #4: Primality, Factorisation &amp; Residues (Miller-Rabin, Pollard Rho, Tonelli-Shanks)</title><link>https://jasper-aa64.github.io/posts/number-theory-4-primality-factorisation-residues/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-4-primality-factorisation-residues/</guid><description>Miller-Rabin primality test, Pollard Rho factorisation, Tonelli-Shanks for quadratic residues, cubic residues via F_p[t]/(t^3-a), quartic residues by double square root, and general k-th residues via primitive root + BSGS, plus N-th residues mod composite.</description></item><item><title>Combinatorics: Order Theory — Chromatic Polynomials, Chordal Graphs, Order Polynomials, Dilworth &amp; Hall</title><link>https://jasper-aa64.github.io/posts/combinatorics-order-theory/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-order-theory/</guid><description>Chromatic polynomial, chordal/interval graphs, PEO product formula, order polynomials (chain/antichain/tree/DAG/divisor lattice), MacMahon formula, Dilworth, Mirsky, Hall&amp;rsquo;s marriage theorem, Erdős–Szekeres, missile interception.</description></item><item><title>Combinatorics #2-ex1: Difference (Correlation) Convolution</title><link>https://jasper-aa64.github.io/posts/combinatorics-2-ex1-difference-convolution/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-2-ex1-difference-convolution/</guid><description>Cross-correlation via ordinary convolution: reverse-A and reverse-B extraction methods, derivation, and Ring Trick II (cyclic shift score maximisation via difference convolution).</description></item><item><title>Combinatorics #2-ex2: Cyclic Convolution</title><link>https://jasper-aa64.github.io/posts/combinatorics-2-ex2-cyclic-convolution/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-2-ex2-cyclic-convolution/</guid><description>Cyclic convolution definition, FFT/NTT implementation for n=2^k, zero-padding, why n must be a power of two, and the fold-back technique for arbitrary n.</description></item><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><item><title>Combinatorics #1.1: Permutations and Combinations</title><link>https://jasper-aa64.github.io/posts/combinatorics-1-1-permutations-combinations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-1-1-permutations-combinations/</guid><description>Hockey Stick identity, addition/multiplication principles, binomial identities, example problems: bitonic sequences, multiset permutations, multi-layer coloring DP, CCPC Subpermutation.</description></item><item><title>Combinatorics D1: Diophantine Equations</title><link>https://jasper-aa64.github.io/posts/combinatorics-d1-diophantine-equations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-d1-diophantine-equations/</guid><description>Stars and bars, bounded Diophantine equations via inclusion-exclusion, prefix-sum DP, D&amp;amp;C NTT, equal-cap formula, and a full worked example on CF 2127F.</description></item><item><title>Combinatorics #0: Common Formulae &amp; Conclusions</title><link>https://jasper-aa64.github.io/posts/combinatorics-0-common-formulae-conclusions/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-0-common-formulae-conclusions/</guid><description>A compact toolkit of geometric sums, floor-sum transformations, XOR facts, Fibonacci identities, and perfect-square patterns.</description></item><item><title>Combinatorics #0.1: 计数中常用的结论</title><link>https://jasper-aa64.github.io/posts/combinatorics-1-counting-conclusions/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-1-counting-conclusions/</guid><description>常见计数结论、Lucas 定理、不定方程解计数、平面分拆、DAG 路径计数、多项式平移、XOR 均匀性与若干竞赛常用结论。</description></item><item><title>Combinatorics #1.2: Inclusion-Exclusion, Bounded Diophantine Equations, and Derangements</title><link>https://jasper-aa64.github.io/posts/combinatorics-1-2-inclusion-exclusion-diophantine-derangements/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-1-2-inclusion-exclusion-diophantine-derangements/</guid><description>Inclusion-exclusion in set and operator form, equal-count subproblems, bounded Diophantine counting, derangements, Stirling numbers, and selected contest problems.</description></item></channel></rss>