A Conditional Exponent-0.9 Bound for the Largest Prime Factor of p-1

This note establishes a conditional result concerning thelargest prime factor of shifted primes. Let \(P^+(n)\)denote the largest prime factor of an integer \(n>1\). Assuming the controlled-predecessor proposition in OpenAI'sOctober 2026 manuscript "Primitive Roots for EveryAdmissible Integer Base", we prove that for every fixed\(\varepsilon>0\), there exist infinitely many primes\(p\) satisfying \(P^+(p-1)>p^{0.9-\varepsilon}\). More precisely, the assumed proposition supplies\(\gg x/(\log x)^2\) primes \(p\in(x,2x)\) for which\(p-1=4rQ\), where \(Q>x^{0.9}\) is prime. Since \(Q\mid p-1\) and \(p<2x\), the desired inequalityfollows for all sufficiently large \(p\). The conclusion would exceed the previously establishedexponent \(0.679\) for sufficiently small\(\varepsilon\), provided the underlying OpenAIproposition is valid. This result is an elementary conditional corollary ofthe cited proposition, not an independent proof ofthe underlying open problem. The proposition has notbeen independently verified in this note, and nounconditional improvement is claimed. Authorship disclosure: The mathematical expositionand proof were prepared by ChatGPT (OpenAI), anartificial intelligence system, with the conditionaldependency and limitations explicitly identified.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24346579
Primary Topic
Analytic Number Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Conditional Exponent-0.9 Bound for the Largest Prime Factor of p-1

dr vengy
1 links
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
article

A Conditional Exponent-0.9 Bound for the Largest Prime Factor of p-1

dr vengy
article en

Abstract

This note establishes a conditional result concerning thelargest prime factor of shifted primes. Let \(P^+(n)\)denote the largest prime factor of an integer \(n>1\). Assuming the controlled-predecessor proposition in OpenAI'sOctober 2026 manuscript "Primitive Roots for EveryAdmissible Integer Base", we prove that for every fixed\(\varepsilon>0\), there exist infinitely many primes\(p\) satisfying \(P^+(p-1)>p^{0.9-\varepsilon}\). More precisely, the assumed proposition supplies\(\gg x/(\log x)^2\) primes \(p\in(x,2x)\) for which\(p-1=4rQ\), where \(Q>x^{0.9}\) is prime. Since \(Q\mid p-1\) and \(p<2x\), the desired inequalityfollows for all sufficiently large \(p\). The conclusion would exceed the previously establishedexponent \(0.679\) for sufficiently small\(\varepsilon\), provided the underlying OpenAIproposition is valid. This result is an elementary conditional corollary ofthe cited proposition, not an independent proof ofthe underlying open problem. The proposition has notbeen independently verified in this note, and nounconditional improvement is claimed. Authorship disclosure: The mathematical expositionand proof were prepared by ChatGPT (OpenAI), anartificial intelligence system, with the conditionaldependency and limitations explicitly identified.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
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