Muutke küpsiste eelistusi

E-raamat: Stirling Numbers

(Moscow Pedagogical State University, Russia)
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 269,10 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

"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"--