Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Symbolization Of Generating Functions; An Application Of The Mullin–Rota Theory Of Binomial Enumeration, Tian-Xiao He, Peter J.S. S, Leetsch C. Hsu
Symbolization Of Generating Functions; An Application Of The Mullin–Rota Theory Of Binomial Enumeration, Tian-Xiao He, Peter J.S. S, Leetsch C. Hsu
Tian-Xiao He
We have found that there are more than a dozen classical generating functions that could be suitably symbolized to yield various symbolic sum formulas by employing the Mullin–Rota theory of binomial enumeration. Various special formulas and identities involving well-known number sequences or polynomial sequences are presented as illustrative examples. The convergence of the symbolic summations is discussed.
An Euler-Type Formula For Ζ(2k +1), Tian-Xiao He, Michael J. Dancs
An Euler-Type Formula For Ζ(2k +1), Tian-Xiao He, Michael J. Dancs
Tian-Xiao He
In this short paper, we give several new formulas for ζ(n) when n is an odd positive integer. The method is based on a recent proof, due to H. Tsumura, of Euler’s classical result for even n. Our results illuminate the similarities between the even and odd cases, and may give some insight into why the odd case is much more difficult.