On the primitive divisors of quadratic polynomials

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.