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

Nick Craig-Wood
8/8/2025
math.NTcs.AI

No confident code implementation found for this paper.

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$). 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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{craigwood2025constrained,
  title  = {Constrained PSLQ Search for Machin-like Identities Achieving Record-Low Lehmer Measures},
  author = {Nick Craig-Wood},
  year   = {2025},
  eprint = {2508.08307},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.08307v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.08307.svg)](https://codeofpaper.com/paper/2508.08307)

Discussion