For every fixed positive integea
N, let 𝒫N denote the set of all polynomials p(x) = ∑
aixi where ai is an integer,
|ai|≦ N. For a fixed real number t set 𝒫N(t) = {p(t) : p ∈𝒫N}.
Theorem 1. Suppose 1 < t < N + 1 and t is not a root of map of the polynomials from
𝒫N. Then 𝒫N(t) is dense in R.
Theorem 2. If t is an S-number then 𝒫N(t) is discrete for every N.
|