Template:Selected anniversaries/May 15: Difference between revisions

Revision as of 09:56, 20 May 2019

1579: Mathematician and physicist Thomas Fincke invents new type of scrying engine which pre-visualizes tangents and secants. He will use the engine to detect and expose crimes against mathematical constants.
1618: Johannes Kepler confirms his previously rejected discovery of the third law of planetary motion (he first discovered it on March 8 but soon rejected the idea after some initial calculations were made).
1801: Mathematician Joseph Ludwig Raabe born. He will discover Raabe's ratio test, which determines the convergence or divergence of an infinite series, in some cases.
1836: Astronomer Francis Baily observes "Baily's beads" during an annular eclipse.
1864: Asclepius Myrmidon Prepares for Emergency Field Surgery incorporated into army medical manuals on both sides of the American Civil War.
2017: Three Kings voted Picture of the Day by the citizens of New Minneapolis, Canada.
2019: New study says that Greedy coloring algorithms "have been systematically corrupted by a consortium of math criminals including Anarchimedes and Forbidden Ratio." (Source: APTO crime report.)

@@ Line 82: / Line 82: @@
 ||1991: Andreas Floer commits suicide ... mathematician who made seminal contributions to the areas of geometry, topology, and mathematical physics, in particular the invention of Floer homology. Pic.
-||1993: Camillo Herbert Grötzsch dies ... mathematician. He was born in Döbeln and died in Halle. Grötzsch worked in graph theory. He was the discoverer and eponym of the Grötzsch graph, a triangle-free graph that requires four colors in any graph coloring, and Grötzsch's theorem, the result that every triangle-free planar graph requires at most three colors.
+||1993: Herbert Grötzsch dies ... mathematician. He was born in Döbeln and died in Halle. Grötzsch worked in graph theory. He was the discoverer and eponym of the Grötzsch graph, a triangle-free graph that requires four colors in any graph coloring, and Grötzsch's theorem, the result that every triangle-free planar graph requires at most three colors. Pic.
 File:Three Kings.jpg|link=Three Kings (nonfiction)|2017: ''[[Three Kings (nonfiction)|Three Kings]]'' voted Picture of the Day by the citizens of [[New Minneapolis, Canada]].