{tag=Simple to state but hard to prove}
{wiki}

It is cool how even for such a "simple looking" problem, we were still unable to prove optimality as of 2020.


3SUM

{c}
{tag=Simple to state but hard to prove}
{title2=1937-}
{wiki}

Given stuff like https://arxiv.org/pdf/2107.12475.pdf on <Erdős' conjecture on powers of 2>, it feels like this one will be somewhere close to <computer science>/<Halting problem> issues than <number theory>. Who knows. This is suggested e.g. at <The Busy Beaver Competition: a historical survey by Pascal Michel>.


Collatz conjecture

{tag=Simple to state but hard to prove}

https://en.wikipedia.org/wiki/Transcendental_number#Conjectured_transcendental_numbers

There's a billion simple looking expressions which are not known to be transcendental numbers or not. It's cute <simple to state but hard to prove> at its best.

Open as of 2020:
* $e + \pi$

Bibliography:
* https://www.quantamagazine.org/recounting-the-history-of-maths-transcendental-numbers-20230627/ How Math Achieved Transcendence by David S. Richeson (2023).

\Video[https://www.youtube.com/watch?v=BdHFLfv-ThQ]
{title=Why π^π^π^π could be an integer by Stand-up Maths (2021)}
{description=Sponsored by Jane Street. <finance is a cancer of society>[Shame].}


Ciro Santilli @cirosantilli 35

 Tagged: Simple to state but hard to prove