I Open problems and conjectures in Mathematics

  • I
  • Thread starter Thread starter flamengo
  • Start date Start date
  • Tags Tags
    Mathematics
flamengo
Messages
24
Reaction score
0
I know this can be a silly question but it's a curiosity of mine and I have no idea what the answer is, so I'll ask anyway. The question is: How many open problems and conjectures are there in Mathematics currently ? I'm sure nobody knows the exact number but an approximation would be nice. Thanks in advance.
 
Mathematics news on Phys.org
I don't think you can count them. There are a few famous ones, a few less famous ones, but every topic a mathematician works on (or plans to work on in the future) is an open problem - otherwise they wouldn't work on it. The Mathematics Genealogy Project knows about 210,000 mathematicians, most of them still alive, the actual number will be even higher, so going by that we have at least hundreds of thousands of problems someone is investigating.

How do you count open problems? The Collatz conjecture is certainly an open problem. If you replace the 3n+1 rule by 5n+1, is it a different open problem, or is it a variant of the same open problem? If it is different, we can generate infinitely many open problems. Otherwise: How much do we have to vary it until we count it as separate problem?
 
  • Like
Likes flamengo
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top