Given a ring that meets both of the following conditions:
(1) is not a field, and
(2) For every non-invertible element of , there is an integer (depending on ) such that .
Show that
(a) for every , and
(b) for every non-invertible .
Problem 1691
Official solution
### Part (a)
1. Notation and Setup:
Let be a non-invertible element. According to the problem, there exists an integer such that:
This can be rewritten as:
2. **Case 1: is invertible:**
Suppose is invertible. Then, we can multiply both sides of the equation by :
This implies:
Since is non-invertible (otherwise would be invertible, contradicting our assumption), we can substitute into the original equation:
for some polynomial with integer coefficients. Since commutes with , we have:
This implies is invertible, which is a contradiction. Therefore, cannot be invertible.
3. **Case 2: is non-invertible and not equal to 0:**
Suppose is non-invertible and not equal to 0. Plugging into the equation, we get:
Let be the least integer such that . Then .
4. **Analyzing :**
- If , then , which is a contradiction.
- If is odd, then would be invertible, which is a contradiction.
- Let , where is odd. Then , and because is even. Hence, is non-invertible, and there exists some such that:
This implies:
for some . If is even, we get , a contradiction. If is odd, it follows , a contradiction.
5. Conclusion:
The only remaining case is , i.e., , which means:
### Part (b)
1. Given Condition:
For every non-invertible , we have:
This implies:
2. Simplification:
We can rewrite the above as:
where is a polynomial with integer coefficients. It is easy to see that cannot be invertible.
3. Power Analysis:
Raising to the power , we have:
(using ).
4. Combining Results:
Since is non-invertible, there exists such that:
Combining with the previous result, we get: