What is the hardest math question

Goldbach's Conjecture precipitated from letters in 1742 between German mathematician Christian Goldbach and legendary Swiss mathematician Leonhard Euler, considered one of the greatest in math history. As Euler put it, "I regard [it] as a completely certain theorem, although I cannot prove it."

Euler may have sensed what makes this problem counterintuitively hard to solve. When you look at larger numbers, they have more ways of being written as sums of primes, not less. Like how 3+5 is the only way to break 8 into two primes, but 42 can broken into 5+37, 11+31, 13+29, and 19+23. So it feels like Goldbach's Conjecture is an understatement for very large numbers.

Still, a proof of the conjecture for all numbers eludes mathematicians to this day. It stands as one of the oldest open questions in all of math.

dividing and multiplying decimals