Scientists have trained a computer algorithm to complete a nearly century-old math problem in a mere half hour. Keller’s conjecture, a tessellation problem about the way certain shapes tile in ...

For close to 40 years, a simple little hypothesis has been quietly sitting in a corner of graph theory, minding its own business. Known as the “bunkbed conjecture”, it always seemed kind of ...

A Rochester Institute of Technology doctoral student was part of a team of researchers that settled a 90-year-old math problem called Keller’s conjecture. David Narváez, who studies computing ...

The Collatz conjecture was first posed in 1937. It’s simple enough that an elementary school student can make their way through it. Start by picking a number. Designate that number ‘n’.

The conjecture itself can be formulated so simply that even primary school students understand it. Take a natural number. If it is odd, multiply it by 3 and add 1; if it is even, divide it by 2.

10 of the Hardest Math Problems Ever Solved; The abc conjecture has some commonalities with the Pythagorean theorem and other diophantine problems, ...

The conjecture also shows that there are a finite number of instances where d is smaller than c. Mochizuki claims to have cracked this conjecture in a 500-page proof.

Last week, Yitang “Tom” Zhang, a popular math professor at the University of New Hampshire, ... The conjecture that the primes contain arbitrarily long arithmetic progressions, ...

The conjecture bears on the estimation of the frequencies of a round drum or, in mathematical terms, the eigenvalues of a disk. Pólya himself confirmed his conjecture in 1961 for domains that ...