MATH PROBLEMS, WITH SOLUTIONS

Transcription

1 MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These notes can be used as complimentary to an advanced calculus or algebra course, as training for math competitions or simply as a collection of challenging math problems. Many of these are my own creation, some from when I was a student and some from more recent times. The problems come with solutions, which I tried to make both detailed and instructive. These solutions are by no means the shortest, it may be possible that some problems admit shorter proofs by using more advanced techniques. So, in most cases, priority has been given to presenting a solution that is accessible to a student having minimum knowledge of the material. If you see a simpler, better solution and would like me to know it, I would be happy to learn about it. Of course, I will appreciate any comments you may have. I have included problems from linear algebra, group theory and analysis, which are numbered independently. In the future, I plan to expand this set and include problems from more fields as well.

2 2 OVIDIU MUNTEANU. Algebra. For two n n invertible matrices A, B such that AB + BA = O, show that I, A, B and AB are linearly independent. Solution: We can proceed directly: we want to show that if a, b, c, d are such that ai + ba + cb + dab = O, then a = b = c = d =. Denote by C = AB, and observe that since AB + BA = O, we get AC + CA = O and BC + CB = O as well. Now we multiply ai + ba + cb + dab = O to the left by A and get which can be written as As A is invertible, this implies aa + ba 2 + cab + dac = O, (ai + ba cb dc)a = O. I + ba cb dc = O. Together with ai + ba + cb + dc = O, it yields { ai + ba = O cb + dc = O. The last equation can be simplified again, using that B is invertible. Indeed, implies O = cb + dc = (ci + da)b { ai + ba = O ci + da = O. Each of these equations imply the coefficients are zero. Indeed, if there exist u and v so that ui + va = O and if v, then A = λi, for λ = u. But then v O = AB + BA = 2λB, therefore λ =, which is a contradiction. 2. Let A, B be two n n matrices that commute. For any eigenvalue α C of A + B, prove that there exists λ C and µ C eigenvalues of A and B respectively, such that α = λ + µ. Solution: This result is well known, here we present an elementary proof. The fact that α C is an eigenvalue of A + B means that the system (A + B) X = αx has a nonzero solution, which we continue to denote with X.

3 MATH PROBLEMS 3 Let λ,.., λ n and µ,.., µ n denote the eigenvalues of A and B, respectively. (A + B) X = αx we get BX = (αi A) X, hence (B µ k I) X = ((α µ k ) I A) X, for all k n. However, since AB = BA, it follows that: (B µ 2 I) (B µ I) X = (B µ 2 I) ((α µ ) I A) X Continuing this argument, we obtain where we have denoted = ((α µ ) I A) (B µ 2 I) X = ((α µ ) I A) ((α µ 2 ) I A) X. (B µ n I)... (B µ I) X = CX, C := ((α µ n ) I A)... ((α µ ) I A). From However, it is well known that B is a solution of its characteristic polynomial, therefore (B µ n I)... (B µ I) = O. This implies that the system CX = has a nonzero solution, hence det C =. Consequently, there must exist µ k such that det ((α µ k ) I A) =, which means that α µ k is an eigenvalue of A. This proves the statement. 3. Let A, B be two n n invertible matrices with real entries. Prove the following claims: (i) If A + B is invertible and (A + B) = A + B then det A = det B = det(a + B). (ii) If n = 2 and det A = det B = det(a + B) then A + B is invertible and (A + B) = A + B. Solution: (i) : We use that I = (A + B)(A + B ) = 2I + AB + BA. From here we see that X + X + I = O, where X := AB. This proves that X is a solution of the equation X 2 + X + I = O. Since the polynomial Q(λ) = λ 2 + λ + is irreducible on R, it follows that Q is the minimal polynomial of X. The characteristic polynomial and the minimal polynomial of X have the same irreducible factors over R, hence we conclude that n = 2k and the characteristic polynomial of X is P (λ) = (λ 2 + λ + ) k. This implies that det X =, which means that det A = det B.

4 4 OVIDIU MUNTEANU Moreover, from X(X + I) = I and det X =, we infer that det(x + I) =. This implies that det B = det((x + I)B) = det(a + B). This proves (i). (ii) : Using the notations at (i), it suffices to show that X 2 + X + I = O. However, det A = det B = det(a + B) implies that det(ab ) = det(ab + I) =, hence P () = P ( ) =. In dimension n = 2, the characteristic polynomial P of X has order 2, hence P (λ) = λ 2 + λ +. This implies X 2 + X + I = O. 4. For n even, let A, B be two n n matrices that commute, AB = BA. We assume that there exist x,..., x n non-negative and distinct so that (A + x k B) n = O, for all k {,.., n}. Prove that A n = B n = O. Solution: Let C (x) = A+xB where x R. Clearly, we have C n (x) = (c ij (x)) i,j=,.,n, for some polynomials c ij (x) of order at most n. By hypothesis, we know that C n (x k ) =, which means that each c ij vanishes on x,.., x n. Consequently, c ij (x) = (x x )... (x x n ) d ij, where d ij R. We can say now that C n (x) = (x x )... (x x n ) D, where D is an n n matrix. On the other hand, since A and B commute, we immediately find that Let us denote now where C n (x) = A n + ( na n B ) x ( nab n ) x n + B n x n. (x x )... (x x n ) = x n + s x n s n x + s n, s = (x x n ) s n = ( ) n i x...x i x i+..x n s n = ( ) n x...x n Since with this notation we also have C n (x) = s n D + (s n D) x (s D) x n + Dx n, it follows that D = B n, s D = nab n, s n D = na n B, s n D = A n. Therefore, we have proved that A n = s n B n, na n B = s n B n, nab n = s B n.

5 We can readily obtain from here that MATH PROBLEMS 5 n 2 A n B = na(na n B) = s n nab n = s n s B n+, n 2 A n B = n 2 s n B n+ On the other hand, we can prove that s s n > n 2 s n, which by above implies that B n+ =. Indeed, to show that s s n > n 2 s n, we first notice that if s n =, the inequality to prove is trivial, as only one of the numbers x k could be zero. On the other hand, if s n >, the inequality to be proved becomes ( (x x n ) ) > n 2, x x n which is true as the numbers are distinct. Hence, B n+ = O, which immediately implies B n = O as well, as the minimal polynomial and the characteristic polynomial of B have the same irreducible factors. As A n = s n B n it follows that A n = O, as well. 5. We denote by M n (R), the set of n n matrices with real entries. Assume a function f : M n (R) R has the properties that f (X) for all X O and that f(xy ) = f(x)f(y ), for any X, Y M n (R). Show that f(x) =, for all X M n (R). Solution: Let us first find f(o). Since f(o) = f(o)f(o), it follows f(o) {, }. Let us assume by contradiction that f(o) =. Let A, B M n (R), such that both A, B O but AB = O. For example, B could have zeros everywhere except the first row, and A could have arbitrary entries except on the first column, where all entries are taken to be zero. Then clearly AB = O, and = f(o) = f(ab) = f(a)f(b), which means that f(x) =, for some nonzero X. This is a contradiction. Hence, f(o) = and now we notice that for all X. = f(o) = f(ox) = f(o)f(x) = f(x), 6. Let A, B, C be n n matrices. Assume that two of the matrices A, B, C commute, where C := AB BA. Prove that C n = O. Solution: For simplicity, we can assume that A commutes with C. We use that for two matrices X, Y the trace tr (XY Y X) =. So, trc =, and for any k >, we

6 6 OVIDIU MUNTEANU have: C k+ = C k (AB BA) = C k AB ( C k B ) A = A ( C k B ) ( C k B ) A. Again, we get that trc k+ =, using the above property for X = A and Y = C k B. We know that if C has eigenvalues λ,.., λ n C, then C k has eigenvalues λ k,.., λ k n, and trc k = λ k λ k n. This shows Using the characteristic polynomial of C, λ k λ k n =, for any k >. P (λ) = det (λi n C) = λ n + c λ n c n which has roots λ,.., λ n, we get c =.. = c n =. So, by the Cayley-Hamilton theorem, we obtain C n = O. 7. Show that there exists C M 2 (C) such that A = CA t C, for any A M 2 (C). Determine all matrices C with this property. Here A denotes the adjoint matrix of A. ( ) ( ) a b d b Solution: Denote A =, then A c d =. It is easy to find for c a ( ) ( ) ( ) b d d b C = that CA t = and CA a c t C = = A c a. So indeed, there exists C with the required property. Now we find all such matrices. Assume D M 2 (C) is another matrix such that A = DA t D, for any A M 2 (C). By DA t D = CA t C, we get (C D)A t = A t (C D). This means the matrix C D commutes with all matrices in M 2 (C). It is known that this implies ( C ) D = λi, for λ some λ C. We have proved that D = λc, λ C, so D =. λ 8. Find the number of functions such that f : M n (R) P ({, 2,..., m}) f(xy ) f(x) f(y ), for any X, Y M n (R). We have denoted with P(A) the set of subsets of A and M n (R) the set of all n n matrices with real entries. Solution: Observe first that f(x) = f(xi) f(x) f(i) f(i),

7 MATH PROBLEMS 7 hence f(x) f(i), for any X M n (R). If Y M n (R) is invertible, we have f(i) = f(y Y ) f(y ) f(y ) f(y ). This proves that f(y ) = f(i), for any Y M n (R) invertible. Furthermore, if A is invertible and X arbitrary, then f (AX) f (A) f (X) f (X) and f (X) = f ( A AX ) f ( A ) f (AX) f (AX). Again, this establishes that f (AX) = f (X), for any A invertible. Let us consider an arbitrary X M n (R). It is a fact that there exist R, U r, S, such that X = RU r S, where R and S are invertible and U r has the first r elements on the diagonal equal to and all other entries equal to. Now, from X = RU r S we get f(x) = f(u r ). So the question reduces to computing f (U r ). We first notice that U r U r+ = U r implies f(u r ) f(u r+ ). We can in fact show that such an increasing sequence of subsets of {, 2,..., m} characterizes a function f as in the problem. Indeed, if (A i ) i=,n is an increasing subsequence of parts of {,.., m}, we can define f by f (X) = A r, if rank (X) = r. This immediately implies that f satisfies k +...+k n m f(xy ) f(x) f(y ), for any X, Y M n (R), as rank (XY ) min {rank (X), rank (Y )}. So to count the number of functions f, we need to compute the number of increasing sequences (A i ) i=,n, where A i ( ) m P({, 2,.., m}). Let k := A. To choose A we have choices. For A given, k we choose A \A ( from the m) k remaining elements. So, if k := A A, with m k k, we have possibilities to choose A k \A. By this reasoning, the number of sequences (A i ) i is ( ) ( ) ( ) m m k m (k + k N := k n ) k k k n We use that and m (k +...+k n 2 ) k n = m (k +...+k n ) k n= ( ) m (k + k k n ) = 2 k m (k +..+k n ) n ( ) m (k + k k n 2 ) k n Continuing, we get N = (n + 2) m. 2 m (k +..+k n 2 ) k n = 3 m (k +..+k n 2 ).

8 8 OVIDIU MUNTEANU. Let (G, ) be a group. We assume that G has an odd number of elements and that there exists a G and n N, such that: a n x = x a, for all x G\{a k k N}. Show that ax = xa, for any x G. Solution: Let us denote with H := {a k k N}. We know that a n = xax, for any x G\H. Since H is a subgroup of G, this implies that if x / H, then x / H as well. From above, this means that we also have a n = x ax, for any x G\H. Therefore, this means x ax = xax, which implies that x 2 a = ax 2, for any x G\H. Now let s fix x G\H, and assume by contradiction that x 2 H. We know that G has an odd number of elements, say that G has = 2p + elements. If x 2 H, it follows that (x 2 ) p H. Since x G\H, we see that x 2p+ = x 2p x G\H. However, x 2p+ = e H, because G has order 2p +. This provides a contradiction, hence the assumption that x 2 H is false. We have showed that x G\H implies x 2 G\H as well. It results that a n = x 2 a(x 2 ). Since x 2 and a commute, this implies a n = a. This immediately implies that ax = xa, for any x G\H, which solves the problem. 2. Let (G, ) be a group with n elements, where n is not a multiple of 3. For a subset H of G we assume that x y 3 H, for any x, y G. Prove that H is a subgroup of G. Solution. Consider an element a H. We then have that a a 3 H, so a 2 H. Continuing this, we get (a 2 ) (a 2 ) 3 H, which means that a 4 H. From a 4 H and a H it follows that (a 4 ) a 3 H, therefore a H. We have thus established that a H, for any a H. Now consider any two x, y H. Since x H, we know that x H as well. Now x H and y H imply that (x ) y 3 H. This proves that xy 3 H, for any x, y H. Now we use induction on p N to prove that xy 3p H, for any x, y H. Indeed, by induction we have that xy 3(p ) H, and since y H, we get that xy 3p = ( xy 3(p )) y 3 H. We discuss two cases: Case I: n = 3k +, for some k N. Taking p = k above we get, for any x, y H xy = xy n H.

9 MATH PROBLEMS 9 Indeed, we have used that y n = e, as G has n elements. This proves H is a subgroup of G. Case II: n = 3k + 2, for some k N. Taking p = k + we get for any x, y H that xy = xy n+ = xy 3k+3 H. Again, this proves that H is a subgroup of G, because we have already established that a H, for any a H. 3. Let G be a group. We assume there exists an homomorphism of groups f : G G G and a G such that f(a, x) = f(x, a) = x, for any x G. Prove that G is abelian. Solution: Recall that G G is a group with respect to Since f is a homomorphism, we have It follows therefore that (x, y) (z, w) = (xz, yw). f(xz, yw) = f(x, y) f(z, w). f(x, e) f(a, a) = f(xa, ea) = f (xa, a) = xa, where e denotes the identity element in G. Moreover, we also know by hypothesis that f(a, a) = a, which by above implies that Similarly, which then implies that In we first take z = e and y = e to get that f(x, e) = x, for any x G. f(e, x) f(a, a) = f(a, xa) = xa, f(x, e) = f(e, x) = x, for any x G. f(xz, yw) = f(x, y) f(z, w) f(x, w) = x w and now take x = e and w = e to get that f(z, y) = y z.

10 OVIDIU MUNTEANU This clearly implies G is abelian and also that f(x, y) = x y, for any x, y G. 4. Let (G, ) be a group with identity e G. We assume that there exists a surjective endomorphism f : G G, such that H := {x G f(x) = e} has the property that if K is a subgroup of G with H K G, then either K = H or K = G. Prove that G Z or G Z p, for p prime. Solution: We first show that H = {e}. Assuming there exists x H\{e}, we can let K := {x G (f f) (x) = e} and L := {x G (f f f) (x) = e}. These are both subgroups of G as f f and f f f are endomorphisms of G. Furthermore, we can show H K L, with strict inclusions. Indeed, as f is onto, there exists x G such that f(x ) = x. It follows that (f f) (x ) = f(x ) = e, so x K. Since f(x ) = x e it follows that x K\H. Similarly, there exists x 2 G such that f(x 2 ) = x, and the same argument as above implies x 2 L\K. By hypothesis, this is a contradiction. The contradiction is to the assumption that there exists x H\ {e}. Therefore, H = {e} and G has no proper subgroups. This implies the conclusion. 5. Assume (G, ) is a group with an odd number of elements and there exist x, y G such that yxy = x. Prove that y = e, where e is the identity in G. Solution: From yxy = x we successively get that y = (yx) x, and y = x(xy). Equalizing the two formulas we get (yx) x = x(xy). This is equivalent to x(xy) = (yx)x, so we have established that x 2 y = yx 2. By induction, we can show that x 2p y = yx 2p. Indeed, p = is already checked. If we assume now that x 2p y = yx 2p, we checked immediately that x 2(p+) y = (x 2p x 2 )y = x 2p (x 2 y) = x 2p (yx 2 ) = yx 2p x 2 = yx 2(p+). Since G has an odd number of elements, we get from here that xy = yx. By hypothesis, we obtain y 2 = e. However, using again that G has an odd number of elements, we get y = e.

11 MATH PROBLEMS 6. Let (G, ) be a group with identity e and a G\{e}. We assume there exists an integer n 2 such that x n+ a = ax, for any x G. Prove that x n2 = e, for any x G. Solution: In x n+ a = ax, we let substitute xa for x to get: (xa) n+ a = axa. Simplifying, we get (xa) n+ = ax. Since ax = x n+ a, it follows that (xa) n+ = x n+ a. We rewrite this as x(ax) n a = xx n a, which simplifying again, implies (ax) n = x n. We have proved that { (ax) n+ = (ax) n ax = x n ax (ax) n+ = ax(ax) n = axx n This implies x n ax = axx n, which gives x n a = ax n. Hence, x n and a commute, for any x G. In x n+ a = ax we substitute x n for x to see that (x n ) n+ a = ax n. Since x n a = ax n, this implies x n(n+) a = x n a. We obtain that x n2 = e, for any x G. 7. Find all groups (G, ) that are the union of three proper subgroups, one of which has a prime number of elements. Solution: We know G = H H 2 H 3, where H 3 = p for a prime number p. Let x H \(H 2 H 3 ) x 2 H 2 \(H H 3 ). For example, such x exists, as otherwise it will imply that H (H 2 H 3 ) so G = H 2 H 3. However, it is known that a group cannot be written as the union of two proper subgroups. The existence of x 2 is established similarly. Now, if x x 2 H, since x H we get x 2 H as well. This is a contradiction to the definition of x 2. Similarly, one can see that x x 2 H 2 is not possible either. Hence, this leaves us with x x 2 H 3 \(H H 2 ). Let us denote a = x x 2. Since H 3 = p and p is prime, it follows that Furthermore, for any k {,..., p }, H 3 = {e, a, a 2,..., a p }. a k H 3 \(H H 2 ). Indeed, if b := a k, then we have H 3 = {e, b,..., b p }. This shows that if b H H 2, then H 3 (H H 2 ), which is a contradiction because G would be the union of H and H 2.

12 2 OVIDIU MUNTEANU Now let x H H 2. The same as above, we can see that ax H 3 \(H H 2 ). It means there exists k such that ax = a k, therefore x = a k, and we must have k =. This proves that H H 2 = {e}. Obviously, we also have H 2 H 3 = {e} and H H 3 = {e}.since H = {H \(H 2 H 3 )} {H H 2 } {H H 3 } it remains to find H \(H 2 H 3 ). Let x H \(H 2 H 3 ), then xx 2 H 3 \(H H 2 ). Hence, there exists k so that xx 2 = a k. We first suppose k >. Then, xx 2 = a k x x 2 thus x = a k x, and a k = xx H, contradiction. We further notice that k = is impossible as well because it would imply x 2 = x H. We must have xx 2 = x x 2, so x = x. This shows H = {e, x }, and similarly H 2 = {e, x 2 }, with x 2 = x 2 2 = e. This shows G = {e, x, x 2, a, a 2,..., a p }. Since ax G\{e, x, a,..., a p }, we have ax = x 2. It then results x x 2 = x 2 x and a 2 = e. This proves G is Klein s group of four elements. 8. Let (G, ) be a group and n N, n 2(mod 3) so that (xy) n = x n y n and x 3 y 3 = y 3 x 3, for any x, y G. Show that (G, ) is abelian. Solution: Let s use that x n y n = (xy) n = x(yx) n y, so (yx) n = x n y n. From here we have This implies that Therefore, it follows that Furthermore, we have y n x n = (yx) n = yx(yx) n = yxx n y n = yx n y n. x n y n = y n x n. x n(n ) y n(n ) = (x n ) n (y n ) n = (y n ) n (x n ) n = y n(n ) x n(n ). (xy) n(n ) = ((xy) n ) n = (x n y n ) n = y n(n ) x n(n ).

13 This shows that From here we get: MATH PROBLEMS 3 (yx) n(n ) = x n(n ) y n(n ). (xy) n(n ) = (yx) n(n ), for any x, y G. Since n 2 (mod 3) it follows that n(n )+ (mod 3) hence x n(n )+ y n(n )+ = y n(n )+ x n(n )+. Moreover, we have: and the same as above it follows that (xy) n(n )+ = x(yx) n(n ) y = xx n(n ) y n(n ) y = x n(n )+ y n(n )+ (xy) n(n )+ = (yx) n(n )+, for any x, y G. If we denote by m = n(n ), then we have proved that { (xy) m = (yx) m Since now we have (xy) m+ = (yx) m+ (xy) m+ = (yx) m+ = (yx) m (yx) = (xy) m (yx), we immediately get xy = yx, proving that G is abelian. 9. Determine all groups (G, ) with 22 elements so that f : G G, defined by f(x) = x 4 is a group homomorphism. Solution: We use that x 4 y 4 = (xy) 4 = x(yx) 3 y which implies (yx) 3 = x 3 y 3. Hence, we have y 4 x 4 = (yx) 4 = yx(yx) 3 = yxx 3 y 3 = yx 4 y 3. Simplifying this implies x 4 y 3 = y 3 x 4. This proves that x 2 y 2 = (x 3 ) 4 (y 4 ) 3 = (y 4 ) 3 (x 3 ) 4 = y 2 x 2. We now observe that therefore (xy) 2 = ((xy) 4 ) 3 = (x 4 y 4 ) 3 = y 2 x 2, (xy) 2 = x 2 y 2 = y 2 x 2, for any x, y G.

14 4 OVIDIU MUNTEANU Finally, this implies that (xy) 24 = ((xy) 2 ) 67 = (x 2 y 2 ) 67 = (x 2 ) 67 (y 2 ) 67 = x 24 y 24. Now we use that G has 22 elements, so a 24 = a 2, for any a G. By above, this yields that: (xy) 2 = x 2 y 2, for any x, y G. This immediately implies G is abelian. Since G = 22 = 2 9, so G is a free of squares it follows by a know result that G is isomorphic to Z 22.. Let (A, +, ) be a ring with an odd number of elements. We denote by I := {a A a 2 = a}. Prove the following: a) A 3 I 3. b) Determine A provided A = 3 I 3. Solution: a) We know A has an odd number of elements, say A = 2n +. Then we see that 2 (n + ) =, so x = 2 is invertible in A. Let us denote by M := {x A x 2 = }. For any x M, we have ( 2 ( + x) ) 2 = 4 ( + 2x + ) = 2 ( + x), hence 2 ( + x) I. We define the function f : M I by f(x) := 2 ( + x), which is obviously bijective. Hence, M = I. Define also J := {a A a I}. Let us observe that I J = {}; I M = {} and J M = { }. Indeed, if a I J, then a = a = a 2. As 2 is invertible, it results that a =. Now if a I M, we get a 2 = and a 2 = a, so a =. Since I, J, M have the same number of elements, this yields that A 3 I 3. b) If A has exactly three elements, it follows that A is isomorphic to Z 3. Assuming A > 3, we can show that A is isomorphic to Z 3 Z 3. From the proof of a), we know that A = I J M. Therefore, for any x A, we have that x 2 {, x, x}. Since 2 is invertible in A, from here we immediately get that 3 =. Furthermore, we observe that the invertible elements of A must belong to M, so (M, ) forms an abelian group. Choose any a I\ {, }. Since f is bijective, there exists a corresponding y M such that a = y. Now let x M be arbitrary. Since x and y commute, we see that x and a commute. If ax is invertible, it would mean a is invertible as well,

