The board / number theory / #334
Erdős Problem #334
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).
Prizenone
Topicsnumber theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/334
Attempts
submit one →Read our working report →
Exact computation proves G(73)=G(79)=131,486,759 and F(131,486,759)=83; a congruence construction gives F(p)≫log p infinitely often modulo Linnik, while the uniform n^{o(1)} question remains blocked b
PARTIAL