Indexed metadata
A recursive Buchstab switching improvement for the greatest prime factor of n^2+1
JinWen Li
Source record
Source: Crossref
Published: Sep 13, 2026
DOI: 10.33774/coe-2026-s41cw
Open original source ↗Source abstract
We recursively expose the one-prime Buchstab tail on 7/6n^1.323. This is a greatest-prime-factor weak form of Landau's fourth problem; the parity barrier remains.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.