10 Hardest Math Problems That Remain Unsolved

Teknocrat

JF-Expert Member
Oct 20, 2018
3,688
8,205

1.The Collatz Conjecture
1628290032208.png


2.Goldbach’s Conjecture
1628290180812.jpeg


3.The Twin Prime Conjecture
1628290295187.jpeg


4.The Riemann Hypothesis
1628290336474.png


5.The Birch and Swinnerton-Dyer Conjecture
1628290515846.png


6.The Kissing Number Problem
1628290558163.jpeg


7.The Unknotting Problem
1628290621448.png


8.The Large Cardinal Project
1628290666972.png


9.What’s the Deal with 𝜋+e?
1628290747265.jpeg


10. Is 𝛾 Rational?
1628290905892.png
 
Qn 10 is a problem, the rest are statements. Would you please present them as quesrions and not as statements?
 
Sasa maswali yako wapi? Naona maelezo, mfano hayo machungwa ndio problem gani hiyo?
 
Kuna mwamba anapiga mbaya zote hizo, kila anapocheza draft na chess hakosi kusema hizo zote, daah sasa hivi mwamba yupo Australia kapewa uraia japo bado mwanetu na tz hawamjui na akija hakosi ulinzi na msafara ni gari 5 na hakai zaidi ya siku 5, mtamuona two days the rest no. Tz wenye akili wapo
 
2872922_1628290558163.jpeg


In geometry, the kissing number of a mathematical space is defined as the greatest number of non-overlapping unit spheres that can be arranged in that space such that they each touch a common unit sphere. For a given sphere packing (arrangement of spheres) in a given space, a kissing number can also be defined for each individual sphere as the number of spheres it touches. For a lattice packing the kissing number is the same for every sphere, but for an arbitrary sphere packing the kissing number may vary from one sphere to another.

Other names for kissing number that have been used are Newton number (after the originator of the problem), and contact number.

In general, the kissing number problem seeks the maximum possible kissing number for n-dimensional spheres in (n + 1)-dimensional Euclidean space. Ordinary spheres correspond to two-dimensional closed surfaces in three-dimensional space.

Finding the kissing number when centers of spheres are confined to a line (the one-dimensional case) or a plane (two-dimensional case) is trivial. Proving a solution to the three-dimensional case, despite being easy to conceptualize and model in the physical world, eluded mathematicians until the mid-20th century. Solutions in higher dimensions are considerably more challenging, and only a handful of cases have been solved exactly. For others investigations have determined upper and lower bounds, but not exact solutions............
 
2872922_1628290558163.jpeg


In geometry, the kissing number of a mathematical space is defined as the greatest number of non-overlapping unit spheres that can be arranged in that space such that they each touch a common unit sphere. For a given sphere packing (arrangement of spheres) in a given space, a kissing number can also be defined for each individual sphere as the number of spheres it touches. For a lattice packing the kissing number is the same for every sphere, but for an arbitrary sphere packing the kissing number may vary from one sphere to another.

Other names for kissing number that have been used are Newton number (after the originator of the problem), and contact number.

In general, the kissing number problem seeks the maximum possible kissing number for n-dimensional spheres in (n + 1)-dimensional Euclidean space. Ordinary spheres correspond to two-dimensional closed surfaces in three-dimensional space.

Finding the kissing number when centers of spheres are confined to a line (the one-dimensional case) or a plane (two-dimensional case) is trivial. Proving a solution to the three-dimensional case, despite being easy to conceptualize and model in the physical world, eluded mathematicians until the mid-20th century. Solutions in higher dimensions are considerably more challenging, and only a handful of cases have been solved exactly. For others investigations have determined upper and lower bounds, but not exact solutions............

Kissing # ----namba inayobusu.
 
Kuna mwamba anapiga mbaya zote hizo, kila anapocheza draft na chess hakosi kusema hizo zote, daah sasa hivi mwamba yupo Australia kapewa uraia japo bado mwanetu na tz hawamjui na akija hakosi ulinzi na msafara ni gari 5 na hakai zaidi ya siku 5, mtamuona two days the rest no. Tz wenye akili wapo
Mwamba atakuwa computation and permutation abilities kali sana
 
1 Reactions
Reply
Back
Top Bottom