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