I assume you're acquainted with the basics of rep. theory. One can prove that for non-trivial characters of the characters of come in pairs of equal degree, say say with degress . So, . But, one has that if is the number of conjugacy classes then . Now, since is odd one has that each is odd, say equal to . Then, plugging this into the equation will give the desired result.

I assume you're acquainted with the basics of rep. theory. One can prove that for non-trivial characters of the characters of come in pairs of equal degree, say say with degress . So, . But, one has that if is the number of conjugacy classes then . Now, since is odd one has that each is odd, say equal to . Then, plugging this into the equation will give the desired result.

It is not necessarily true that irreducible characters of finite group G come in pairs like.

For example, has two irreducible characters, one of which is the trivial character. The reason why irreducible characters come in pairs is that the finite group G is of odd order by hypothesis. As my previous post showed, if G is of odd order, the trivial character is the only irreducible character that is real valued, and other irreducible characters are paired.

It is not necessarily true that irreducible characters of finite group G come in pairs like.

For example, has two irreducible characters, one of which is the trivial character. The reason why irreducible characters come in pairs is that the finite group G is of odd order by hypothesis. As my previous post showed, if G is of odd order, the trivial character is the only irreducible character that is real valued, and other irreducible characters are paired.

Right, which is what I was leaving out for him to conclude. Thus why I said "one can prove"...maybe I should have stated 'you can prove'.