Porter's constant
constant term in the average number of iterations of Euclid’s algorithm for fixed 𝑛 and averaged over all choices of relatively prime integers 𝑚<𝑛
en-US/ˈpɔɹtɚz kɑŋˈstɑŋ/
en-GB/pɔːtəz ˈkɒnstənt/
constant term in the average number of iterations of Euclid’s algorithm for fixed 𝑛 and averaged over all choices of relatively prime integers 𝑚<𝑛