The Setting
Take a nonpolynomial rational function , where are coprime polynomials with , and a real parameter . The question is how many integers satisfy for some when and are bounded by fixed multiples of powers of , uniformly over pairs and of bounded degree.
The Claim
Theorem 1. Let be a positive integer, and let , and be positive real numbers. There exists a constant , depending only on , and , such that whenever are coprime polynomials with and , is a real number, is a finite set, and is a function satisfying , , and for all , the cardinality of satisfies (1)✦
In the paper, the result reads: for fixed and constants (where the paper writes for ), every , every , and every nonpolynomial whose reduced numerator and denominator have degrees at most , one has (excluding poles of ), uniformly in the coefficients of .
The bound (1) passes from to coprime complex polynomials with , and from outside poles to on a finite set for .
What Is Checked
The claim is stated over a positive integer , positive real numbers , and , coprime complex polynomials with and , a real number , a finite set , and an integer-valued function satisfying , , and for all .