<?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/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:media="http://search.yahoo.com/mrss/"><channel><title>Optimisation auf Nicky Reinert</title><link>https://nickyreinert.de/en/topics/optimisation/</link><description>Blog &amp; projects by Nicky Reinert (Institute for Digital Challenges): web development &amp; software development, SEO &amp; analytics, hosting &amp; DevOps, WordPress &amp; Hugo, tools &amp; projects, data protection &amp; digital culture — plus content on AI and autism &amp; society.</description><generator>Hugo 0.148.2</generator><language>en</language><managingEditor/><webMaster/><copyright/><lastBuildDate>Sat, 11 Nov 2023 12:34:56 +0100</lastBuildDate><atom:link href="https://nickyreinert.de/en/topics/optimisation/index.xml" rel="self" type="application/rss+xml"/><item><title>How to find prime numbers in Python. Feat. Cython.</title><link>https://nickyreinert.de/en/2023/2023-11-11-prime-numbers-python/</link><pubDate>Sat, 11 Nov 2023 12:34:56 +0100</pubDate><author/><guid>https://nickyreinert.de/en/2023/2023-11-11-prime-numbers-python/</guid><description>[PYTHON] How to find Prime Numbers. Fast. Feat. Cython. There is only one thing that I love more than algorithms: Improving algorithms! This article will not explain one of those sophisticated prime solving formulas — but it will show you, how thoughtful thinking and tinkering will help you with …</description><category>blog</category><media:content url="https://nickyreinert.de/primes.png" type="image/jpeg"><media:title>Prime Numbers Python Tutorial</media:title></media:content><dc:subject>Lesezeit: 5 Minuten</dc:subject><dc:type>tutorial</dc:type></item></channel></rss>