# An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication

\begin{abstract} In \cite{ShYa96} it was proved that a certain quantity $T_n$ occurring in the analysis of an algorithm on broadcast communication satisfies $4\ll \frac{T_n}{\log n}\ll 5$. We give an explicit expression for $T_n$ involving Bernoulli numbers and a precise asymptotic formula showing in particular that $\frac{T_n}{\log n}\to \frac{\pi^2}{3\log 2}= 4.74627644\ldots$. \end{abstract}

One of the authors of \cite{ShYa96} is C.-B. Yang. I had already the opportunity to report on an earlier paper of him.

grabner@weyl.math.tu-graz.ac.at,

This paper is available in the Tex, Dvi, and PostScript format.
(Back to List of Papers)