Skip to main content
MathOverflow

Return to Answer

Name of paper, 'Lamé', and link to "the above answer"
Source Link
LSpice
LSpice
  • 12.9k
  • 4
  • 45
  • 69

The complexity analysis of the EuclidianEuclidean algorithm is much much older that the given reference. It goes back to at least LameLamé, before 1785. The above answerabove answer should be viewed as modern version of Lame'sLamé's theorem. The average is actually a normal variable, there are several difficult proofs, see Morris, arxiv.1502.07616Morris - A short proof that the number of division steps in the Euclidean algorithm is normally distributed, and earlier references.

The complexity analysis of the Euclidian algorithm is much much older that the given reference. It goes back to at least Lame, before 1785. The above answer should be viewed as modern version of Lame's theorem. The average is actually a normal variable, there are several difficult proofs, see Morris, arxiv.1502.07616, and earlier references.

The complexity analysis of the Euclidean algorithm is much much older that the given reference. It goes back to at least Lamé, before 1785. The above answer should be viewed as modern version of Lamé's theorem. The average is actually a normal variable, there are several difficult proofs, see Morris - A short proof that the number of division steps in the Euclidean algorithm is normally distributed, and earlier references.

Source Link
HistorySciences
HistorySciences
  • 21
  • 1

The complexity analysis of the Euclidian algorithm is much much older that the given reference. It goes back to at least Lame, before 1785. The above answer should be viewed as modern version of Lame's theorem. The average is actually a normal variable, there are several difficult proofs, see Morris, arxiv.1502.07616, and earlier references.