Abstract
Leonhard Euler certainly didn’t have permutations on his mind when in 1755 he wrote about the numbers bearing his name in this chapter. (He was trying to find an easy way to compute sums of the form \(1^k + 2^k + 3^k +\cdots \) for any value of k.) Nowadays, however, these numbers are usually defined combinatorially: in terms of permutations.
“If you don’t make mistakes, you’re not working on hard enough problems. And that’s a big mistake.”
–Frank Wilczek
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Petersen, T.K. (2019). Eulerian numbers. In: Inquiry-Based Enumerative Combinatorics. Undergraduate Texts in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-18308-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-18308-0_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18307-3
Online ISBN: 978-3-030-18308-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)