To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

How to transfigure the Wikipedia

Would you like Wikipedia to always look as professional and up-to-date? We have created a browser extension. It will enhance any encyclopedic page you visit with the magic of the WIKI 2 technology.

Try it — you can delete it anytime.

Install in 5 seconds
4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
Great Wikipedia has got greater.
.
Leo
Newton
Brights
Milds

Émile Léger

From Wikipedia, the free encyclopedia

Émile Léger
Born(1795-08-15)15 August 1795
La Grange aux Bois, today Sainte-Menehould, France
Died15 December 1838(1838-12-15) (aged 43)
Paris, France
Alma materÉcole Polytechnique
Known forEuclidean algorithm
Scientific career
FieldsMathematics

Émile Léger (1795–1838) was a French mathematician.

YouTube Encyclopedic

  • 1/1
    Views:
    617
  • Interview Alexandre St-Onge

Transcription

Life and work

Leger studied at Lycée de Mayence (now Mainz in Germany, capital of the French department of Mont-Tonnerre during the French First Republic), where his father Claude was professor of rhetoric. In 1813 he entered the École Polytechnique. With other students, he helped defend Paris during the Hundred Days of Napoleon in March 1815, and was decorated for bravery.[1] In 1816, he left school to go to Montmorency where his father founded an institution to prepare young people for the entrance exams to Paris universities. After his father retired, he managed the institution.[2]

Léger only published four papers on mathematics,[1] but one of them seems to be the first to recognize the worst case in the euclidean algorithm: when the inputs are proportional to consecutive Fibonacci numbers.[2]

References

  1. ^ a b O'Connor & Robertson, MacTutor History of Mathematics.
  2. ^ a b Shallit, page 410.

Bibliography

  • Shallit, Jeffrey (1994). "Origins of the analysis of the Euclidean algorithm". Historia Mathematica. 21 (4): 401–419. doi:10.1006/hmat.1994.1031. ISSN 0315-0860.

External links

This page was last edited on 27 July 2023, at 23:03
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.
Contact WIKI 2
Introduction
Terms of Service
Privacy Policy