<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Fri, 01 May 2026 07:34:28 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/number_theory/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Proof: Infinitely many primes that are 3 mod 4]]></title><description><![CDATA[A short and simple proof about prime numbers. I tried to make it very easy to understand. If you are unsure about any step ask in the comments and i try to help :) Let me know if you have any advice or]]></description><link>http://direct.ecency.com/mathematics/@kataquax/k6iop6in</link><guid isPermaLink="true">http://direct.ecency.com/mathematics/@kataquax/k6iop6in</guid><category><![CDATA[mathematics]]></category><dc:creator><![CDATA[kataquax]]></dc:creator><pubDate>Fri, 23 Feb 2018 18:11:03 GMT</pubDate><enclosure url="https://images.ecency.com/p/46aP2QbqUqBqwzwxM6L1P6uLNceBDDCM7aZ7nHpWHw8UTMBWx4oBBUjPL5kBCehwwW3aaBFQW7XhXDsuMEnKvJdRynoh?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>