<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Prime Numbers on akos.ma</title><link>https://akos.ma/tags/prime-numbers/</link><description>Recent content in Prime Numbers on akos.ma</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Fri, 02 May 2025 00:00:00 +0200</lastBuildDate><atom:link href="https://akos.ma/tags/prime-numbers/index.xml" rel="self" type="application/rss+xml"/><item><title>Translating the Formula for Primes to Rust With AI</title><link>https://akos.ma/blog/translating-the-formula-for-primes-to-rust-with-ai/</link><pubDate>Fri, 02 May 2025 00:00:00 +0200</pubDate><guid>https://akos.ma/blog/translating-the-formula-for-primes-to-rust-with-ai/</guid><description>After creating the C++ version of C. P. Willans&amp;rsquo; formula for primes last week, I asked myself what other language is usually pitted as the fastest ever? And the answer, of course, is Rust.</description></item><item><title>Translating the Formula for Primes to C++ with AI</title><link>https://akos.ma/blog/translating-the-formula-for-primes-to-cpp-with-ai/</link><pubDate>Fri, 25 Apr 2025 00:00:00 +0200</pubDate><guid>https://akos.ma/blog/translating-the-formula-for-primes-to-cpp-with-ai/</guid><description>Some of you might remember an article I published more or less a year ago, called &amp;ldquo;Mathematical Curiosities&amp;rdquo;. In that article I showed an indeed curious formula: the 1964 “Formula for Primes” by C. P. Willans.</description></item><item><title>Mathematical Curiosities</title><link>https://akos.ma/blog/mathematical-curiosities/</link><pubDate>Fri, 31 May 2024 00:00:00 +0200</pubDate><guid>https://akos.ma/blog/mathematical-curiosities/</guid><description>This post contains some interesting mathematical curiosities I&amp;rsquo;ve recently learned about.</description></item></channel></rss>