<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ternary expansions of powers of 2 · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0512006/</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/math_0512006/feed.xml" rel="self" type="application/rss+xml" /><item><title>Ternary expansions of powers of 2 — mentioned by LegionMammal978</title><link>https://news.ycombinator.com/item?id=43423450</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0512006:43423450</guid><pubDate>Thu, 20 Mar 2025 13:53:25 GMT</pubDate><description>&lt;p&gt;Nope, it&amp;#x27;s not that easy in this case. E.g., Erdős conjectured in 1979 that every power of 2 greater than 256 has a digit &amp;#x27;2&amp;#x27; in its ternary expansion [0]. This makes sense heuristically, but no methods since then have come close to proving it. Digits of numbers are a wild beast, and they&amp;#x27;re tough to pin down for a specific sequence. At best, we get statistical results like &amp;quot;almost all sequences of this form have this property&amp;quot;, without actually being able to prove it for any one of them. (Except sometimes for artificially-constructed examples and counterexamples, or special classes like…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0512006/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.DS</category></item></channel></rss>
