Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Claims

../

2026_03_18_chojecki: A write-up that Przemyslaw Chojecki posted on 18 March 2026, which Chojecki says came out of work with GPT-5.4 Pro, bounds the number of ordered representations of nn as a sum of two powerful numbers by n2/5+εn^{2/5+\varepsilon}. The claim is unreviewed.

2026_10_19_plasma_ai: An author-recorded quadratic-norm count and dyadic interpolation bound the number of ordered representations of NN as a sum of two positive powerful integers by N2/5+o(1)N^{2/5+o(1)}; tier 0, catalog acceptance pending.