Abstract
Why I hate the Continuous and Love the Discrete
I have always loved the discrete and hated the continuous. Perhaps it was the trauma of having to go through the usual curriculum of “rigorous”, Cauchy-Weierstrass-style, real calculus, where one has all those tedious, pedantic and utterly boring, ε−δ proofs. The meager (obvious) conclusions hardly justify the huge mental efforts!
Complex Analysis was a different story. Even though officially “continuous”, it has the feel of discrete math, and one can “cheat” and consider power series as formal power series, and I really loved it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W.Y.C. Chen, C.J. Wang, and L.X.W. Wang, The Limiting Distribution of the coefficients of the q-Catalan Numbers, Proc. Amer. Math. Soc. 136 (2008), 3759-3767.
G.P. Egorychev, “Integral Representation and the Computation of Combinatorial Sums”, (translated from the Russian), Amer. Math. Soc., Providence, 1984.
William Feller, “An Introduction to Probability Theory and Its Application”, volume 1, three editions. John Wiley and sons. First edition: 1950. Second edition: 1957. Third edition: 1968.
R. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison Wesley, Reading, 1989.
G. Louchard and H. Prodinger, The number of inversions in permutations: a saddle point approach, J. Integer Seq. 6 (2003), A03.2.8.
B.H. Margolius, Permutations with inversions, J. Integer Seq. 4 (2001), A01.2.4.
V.N. Sachkov, “Probabilistic Methods in Combinatorial Analysis”, Cambridge University Press, New York, 1997.
H. Wilf and D. Zeilberger, An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities, Invent. Math. 108 (1992), 575-633.
Doron Zeilberger, “Real” Analysis is a Degenerate Case of Discrete Analysis. In: “New Progress in Difference Equations” (Proc. ICDEA 2001), edited by Bernd Aulbach, Saber Elaydi, and Gerry Ladas, Taylor & Francis, London, 2004.
Doron Zeilberger, An Enquiry Concerning Human (and Computer!) [Mathematical] Understanding. In: C.S. Calude, ed., “Randomness & Complexity, from Leibniz to Chaitin”, World Scientific, Singapore, Oct. 2007.
Doron Zeilberger, Fully AUTOMATED Computerized Redux of Feller’s (v.1) Ch. III (and Much More!), Personal Jouranl of Ekhad and Zeilberger (Nov. 14, 2006), http://www.math.rutgers.edu/~zeilberg/pj.html.
Doron Zeilberger, A Lattice Walk Approach to the “inv” and “maj” q -counting of Multiset Permutations, J. Math. Anal. Applications 74 (1980), 192-199.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zeilberger, D. (2009). The Automatic Central Limit Theorems Generator (and Much More!). In: Kotsireas, I., Zima, E. (eds) Advances in Combinatorial Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03562-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-03562-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03561-6
Online ISBN: 978-3-642-03562-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)