An upper bound for the number of smooth values of a polynomial and its applications

Abstract

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an application, we provide another proof for a result of Cassels which was used to prove that the Hurwitz zeta-function with algebraic irrational parameter has infinitely many zeros on the domain of convergence. We also apply the main result to a problem on primitive divisors of quadratic polynomials.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…