# Thread:

1. ## n > 1, prove the number of even perm. of [n] equals the number of odd perm. of [n]

For n > 1, prove that the number of even permutations of [n] equals the number of odd permutations of [n].

2. Originally Posted by qtpipi
For n > 1, prove that the number of even permutations of [n] equals the number of odd permutations of [n].
Let $\pi$ be a permutation of [n]. Define another permutation $\sigma$ by switching $\pi(1)$ and $\pi(2)$; i.e., define

$\sigma(1) = \pi(2)$
$\sigma(2) = \pi(1)$
$\sigma(j) = \pi(j)$ for $j > 2$.

Since $\pi$ and $\sigma$ differ only by a transposition, they have opposite parity, i.e. one is odd and one is even. So we have established a bijection between the even and odd permutations, and there are equal numbers of each.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 10, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9234729409217834, "perplexity_flag": "head"}