Article · Wikipedia archive · Last revised Jun 16, 2026

Jacobi–Perron algorithm

In mathematics, the Jacobi–Perron algorithm is a generalization of the Euclidean algorithm to n-tuples of real numbers, which addresses Hermite's problem. It was defined by C. G. J. Jacobi for n = 2 and Oskar Perron for n ≥ 2.

Last revised
Jun 16, 2026
Read time
≈ 1 min
Length
61 w
Citations
2
Source
Wikipedia ↗

In mathematics, the Jacobi–Perron algorithm is a generalization of the Euclidean algorithm to n-tuples of real numbers, which addresses Hermite's problem.1 It was defined by C. G. J. Jacobi for n = 2 and Oskar Perron for n ≥ 2.2

Sources

Sources

  1. Bernstein p.1
  2. Bernstein p.6
  • Leon Bernstein: The Jacobi-Perron algorithm - its theory and application. Lecture Notes Math. 207, Springer-Verlag, 1971