Browse · MathNet
Print67th Romanian Mathematical Olympiad
Romania algebra
Problem
Let be a matrix satisfying the conditions:
Prove that , for any positive integer .
Prove that , for any positive integer .
Solution
If , we have Let be a matrix satisfying the hypothesis. From (1) we obtain Using the Cayley-Hamilton theorem, we obtain We analyze several cases.
If , then (3) implies , whence . From (2) it results .
If , then this time (3) implies . Inductively, , . It follows that , . As a special case, using (2), , whence .
If and . From (3), . Then . Using (2) and our assumption, we get . From (3), it follows that Thus, starting with , we obtain recursively , , ..., , a contradiction. It follows that and .
Finally, from (3) it follows that , hence , . Then, for , we have . For , from (1), .
If , then (3) implies , whence . From (2) it results .
If , then this time (3) implies . Inductively, , . It follows that , . As a special case, using (2), , whence .
If and . From (3), . Then . Using (2) and our assumption, we get . From (3), it follows that Thus, starting with , we obtain recursively , , ..., , a contradiction. It follows that and .
Finally, from (3) it follows that , hence , . Then, for , we have . For , from (1), .
Techniques
MatricesDeterminants