Nyuton binomi va paskal uchburchagining kombinatorikadagi qo‘llanilishi
Аннотация
Ushbu obzor maqolada Nyuton binomi formulasi va Paskal uchburchagining kombinatorikadagi o‘rni tahlil qilinadi. Binomial koeffitsiyentlarning asosiy xossalari, ularning kombinatsiyalar soni bilan bog‘liqligi hamda sanash masalalari, ehtimollar nazariyasi va sonlar nazariyasidagi qo‘llanilishlari yoritiladi. Maqolada mavzu bo‘yicha klassik va zamonaviy adabiyotlar umumlashtirilgan.
Kalit so‘zlar: Nyuton binomi, Paskal uchburchagi, binomial koeffitsiyent, kombinatsiya, kombinatorik ayniyat, hosil qiluvchi funksiya.
Библиографические ссылки
1. Aigner, M. (2007). A course in enumeration. Springer.
2. Benjamin, A. T., & Quinn, J. J. (2003). Proofs that really count: The art of combinatorial proof. Mathematical Association of America.
3. Brualdi, R. A. (2010). Introductory combinatorics (5th ed.). Pearson Prentice Hall.
4. Edwards, A. W. F. (2002). Pascal’s arithmetical triangle: The story of a mathematical idea. Johns Hopkins University Press.
5. Feller, W. (1968). An introduction to probability theory and its applications (3rd ed., Vol. 1). Wiley.
6. Graham, R. L., Knuth, D. E., & Patashnik, O. (1994). Concrete mathematics: A foundation for computer science (2nd ed.). Addison-Wesley.
7. Knuth, D. E. (1997). The art of computer programming: Vol. 1. Fundamental algorithms (3rd ed.). Addison-Wesley.
8. Lucas, E. (1878). Théorie des fonctions numériques simplement périodiques. American Journal of Mathematics, 1(2), 184–196.
9. Rosen, K. H. (2019). Discrete mathematics and its applications (8th ed.). McGraw-Hill Education.
10. Stanley, R. P. (2012). Enumerative combinatorics (2nd ed., Vol. 1). Cambridge University Press.
Опубликован
Как цитировать
Выпуск
Раздел
Лицензия

Это произведение доступно по лицензии Creative Commons «Attribution» («Атрибуция») 4.0 Всемирная.

