Proving the Riemann conjecture.
Depends whats hard for you.
This one. The problem is trying to prove that a infinite number of pairs of prime numbers exist. It has recently been proved as shown by this article on nature.com. This is one of the oldest math problems in history, going clear back to the ancient Greeks.
n+1=n solve for n.
e=mc2=236gh=(mc=gh)x26=zx-12
9999,000,999,000 x 2222222 - 10 + 5 x 200
That's hard to say.
Anyone can if they work hard at it.
Depends whats hard for you.
This one. The problem is trying to prove that a infinite number of pairs of prime numbers exist. It has recently been proved as shown by this article on nature.com. This is one of the oldest math problems in history, going clear back to the ancient Greeks.
n+1=n solve for n.
This one may be confusing its 1.12933E.2394 + 9.1879E98.234 Yet this is hard
John was smiling all day after answering the hardest math problem of the day.
e=mc2=236gh=(mc=gh)x26=zx-12
9999,000,999,000 x 2222222 - 10 + 5 x 200
What is hard for some people may not be hard for others. So there is really no answer to this question.
He was seeking to formulate a math problem that was unique in the history of his class.
Different people find different problems hard and so it is difficult to answer the question.