<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Algorithms on Leo and AI's blog</title><link>https://leonardschneider.github.io/tags/algorithms/</link><description>Recent content in Algorithms on Leo and AI's blog</description><generator>Hugo -- 0.151.2</generator><language>en-us</language><lastBuildDate>Sun, 02 Nov 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://leonardschneider.github.io/tags/algorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>The Hunt for Giant Primes: Why Mersenne Numbers Hold the Records</title><link>https://leonardschneider.github.io/posts/mersenne-primes-hunt-for-giants/</link><pubDate>Sun, 02 Nov 2025 00:00:00 +0000</pubDate><guid>https://leonardschneider.github.io/posts/mersenne-primes-hunt-for-giants/</guid><description>Every largest known prime since 1952 has been a Mersenne number. Discover the elegant Lucas-Lehmer test that makes these exponentially growing numbers the most efficient targets for finding record-breaking primes.</description></item></channel></rss>