| H.S. Wilf,What is an answer?, Amer. Math. Monthly, 89 (1982), 289-292. |
....kinds of problems require the full force of P olya s theorem 6. What does it mean to solve a combinatorial problem like the m enage problem Is a closed form solution better than a recurrence What if what we really want is to generate configurations, rather than just count them (See Wilf [14]. 7. Why did Tait not pursue the m enage problem What do knots have to do with atomic spectra What was it like to live in Nebraska in the 1880 s (See Conway [2] 8. The relaxed m enage problem can be further generalized as follows: Given two graphs G 1 and G 2 with the same number of ....
H. Wilf. What is an answer? Amer. Math. Monthly, 89:289--292, 1982. 9
....whereas the latter requires O(m k ) calculations. However, in both forms the evaluation of the right side of the integral is much faster (for specific m, n,andk) than the direct evaluation of the left side of our intergal. Hence both forms are indeed complete answers in the sense of Wilf [W82]. 2. The present paper is an example of what Doron Zeilberger [Z98] calls WZ Theory, Chapter 1 1 2. Even though, at present, our proof, for general k,was human generated, it seems that by using John Stembridge s [S95] Maple package for symmetric functions,SF, or an extension of it, it should be ....
H.S. Wilf,What is an answer?, Amer. Math. Monthly, 89 (1982), 289-292.
....whereas the latter requires O(m k ) calculations. However, in both forms the evaluation of the right side of the integral is much faster (for speci c m, n, and k) than the direct evaluation of the left side of our intergal. Hence both forms are indeed complete answers in the sense of Wilf [W82]. 2. The present paper is an example of what Doron Zeilberger [Z98] calls WZ Theory, Chapter 1 1 2. Even though, at present, our proof, for general k, was human generated, it seems that by using John Stembridge s [S95] Maple package for symmetric functions,SF, or an extension of it, it should be ....
H.S. Wilf,What is an answer?, Amer. Math. Monthly, 89 (1982), 289-292.
....p(10 13 ) turns out to be too small by 941, see Section 6. In this paper we propose new algorithms of Meissel Lehmer type for computing p(x) and analyze their asymptotic computational complexity. Our interest in the asymptotic complexity of computing p(x) was stimulated by a paper of H. S. Wilf [15], which cited p(x) as an example of a function whose individual values are hard to compute. Indeed in this connection it appears that the existing methods for computing p(x) which are based on variants of the Meissel Lehmer method, have asymptotic running times at least c e x 1 e for any ....
H. S. Wilf, What is an answer?, Amer. Math. Monthly 89 (1982), 289-292.
No context found.
H.S. Wilf,What is an answer?, Amer. Math. Monthly, 89 (1982), 289-292.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC