Let G be a finite groups. The power graph of G is a graph with vertex set G and two distinct element x, y are adjacent if one of them is power another. We give a short elementary proof for Gamma(Z(n)) has a maximum number edges in all groups of order n.