This paper provides a simple formula describing all Nash equilibria in monotone symmetric singleton congestion games. Our approach also yields a new and short proof establishing the existence of a Nash equilibrium in this kind of congestion games.