enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Leonhard Euler - Wikipedia

    en.wikipedia.org/wiki/Leonhard_Euler

    Leonhard Euler (/ ˈ ɔɪ l ər / OY-lər; [b] German: [ˈleːɔnhaʁt ˈʔɔʏlɐ] ⓘ, Swiss Standard German: [ˈleɔnhard ˈɔʏlər]; 15 April 1707 – 18 September 1783) was a Swiss mathematician, physicist, astronomer, geographer, logician, and engineer who founded the studies of graph theory and topology and made pioneering and influential discoveries in many other branches of ...

  3. Seven Bridges of Königsberg - Wikipedia

    en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg

    Map of Königsberg in Euler's time showing the actual layout of the seven bridges, highlighting the river Pregel and the bridges. The Seven Bridges of Königsberg is a historically notable problem in mathematics. Its negative resolution by Leonhard Euler, in 1736, [1] laid the foundations of graph theory and prefigured the idea of topology. [2]

  4. Graph Theory, 1736–1936 - Wikipedia

    en.wikipedia.org/wiki/Graph_Theory,_1736–1936

    First edition. Graph Theory, 1736–1936 is a book in the history of mathematics on graph theory.It focuses on the foundational documents of the field, beginning with the 1736 paper of Leonhard Euler on the Seven Bridges of Königsberg and ending with the first textbook on the subject, published in 1936 by Dénes Kőnig.

  5. Contributions of Leonhard Euler to mathematics - Wikipedia

    en.wikipedia.org/wiki/Contributions_of_Leonhard...

    The 18th-century Swiss mathematician Leonhard Euler (1707–1783) is among the most prolific and successful mathematicians in the history of the field.His seminal work had a profound impact in numerous areas of mathematics and he is widely credited for introducing and popularizing modern notation and terminology.

  6. Eulerian path - Wikipedia

    en.wikipedia.org/wiki/Eulerian_path

    An Eulerian trail, [note 1] or Euler walk, in an undirected graph is a walk that uses each edge exactly once. If such a walk exists, the graph is called traversable or semi-eulerian. [3] An Eulerian cycle, [note 1] also called an Eulerian circuit or Euler tour, in an undirected graph is a cycle that uses each edge exactly once

  7. Graph theory - Wikipedia

    en.wikipedia.org/wiki/Graph_theory

    The paper written by Leonhard Euler on the Seven Bridges of Königsberg and published in 1736 is regarded as the first paper in the history of graph theory. [20] This paper, as well as the one written by Vandermonde on the knight problem , carried on with the analysis situs initiated by Leibniz .

  8. 1 − 2 + 3 − 4 + ⋯ - ⋯ - Wikipedia

    en.wikipedia.org/wiki/1_%E2%88%92_2_%2B_3_%E2%88...

    Nonetheless, in the mid-18th century, Leonhard Euler wrote what he admitted to be a paradoxical equation: + + =. A rigorous explanation of this equation would not arrive until much later. Starting in 1890, Ernesto Cesàro , Émile Borel and others investigated well-defined methods to assign generalized sums to divergent series—including new ...

  9. Introductio in analysin infinitorum - Wikipedia

    en.wikipedia.org/wiki/Introductio_in_analysin...

    Introductio in analysin infinitorum (Latin: [1] Introduction to the Analysis of the Infinite) is a two-volume work by Leonhard Euler which lays the foundations of mathematical analysis. Written in Latin and published in 1748, the Introductio contains 18 chapters in the first part and 22 chapters in the second.