For integral , let be the greatest prime divisor of By convention, we set and Find all polynomials with integer coefficients such that the sequence
is bounded above. (In particular, this requires for )
Solution
Consider the given polynomials with integer coefficients, which need to ensure the sequence
is bounded above. Here, denotes the greatest prime divisor of , with and .
### Step 1: Analyze the Sequence
The requirement that the sequence is bounded above translates to the constraint:
for some constant and for all .
### Step 2: Ensure Non-Zero Condition for
To ensure that for all and that the sequence is bounded, we should consider the structure of . The fact that is bounded suggests cannot have terms that grow too fast relative to the linear function .
### Step 3: Determine the Form of
For the condition to have an upper bound, consider forms of where the roots of result in factors that prevent rapid growth:
Suppose is of the form:
where is an integer constant and are integers.
This ensures the polynomial takes values such that the greatest prime divisor is controlled and cannot exceed by a large margin since each root implies shifts by constants only. The factor ensures that for each , the polynomial translates into a product of terms that holds the degree growth limited to linear terms after evaluation at .
### Step 4: Verify Constants and Conditions
- For large, each minimum term becomes significant and maintains bounded .
- The presence of constant integer does not change the growth dynamics relative to linearly growing .
Finally, verify if no greater terms can arise from roots being inherently controlled by this polynomial form. This confirms boundedness of the sequence in line with problem constraints.
Thus, the polynomials that satisfy the given conditions are of the form: