arXiv · 2609.01327
An improvement on the largest prime factor of $n^2+1$
Abstract
The study of the largest prime factor in polynomial sequences can be traced back at least to the late 19th century in the work of St\"ormer. Mahler (1933) and Chowla (1934) proved that the largest prime factor of $n^2+1$ grows at least as fast as $\log_2 n$. In 2023 we improved this to $(\log_2 n)^2/\log_3 n$. In this note we show the lower bound $(\log_2 n)^2/\log_4 n$, and that when this bound is nearly sharp it also holds for many prime factors of $n^2+1$.
Explore related subjects
Keep this discovery
Hector Pasten. 2026-09-01. An improvement on the largest prime factor of $n^2+1$. https://arxiv.org/abs/2609.01327
Cite the original work for its findings. Save a collection to share your selection of sources.