19/04/20 00:22:41.40 E/H8FvM1.net
>>693
つづき
URLﾘﾝｸ(en.wikipedia.org)
This is a timeline of pure and applied mathematics history.
(抜粋)
21st century
2002 ? Manindra Agrawal, Nitin Saxena, and Neeraj Kayal of IIT Kanpur present an unconditional deterministic polynomial time algorithm to determine whether a given number is prime (the AKS primality test).
2002 ? Yasumasa Kanada, Y. Ushiro, Hisayasu Kuroda, Makoto Kudoh and a team of nine more compute π to 1241.1 billion digits using a Hitachi 64-node supercomputer.
2002 ? Preda Mih?ilescu proves Catalan's conjecture.
2003 ? Grigori Perelman proves the Poincare conjecture.
2004 ? Ben Green and Terence Tao prove the Green-Tao theorem.
2007 ? a team of researchers throughout North America and Europe used networks of computers to map E8.[16]
2009 ? Fundamental lemma (Langlands program) had been proved by Ngo B?o Chau.[17]
2010 ? Larry Guth and Nets Hawk Katz solve the Erd?s distinct distances problem.
2013 ? Yitang Zhang proves the first finite bound on gaps between prime numbers.[18]
2014 ? Project Flyspeck[19] announces that it completed proof of Kepler's conjecture.[20][21][22][23]
2014 ? Using Alexander Yee's y-cruncher "houkouonchi" successfully calculated π to 13.3 trillion digits.[24]
2015 ? Terence Tao solved The Erdos Discrepancy Problem
2015 ? Laszlo Babai found that a quasipolynomial complexity algorithm would solve the Graph isomorphism problem
2016 ? Using Alexander Yee's y-cruncher Peter Trueb successfully calculated π to 22.4 trillion digits[25]
2019 ? using y-cruncher v0.7.6 Emma Haruka Iwao calculated π to 31.4 trillion digits.[26]
(引用終り)
以上
以上