Abstract: | We prove the equivalence between the problem of computing a multinominal x1n1·x2n2···xknk, posed by R. E. Bellman (Amer. Math. Monthly70 1963, 765), and the problem of computing simultaneously the monomials xn1,…, xnk, posed by D. E. Knuth (“Seminumerical Algorithms”, Sect. 4.6.3, Addison-Wesley, Reading, Mass 1969. |