June 6, 2024Open Access

On the primitive divisors of quadratic polynomials

Key Points

Key points are not available for this paper at this time.

Abstract

Let x denote a sufficiently large integer. We give a new upper bound for the number of integers n x which n² +1 has a primitive divisor, improving previous result of Harman. This improvement comes from Pascadi's recent work on the largest prime factor of n² +1.

Read Full Paperexternally

AI से पूछें

Bookmark

View Full Paper

Cite This Study

Runbo Li (Thu,) studied this question.

synapsesocial.com/papers/68e65e3eb6db6435875ed1ba https://doi.org/https://doi.org/10.48550/arxiv.2406.07575

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1On the frequency of primes preserving dynamical irreducibility of polynomials2024
2Existence of Integers with Few Prime Factors Avoiding Certain Residue Classes Modulo Each Prime2026
3On the Brun--Titchmarsh theorem. I2024
4On the Largest Prime Factor of Integers in Short Intervals2025
5The Schur polynomials in all primitive $n$th roots of unity2024

AI से पूछें

Bookmark

View Full Paper