A note on the countable union of prime submodules.
Let G be a finite group of even order. We give some bounds for the probability p(G) that a randomly chosen element in G has a square root. In particular, we prove that p(G) ≤ 1 - ⌊√|G|⌋/|G|. Moreover, we show that if the Sylow 2-subgroup of G is not a proper normal elementary abelian subgroup of G, then p(G) ≤ 1 - 1/√|G|. Both of these bounds are best possible upper bounds for p(G), depending only on the order of G.
A graph is called weakly perfect if its chromatic number equals its clique number. In this note a new class of weakly perfect graphs is presented and an explicit formula for the chromatic number of such graphs is given.
Page 1