15 MATH PROBLEMS 5 so a =. This is a contradiction, which means ax I J. Let us assume ax I, therefore ax = (ax) 2 = a 2 x 2 = a. Now notice that (a x) 2 = a 2a + = a; and on the other hand, (a x) 2 {, a x, x a}. This implies that x {, a }. In the second case, when ax J, a similar computation gives that x {, a + }. Since a was fixed, it follows that M {,, a, a + }. It is easy to check the converse inclusion is true as well, therefore M = 4, and now A Z 3 Z 3 follows directly from here.. Let (A, +, ) be a commutative ring, having 2n+ elements, where n 4. Let us assume that if a A is not invertible, then a 2 { a, a}. Prove that A is a field. Solution. Let us assume by contradiction that A is not a field. Then there exists a I\ {, }, where I := {a A : a 2 = a}. Indeed, we know there exists x A\{, }, which is not invertible. By hypothesis, it follows that x 2 { x, x}. Then, for either a = x or a = x, we can arrange that a 2 = a. So the set I has at least three elements. Now take any x A, which is invertible. The element ax cannot be invertible, because a is not. Therefore, (ax) 2 {ax, ax}. Using that A is commutative, it follows that ax {a, a}. We now use that the group (A, +) has 2n + elements, which in particular implies that 2 (n + ) =. Hence, this shows that 2 is invertible in A, which from above we know it implies that 2a = a. This means that 3 A is not invertible, which by hypothesis it implies that 3 2 {3, 3}. In both cases we get that 3 =. Recall that for any x A invertible, we have ax {a, a}. If ax = a, it follows that (x a) 2 = x 2 2ax + a 2 = x 2 2a + a 2 = x 2 a 2 = (x a) (x + a). We see that x a cannot be invertible, as otherwise we get x a = x + a, so a =. Hence, since x a is not invertible, we get (x a) 2 {x a, x + a}. Consequently, this means that x 2 a {x a, x+a}. If x 2 a = x a, then x =, as x is invertible. If x 2 a = x + a then x (x + ) = a which implies that x + is not invertible. In this case, we use the hypothesis again to conclude that (x + ) 2 {x +, x }, which now implies that x 2 =. Indeed, if (x + ) 2 = x +, then x 2 + x =, which

