Skip to main content Accessibility help

On a generalization of a waiting time problem and some combinatorial identities

  • B. S. El-desouky (a1), F. A. Shiha (a1) and A. M. Magar (a1)


In this paper we give an extension of the results of the generalized waiting time problem given by El-Desouky and Hussen (1990). An urn contains m types of balls of unequal numbers, and balls are drawn with replacement until first duplication. In the case of finite memory of order k, let ni be the number of type i, i = 1, 2, …, m. The probability of success pi = ni/N, i = 1, 2, …, m, where ni is a positive integer and Let Ym,k be the number of drawings required until first duplication. We obtain some new expressions of the probability function, in terms of Stirling numbers, symmetric polynomials, and generalized harmonic numbers. Moreover, some special cases are investigated. Finally, some important new combinatorial identities are obtained.


Corresponding author

Postal address: Department of Mathematics, Faculty of Science, Mansoura University, 35516 Mansoura, Egypt.
∗∗ Email address:


Hide All
[1] Arnold, B. C. (1972). The waiting time until first duplication. J. Appl. Prob. 9, 841846.
[2] Beardon, A. F. (1996). Sums of power of integers. Amer. Math. Monthly 103, 201213.
[3] Cakic, N. P. (1995). The complete Bell polynomials and numbers of Mitrinovic. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Math. 6, 7478.
[4] Comtet, L. (1972). Nombres de Stirling généraux et fonctions symétriques. C. R. Acad. Sci. Paris A 275, A747A750.
[5] Comtet, M. (1974). Advanced Combinatorics. Reidel, Dordrecht.
[6] El-Desouky, B. S. (2015). A generalization of Stirling and Lah numbers with some computational applications. To appear in ARS Combinatoria .
[7] El-Desouky, B. S. and Cakic, N. P. (2011). Generalized higher order Stirling numbers. Math. Comput. Modelling 54, 28482857.
[8] El-Desouky, B. S. and Hussen, S. A. (1990). A generalization of a waiting time problem. Adv. Appl. Prob. 22, 758760.
[9] El-Mikkawy, M. and El-Desouky, B. (2003). On a connection between symmetric polynomials, generalized Stirling numbers and the Newton general divided difference interpolation polynomial. Appl. Math. Comput. 138, 375385.
[10] Mccabe, B. (1970). Problem E2263. Amer. Math. Monthly 77, 1008.
[11] Riordan, J. (1968). Combinatorial Identities. John Wiley, New York.
[12] Rosen, K. H., (ed.) (2000). Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton, FL.


MSC classification


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed