Let denote the set of all polynomials in three variables with integer coefficients. Let denote the subset of formed by all polynomials which can be expressed as
with . Find the smallest non-negative integer such that for all non-negative integers satisfying .
Solution
To solve the given problem, we need to find the smallest non-negative integer such that any monomial with can be expressed in the form:
where are polynomials with integer coefficients.
### Step-by-step Analysis
1. Understanding the Problem:
- The monomial needs to be expressed as a polynomial that results from the specific linear combination given in the problem.
- We need to analyze the degrees that can be formed by , , and .
2. Degrees of Terms:
- The term contributes degree .
- The term contributes degree .
- The term contributes degree .
3. Constructing a Basis for High Degrees:
- For with sufficiently large, study the combinations of terms that can sum to this degree.
- Notice that:
- produces monomials like , , and .
- produces monomials like , , etc.
- directly gives .
4. **Inferring the Value of :**
- Observe that for , the simplest monomial expressions such as can't be formed using any combination of the terms, as these require linear alternation terms which can't have degree less than 3.
- Once , every required monomial can be constructed using the given forms by expressing simpler terms and adding higher degree components systematically using .
5. Conclusion:
- The construction of every monomial becomes feasible for . Therefore, the smallest for which each monomial in can be expressed in the form of the given polynomial combination is:
This reasoning shows that once the total degree reaches 4, , validating as the smallest such integer.