Ads
related to: simple but hard math problem
Search results
Results From The WOW.Com Content Network
Here’s another problem that’s very easy to write, but hard to solve. All you need to recall is the definition of rational numbers. Rational numbers can be written in the form p/q, where p and ...
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
Quadratic programming (NP-hard in some cases, P if convex) Subset sum problem [3]: SP13 Variations on the Traveling salesman problem. The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric.
Closer to the Collatz problem is the following universally quantified problem: Given g, does the sequence of iterates g k (n) reach 1, for all n > 0? Modifying the condition in this way can make a problem either harder or easier to solve (intuitively, it is harder to justify a positive answer but might be easier to justify a negative one).
With the seeming simplicity of the problem, it's understandable why people are so frustrated -- but if you happen to be good at math, it can be amusing too. Show comments Advertisement
For premium support please call: 800-290-4726 more ways to reach us
Ad
related to: simple but hard math problem