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