  The numbers of even and odd permutations with a given ascent number are
investigated using an operator that was previously introduced by the author.
Their difference is called a signed Eulerian number. By means of the operator
the recurrence relation for signed Eulerian numbers is deduced, which was
obtained by an analytic method. Our approach is straightforward and enables us
to deduce other properties including divisibility by prime powers.
