  We obtain sharp bounds for the number of n-cycles in a finite graph as a
function of the number of edges, and prove that the complete graph is optimal
in more ways than could be imagined. En route, we prove some sharp estimates on
power sums.
