<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Inclusion-Exclusion on Jasper</title><link>https://jasper-aa64.github.io/tags/inclusion-exclusion/</link><description>Recent content in Inclusion-Exclusion 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/inclusion-exclusion/index.xml" rel="self" type="application/rss+xml"/><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>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 #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>