AN AN EXPLICIT FORMULA FOR THE STIRLING NUMBERS OF THE FIRST KIND THROUGH INTEGER PARTITIONS

AN AN EXPLICIT FORMULA FOR THE STIRLING NUMBERS OF THE FIRST KIND THROUGH INTEGER PARTITIONS

Authors

  • Gabriel de Freitas Pinheiro Universidade Estadual de Campinas
  • Irene Magalhães Craveiro Universidade Federal da Grande Dourados

DOI:

https://doi.org/10.34179/revisem.v9i3.21321

Abstract

The aim of this article is to present an explicit formula for the Stirling numbers of the first kind and prove it through counting arguments. This is only possible because these numbers have a strong combinatorial appeal, since we can define them as the number of ways to distribute n people around k identical circular tables, without leaving any empty tables. In order to establish the proof for the main theorem, we will explore some identities involving the Stirling numbers of the first kind with the binomial coefficient, as well as introduce the concept of partitioning positive integers and use it as the main tool for combinatorial arguments in the proof of the main result. Additionally, we prove new identities and others found in the literature through this theorem.

Downloads

Download data is not yet available.

Downloads

Published

2024-10-14

How to Cite

de Freitas Pinheiro, G., & Magalhães Craveiro, I. (2024). AN AN EXPLICIT FORMULA FOR THE STIRLING NUMBERS OF THE FIRST KIND THROUGH INTEGER PARTITIONS. Revista Sergipana De Matemática E Educação Matemática, 9(3), 48–64. https://doi.org/10.34179/revisem.v9i3.21321
Loading...