One of my favourite parodies of this "brain teaser" format invokes Fermat's last theorem: [0]<p>0: <a href="https://i.imgur.com/5QGR1Lt.jpeg" rel="nofollow">https://i.imgur.com/5QGR1Lt.jpeg</a>
To get a sense of how far one could push these fruit problems, see Matiyasevich’s Theorem (<a href="http://www.scholarpedia.org/article/Matiyasevich_theorem" rel="nofollow">http://www.scholarpedia.org/article/Matiyasevich_theorem</a>).<p>My understanding is a bit fuzzy, but it basically says you can encode any recursively enumerable set in terms of solutions to Diophantine equations (i.e. integer polynomials).<p>In particular you can encode, say, the set of all Turing Machines which halt in terms of the solutions to some integer polynomial.
See further discussion here:
<a href="https://old.reddit.com/r/math/comments/osfc0x/you_know_those_annoying_fruit_equation_memes/" rel="nofollow">https://old.reddit.com/r/math/comments/osfc0x/you_know_those...</a>