Maths Olympiad Prep

Track / Stage 7 / 291 of 300 #1691 of 1964

Problem 1691

National olympiad second round; IMO P1/P4
Combinatorics Difficulty 7.9 Prove it

Given a ring (A,+,)\left( A,+,\cdot \right) that meets both of the following conditions:
(1) AA is not a field, and
(2) For every non-invertible element xx of A A, there is an integer m>1m>1 (depending on xx) such that x=x2+x3++x2mx=x^2+x^3+\ldots+x^{2^m}.
Show that
(a) x+x=0x+x=0 for every xAx \in A, and
(b) x2=xx^2=x for every non-invertible xAx\in A.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

### Part (a)

1. Notation and Setup:
Let xA x \in A be a non-invertible element. According to the problem, there exists an integer m>1 m > 1 such that:
x=x2+x3++x2m x = x^2 + x^3 + \ldots + x^{2^m}
This can be rewritten as:
x(1xx2x2m1)=0 x(1 - x - x^2 - \ldots - x^{2^m - 1}) = 0

2. **Case 1: 2A 2_A is invertible:**
Suppose 2A 2_A is invertible. Then, we can multiply both sides of the equation by 2A1 2_A^{-1} :
2x1x2m=0 2x - 1 - x^{2^m} = 0
This implies:
2x1=x2m 2x - 1 = x^{2^m}
Since 2x1 2x - 1 is non-invertible (otherwise x x would be invertible, contradicting our assumption), we can substitute 2x1 2x - 1 into the original equation:
2=xQ(x) 2 = x \cdot Q(x)
for some polynomial Q(x) Q(x) with integer coefficients. Since 2 2 commutes with x x , we have:
xQ(x)21=Q(x)21x=1 x \cdot Q(x) \cdot 2^{-1} = Q(x) \cdot 2^{-1} \cdot x = 1
This implies x x is invertible, which is a contradiction. Therefore, 2A 2_A cannot be invertible.

3. **Case 2: 2A 2_A is non-invertible and not equal to 0:**
Suppose 2A 2_A is non-invertible and not equal to 0. Plugging 2 2 into the equation, we get:
2(22m3)=0 2(2^{2^m} - 3) = 0
Let N N be the least integer such that N1=0 N \cdot 1 = 0 . Then N2(22m3) N \mid 2(2^{2^m} - 3) .

4. **Analyzing N N :**
- If N=2 N = 2 , then 2=0 2 = 0 , which is a contradiction.
- If N N is odd, then 2 2 would be invertible, which is a contradiction.
- Let N=2k N = 2k , where k>1 k > 1 is odd. Then k+k=2k=0 k + k = 2k = 0 , and k(k1)=0 k \cdot (k - 1) = 0 because k1 k - 1 is even. Hence, k1 k - 1 is non-invertible, and there exists some nN n \in \mathbb{N}^* such that:
(k1)=(k1)2+(k1)3++(k1)2n (k - 1) = (k - 1)^2 + (k - 1)^3 + \ldots + (k - 1)^{2^n}
This implies:
k=2 k \cdot \ell = 2
for some Z \ell \in \mathbb{Z} . If \ell is even, we get 2=0 2 = 0 , a contradiction. If \ell is odd, it follows k=2 k = 2 , a contradiction.

5. Conclusion:
The only remaining case is 2=0 2 = 0 , i.e., 1+1=0 1 + 1 = 0 , which means:
x+x=x(1+1)=0xA x + x = x \cdot (1 + 1) = 0 \quad \forall x \in A

### Part (b)

1. Given Condition:
For every non-invertible xA x \in A , we have:
x(x2m1)=0 x \cdot (x^{2^m} - 1) = 0
This implies:
x=x2m+1 x = x^{2^m + 1}

2. Simplification:
We can rewrite the above as:
x(x1)(xQ(x)+1)=0 x \cdot (x - 1) \cdot (x \cdot Q(x) + 1) = 0
where Q(x) Q(x) is a polynomial with integer coefficients. It is easy to see that x2x x^2 - x cannot be invertible.

3. Power Analysis:
Raising to the power 2m 2^m , we have:
(x2x)2m=x2m+1x2m=0 (x^2 - x)^{2^m} = x^{2^{m+1}} - x^{2^m} = 0
(using x=x2m+1 x = x^{2^m + 1} ).

4. Combining Results:
Since x2x x^2 - x is non-invertible, there exists n n such that:
(x2x)2n+1=x2x (x^2 - x)^{2^n + 1} = x^2 - x
Combining with the previous result, we get:
x2x=0 x^2 - x = 0

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.