<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The largest prime factor of $n^2+1$ and improvements on subexponential $ABC$ · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2312.03566/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2312.03566/feed.xml" rel="self" type="application/rss+xml" /><item><title>The largest prime factor of $n^2+1$ and improvements on subexponential $ABC$ — mentioned by rurban</title><link>https://news.ycombinator.com/item?id=41863307</link><guid isPermaLink="false">urn:hackerpapers:mention:2312.03566:41863307</guid><pubDate>Wed, 16 Oct 2024 20:09:20 GMT</pubDate><description>&lt;p&gt;I was looking for Pasten&amp;#x27;s paper from Feb 24, but didnt find it publicly. https://doi.org/10.1007/s00222-024-01244-6 This summary is unsatisfying. Ah, here it is in clear: https://arxiv.org/abs/2312.03566&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2312.03566/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.NT</category></item></channel></rss>
