For sufficiently large n, BusyBeaver of n+1, is at least the square of Busy Beaver of n. Proven by Jan, 1, 2051.

Created by JoshuaZ on 2020-07-23; known on 2051-01-01

• JoshuaZ estimated 64% on 2020-07-23
• JoshuaZ said “Weaker version of Conjecture 13 from here https://www.scottaaronson.com/papers/bb.pdf . ” on 2020-07-23
• JoshuaZ estimated 65% on 2022-07-21