This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

2007 Nicolae Păun, 3
In the following exercise, $ C_G (e) $ denotes the centralizer of the element $ e $ in the group $ G. $ [b]a)[/b] Prove that $ \max_{\sigma\in S_n\setminus\{1\}} \left| C_{S_n} (\sigma ) \right| <\frac{n!}{2} , $ for any natural number $ n\ge 4. $ [b]b)[/b] Show that $ \lim_{n\to\infty} \left(\frac{1}{n!}\cdot\max_{\sigma\in S_n\setminus\{1\}} \left| C_{S_n} (\sigma ) \right|\right) =0. $ [i]Alexandru Cioba[/i]
group theory limit group of permutations permutation centralizer real analysis inequalities limits permutations