A Bounded, Factor-Blind Solver for Generalized Pell Equations: Unimodular Coordinates, Modular Filtering, and a Pell-Conic Connection

A bounded, factor-blind solver for the generalized Pell equation x^2 - D*y^2 = M (D a positive nonsquare integer, M an integer). Given D, M and a coefficient bound, the solver builds a unimodular coordinate system from the first two consecutive continued-fraction convergents of sqrt(D), which reduces the norm equation to a one-parameter exact-square condition. It enumerates one integer coefficient, rejects most candidates with quadratic-residue tests modulo small primes, and performs exact large-integer checks only on the survivors. Every returned solution is exactly verified; a miss within the coefficient bound or time limit proves nothing about solvability. Unlike the Lagrange–Matthews–Mollin (LMM) implementations used for comparison, the solver does not factor D or M. On thirty 2048-bit equations constructed from known witnesses, the ten-modulus filter reduced exact large-integer square evaluations by 99.40% and mean search time by 93.99%. These figures measure filter efficiency on a witness-constructed corpus, not performance on naturally sampled equations. Against a PQa-based LMM implementation and SymPy's diop_DN on small D and 40- to 128-bit right-hand sides, the solver is slower and, within its bounds, less successful; its distinguishing property is the absence of factor-dependent preprocessing, not speed. A secondary, exploratory section audits a small Pell-conic factoring pilot and finds no evidence of a new construction or of a factoring advantage. This record contains the paper (PDF) and the reproducibility archive ARF_Pell_Paper_Reproducibility_v1.zip with solver source code, benchmark generator, test corpora, results and scripts.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24415120
Primary Topic
Algebraic Geometry and Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Bounded, Factor-Blind Solver for Generalized Pell Equations: Unimodular Coordinates, Modular Filtering, and a Pell-Conic Connection

Andreas Hör
Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
preprint

A Bounded, Factor-Blind Solver for Generalized Pell Equations: Unimodular Coordinates, Modular Filtering, and a Pell-Conic Connection

Andreas Hör
preprint en

Abstract

A bounded, factor-blind solver for the generalized Pell equation x^2 - D*y^2 = M (D a positive nonsquare integer, M an integer). Given D, M and a coefficient bound, the solver builds a unimodular coordinate system from the first two consecutive continued-fraction convergents of sqrt(D), which reduces the norm equation to a one-parameter exact-square condition. It enumerates one integer coefficient, rejects most candidates with quadratic-residue tests modulo small primes, and performs exact large-integer checks only on the survivors. Every returned solution is exactly verified; a miss within the coefficient bound or time limit proves nothing about solvability. Unlike the Lagrange–Matthews–Mollin (LMM) implementations used for comparison, the solver does not factor D or M. On thirty 2048-bit equations constructed from known witnesses, the ten-modulus filter reduced exact large-integer square evaluations by 99.40% and mean search time by 93.99%. These figures measure filter efficiency on a witness-constructed corpus, not performance on naturally sampled equations. Against a PQa-based LMM implementation and SymPy's diop_DN on small D and 40- to 128-bit right-hand sides, the solver is slower and, within its bounds, less successful; its distinguishing property is the absence of factor-dependent preprocessing, not speed. A secondary, exploratory section audits a small Pell-conic factoring pilot and finds no evidence of a new construction or of a factoring advantage. This record contains the paper (PDF) and the reproducibility archive ARF_Pell_Paper_Reproducibility_v1.zip with solver source code, benchmark generator, test corpora, results and scripts.

Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
A Bounded, Factor-Blind Solver for Generalized Pell Equations: Unimodular Coordinates, Modular Filtering, and a Pell-Conic Connection — Andreas Hör · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS