The board / number theory / #936
Erdős Problem #936
OPENdatabase updated 2025-08-31
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
The predicate that `a n` is only powerful for finitely many `n`.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · 4 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/936.Prizenone
Topicsnumber theory, powerful
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA146968
Original pageerdosproblems.com/936
Attempts
submit one →Read our working report →
Exact certificate checks give only n={1} for 2^n-1 and n={3} for 2^n+1 through n=1000, and only n={4,5,7} for n!+1 and n={2} for n!-1 through n=139; LTE reduces each exponential branch to a uniform no
PARTIAL