Update cookies preferences

E-book: Stirling Numbers

(Moscow Pedagogical State University, Russia)
Other books in subject:
  • Format - EPUB+DRM
  • Price: 269,10 €*
  • * the price is final i.e. no additional discount will apply
  • Add to basket
  • Add to Wishlist
  • This ebook is for personal use only. E-Books are non-refundable.
Other books in subject:

DRM restrictions

  • Copying (copy/paste):

    not allowed

  • Printing:

    not allowed

  • Usage:

    Digital Rights Management (DRM)
    The publisher has supplied this book in encrypted form, which means that you need to install free software in order to unlock and read it.  To read this e-book you have to create Adobe ID More info here. Ebook can be read and downloaded up to 6 devices (single user with the same Adobe ID).

    Required software
    To read this ebook on a mobile device (phone or tablet) you'll need to install this free app: PocketBook Reader (iOS / Android)

    To download and read this eBook on a PC or Mac you need Adobe Digital Editions (This is a free app specially developed for eBooks. It's not the same as Adobe Reader, which you probably already have on your computer.)

    You can't read this ebook with Amazon Kindle

"Stirling numbers are one of the most known classes of special numbers in Mathematics, especially in Combinatorics and Algebra. They were introduced by Scottish mathematician James Stirling (1692-1770) in his most important work, Differential Method witha Tract on Summation and Interpolation of Infinite Series (1730). Stirling numbers have rich history; many arithmetic, number-theoretical, analytical and combinatorial connections; numerous classical properties; as well as many modern applications. This book collects together much of the scattered material on the two subclasses of Stirling numbers to provide a holistic overview of the topic. From the combinatorial point of view, Stirling numbers of the second kind S(n,k) count the number of ways to partition a set of n different objects (i.e., a given n-set) into k non-empty subsets. Stirling numbers of the first kind s(n, k) give the number of permutations of n elements with k disjoint cycles. Both subclasses of Stirling numbers play an important role in Algebra: they form the coefficients, connecting well-known sets of polynomials. This book is suitable for students and professionals, providing a broad perspective of the theory of this class of special numbers, and many generalizations and relatives ofStirling numbers, including Bell numbers and Lah numbers. Throughout the book, readers are presented with exercises to test and cement their understanding"--