16 6 OVIDIU MUNTEANU implies x =. If (x + ) 2 = x, we find that x 2 + 3x + 2 =. Using that 3 = in A, it follows that x 2 =. As we have established above that x 2 + x + a =, using x 2 =, we get that x = a. Concluding, this shows that if ax = a, then x {, a }. On the other hand, if ax = a, then we proceed similarly for (x + a) 2 = x 2 a 2, and get that x {, a + }. This proves that any invertible element of A belongs to {,, a, a + } and the converse is easily checked as well. Certainly, if b I\ {, } is different from a, the argument above shows that thus b = a. Therefore, {,, a, a + } = {,, b, b + }, A = {,,, a, a, a, a +, a, a + } which is a contradiction because A cannot have 9 elements. Thus A is a field. 2. Let (A, +, ) be a ring without zero divisors and a A\ {}. Assume that there exists n N so that x n+ a = ax, for any x A. Prove that A is a field. Solution: In x n+ a = ax, we take x = xa and get: (xa) n+ a = axa. Simplifying by a, as A does not have zero divisors, we get (xa) n+ = ax. Moreover, we have ax = x n+ a, which yields (xa) n+ = x n+ a. We rewrite this as x ((ax) n x n ) a =. Again, simplifying by a and x, we see that (ax) n = x n, for any x A\{}. This proves that { (ax) n+ = (ax) n ax = x n ax which implies that (ax) n+ = ax(ax) n = axx n x n ax = axx n. We rewrite this as (x n a ax n )x =, which implies that x n a = ax n, for any x A\ {}. In x n+ a = ax we now make x = x n to obtain: (x n ) n+ a = ax n. By this, we get x n(n+) a = x n a, which means x n (x n2 )a =. Now we notice that if x A\{}, then x n A\{} as well. We can therefore conclude that This means A is a field. x n2 =, for any x A\{}.

17 MATH PROBLEMS 7 2. Analysis. Let f : [, ) R be smooth such that f (n) (x), for any x and n N. Prove that f (n) (x) e x, for any x and n N. Solution: We show that f(x) e x, for any x. Let n N and g : [, ) R defined by g(x) = f(x) ( ) + x xn ! n!. By induction after k N one computes ) g (k) (x) = f (k) x(n k) (x) ( , x! (n k)! so g (n) (x) = f (n) (x). This means g (n ) is increasing. However, g (n ) (x) = f (n ) (x) ( +!) x, therefore g (n ) () = f (n ) (). Hence, this shows that g (n ) is nonnegative. It follows that g (n 2) in increasing. Continuing, we eventually get that g nonnegative, hence g increasing. But g() = f(), so g nonnegative. This argument shows f(x) + x xn, for any n N. Taking a limit! n! as n we obtain f(x) e x, for any x [, ). For p N arbitrary, we let h : [, ) R, h(x) = f (p) (x). Then h is smooth and h (n) (x), for any n. The above argument shows h(x) e x. 2. Assume f : ( 2, 2) R is bounded and has the property that for any x, y ( 2, 2), x y, there exists z ( 2, 2) such that f(x) f(y) = (x y)f(z). a) Is f differentiable on ( 2, 2)? b) If, in addition, we know that z is always between x and y, find f. Solution: a). Define f : ( 2, 2) R by f(x) = { x, x ( 2, ) 2 x, x (, 2) We prove that for any x, y ( 2, 2), x y, there exists z ( 2, 2) such that f(x) f(y) = (x y)f(z). However, it is clear that f is not differentiable at x =. We have the following cases: If x, y (, 2), then f(x) = x and f(y) = y, so f(x) f(y) x y = = f()

18 8 OVIDIU MUNTEANU If x ( 2, ], y (, 2) then f(x) = x and f(y) = y. Denoting a := x we have 2 Let us observe that f(x) f(y) x y = x y 2 x y = y + a 2 y + a. < y + 2 a y + a. Since f : ( 2, 2) (, 2) is onto, it follows that there exists z ( 2, 2) such that If x, y ( 2, ] then and f(z) = y + 2 a y + a f(x) f(y) x y f(x) f(y) =. x y f( 2 ) = f(x) f(y) =. 2 x y This shows f has the required property, but it is not differentiable in zero. b). Since f is bounded, we have f(z) M, for any z ( 2, 2). In particular, = 2 f(x) f(y) M x y, which shows f is continuous. Furthermore, for x ( 2, 2) arbitrary, we show f (x) = f(x). Let y ( 2, 2), y x. There exists z between x and y so that f(z) = f(y) f(x). y x When y x we have z x, as well. Since f is continuous in x we get that f is differentiable in x and f (x) = f(x). This proves f(x) = ce x. 3. Let f : [, ] [, ] be continuous such that for any x [, ], Prove that f is constant. f(x) {sin(f(x)), f(sin(x))} Solution: Let x [, ]. If f(x) = sin(f(x)), since f(x) [, ] and siny = y has a unique solution y = for y [, ], it follows that f(x) =. Of course, if f = the problem is solved. We may assume there exists a [, ] such that f(a). From what we proved above we infer that f(a) = f(sina). Let b = sina, then f(b) = f(a) and f(b) {sin(f(b), f(sin(b))}. As above we can deduce that f(b) = f(sinb). Hence, f(a) = f(sin(sina)). Continuing, we get f(a) = f(sin... sin(a)),

19 MATH PROBLEMS 9 for any n N. However, let us show that But lim sin... sina =. n Indeed, let a n := sina n,and a := a [, ]. We find that a n = sina n a n, so a n is decreasing. Furthermore, a n [, ], hence a n is convergent, being monotone and bounded. Denoting l := lim n a n, the fact that a n = sina n implies in the limit that l = sinl. Since l [, ], we conclude that l =. Hence, we have that f(a) = lim n f(sin... sina) = f( lim n sin... sina) = f(), where we have used that f is continuous in. We now let α := f(). From what we have showed so far, we have that f(x) {, α}, for any x [, ]. Now f must be constant, as it is continuous. 4. Let a, b R, such that a 2 + b 2 <. Define I (a, b) = 2π + a cos t + b sin t dt Prove that I (a, b) 2π, and equality holds if and only if a = b =. Solution: Define F (x) = x + q cos s ds, where q = a 2 + b 2 [, ). There exists θ [, 2π), such that a = q cos θ and b = q sin θ. We have that I depends on both q and θ, and I (q, θ) = 2π + q cos (t + θ) dt. Here we make the change of variable t + θ = s to get I (q, θ) = θ+2π Consequently, for q [, ) fixed, we have that di dθ = F (θ + 2π) F (θ) = θ + q cos s ds = F (θ + 2π) F (θ). + q cos (θ + 2π) + q cos θ =. This shows that I is independent of θ, and depends only on q. Hence, I (q, θ) = I (q, ) = 2π + q cos t dt.

20 2 OVIDIU MUNTEANU We now observe that I (q, ) = 4 2π Above, we used that and that π 2 + q cos t + π 2 dt = 2 + q cos t dt 4 π ( q 2 cos 2 t) 4 2 = 2π. q cos t 2 = q 2 cos 2 t, ( + + q cos t q cos t ) dt + q cos t q cos t 2 ( q 2 cos 2 t) 4 respectively. It is obvious from here that equality here holds only if q =. 5. We let For n N, find F = {f : [, ] (, ), f is increasing on [, ]}. min f F tf n (t)dt ( ) n. f(t)dt Solution: As f is increasing and positive, f n is increasing as well, for any n N. We can apply Chebyshev s inequality to get: ( ) ( ) tf n (t)dt tdt f n (t)dt = 2 f n (t)dt. From Hölder s inequality, it follows, for any n 2 ( n f(t)dt) f n (t)dt, which yields tf n (t)dt ( n f(t)dt), for any n N. 2

21 This proves that MATH PROBLEMS 2 tf n (t)dt ( ) n f(t)dt Since the value 2 is achieved for f = F, it means the desired value is Let f : [, ] R be differentiable so that f (x) + e f(x) = e x, for any x [, ]. Assuming f() [, ], prove that f(x) [, ], for any x [, ]. Solution: Let g : [, ] R, g(x) = { e f(x) f(x) if f(x) if f(x) = Notice that g is continuous, as if f(a) = then Now the function is differentiable and e f(x) lim g(x) = lim x a x a f(x) u : [, ] R, = lim y e y y u(x) = f(x)e x g(t)dt =, u (x) = e x g(t)dt (f (x) + f(x)g(x)) ( ) = e x g(t)dt f (x) + f(x) ef(x) f(x) = e x g(t)dt (e x ). This shows u is increasing. But u() = f(), hence u(x), and this proves f(x). Now we show f(x), for any x [, ]. In this sense, we define: h : [, ] R, h(x) = which is also continuous. Then the function v : [, ] R, { e e f(x) f(x) if f(x) e if f(x) = v(x) = ( f(x)) e x h(t)dt.

22 22 OVIDIU MUNTEANU is differentiable and v (x) = e x h(t)dt ( f (x) + h(x)( f(x))) = e ( x h(t)dt f (x) + e e f(x)) = e x h(t)dt (e e x ). So v is increasing, and since v() = f(), this shows v(x), i.e., f(x). 7. Let us define the sequence f n : [, ] R of continuous functions by: Prove that f n+ (x) = ln( + tx) f n (t)dt, where n N. t lim f n(x) =, for any x [, ]. n Solution: For any x [, ], we have which shows Let us denote by ln( + tx) ln( + t), ln( + tx) dt t M = ln( + t) dt. t ln( + t) dt. t We can show that M <. Indeed, it is known that ln( + t) < t, for any t (, ]. Integrating, we have so M <. We have thus proved that ln( + t) dt <, t Let us denote now ln( + tx) dt M <, for any x [, ]. t M n := sup f n (t). t [,]

23 MATH PROBLEMS 23 For x [, ] fixed, we have: f n+ (x) Maximizing in x, this implies that We iterate this to find and since M <, we get Since f n+ (x) MM n, we obtain M n ln( + tx) t MM n. M n+ MM n. f n (t) dt ln( + tx) dt t M n MM n M 2 M n 2... M n M lim M n =. n lim f n(x) =. n 8. Let f : R R be continuous. We assume there exists a divergent sequence (a n ) n N so that (f(a n )) n N is convergent and lim f(a n) Im (f). n Show that f is not one to one. Here we have denoted Im(f) := {y R : y = f (x) for some x R}. Solution: We assume by contradiction that f is injective. Since f is continuous and injective, it results that f is monotone. Hence, the following limit exists: L := lim x f(x). Let us observe that (a n ) n N is not bounded. Indeed, if (a n ) were bounded, since it is divergent, it must have two subsequences (a nk ) k N a and (a n ) k N b, where k a b. Since f is continuous, it follows that lim f(a n k ) = f(a) and lim f(a k k n ) = f(b). k Since (f (a n )) n is convergent, the limit must be the same, so f(a) = f(b). This contradicts that f is injective.

24 24 OVIDIU MUNTEANU Therefore, (a n ) n is unbounded, which without loss of generality means we can extract a subsequence (a nk ) k N of a n, so that We have lim a n k =. k L = lim f(x) = lim f(a nk ) x k = lim f(a n ) Im (f). n This proves that there exists a R so that L = f(a). This contradicts f is injective.