math.NTAug 8, 2025

Constrained PSLQ Search for Machin-like Identities Achieving Record-Low Lehmer Measures

Authors: Nick Craig-Wood

Abstract

Machin-like arctangent relations are classical tools for computing ππ, with efficiency quantified by the Lehmer measure (λλ). We present a framework for discovering low-measure relations by coupling the PSLQ integer-relation algorithm with number-theoretic filters derived from the algebraic structure of Gaussian integers, making large scale search tractable. Our search yields new 5 and 6 term relations with record-low Lehmer measures (λ=1.4572,λ=1.3291λ=1.4572, λ=1.3291). We also demonstrate how discovered relations can serve as a basis for generating new, longer formulae through algorithmic extensions. This combined approach of a constrained PSLQ search and algorithmic extension provides a robust method for future explorations.

Explore similar work

CardsList
  1. Mapping Uncharted Symmetries: Machine Discovery in Combinatorics

    May 18, 2026Eugenio Cainelli, Lorenzo Luccioli, Alessandro Iraci +2CombinationsSymmetry

  2. The Ramanujan Challenge For AI

    Jun 27, 2026Michael Shalyt, Rotem Kalisch, Carsten Schneider +7Math ProblemsRiemann Zeta Function