All the papers (and lectures) listed here are exclusively published in this website (and many are also in arxiv.org, but not in a "regular" journal), unless noted otherwise.
The Past and Future of Enumerative Combinatorics [Videotaped Lecture] By Doron Zeilberger (posted April 7, 2014)
Automatic Proofs of Asymptotic ABNORMALITY (and much more!) of Natural Statistics Defined on Catalan-Counted Combinatorial Families By Shalosh B. Ekhad and Doron Zeilberger (posted March 21, 2014)
How to get Better and Better Rational Approximations to Pi Without Cheating By Shalosh B. Ekhad (posted March 14, 2014)
Proofs are dead, long live algorithms [Videotaped Lecture] By Doron Zeilberger (posted Feb. 18, 2014)
Two One-Line Proofs of Heron's Formula that Says that the Area-Squared of a Triangle is (a+b+c)(a+b-c)(a+c-b)(b+c-a)/16 By Shalosh B. Ekhad and Doron Zeilberger (posted Jan. 20, 2014) .
A Conjectured Explicit Determinant Evaluation Whose Proof Would Make Us Happy (and the OEIS richer) By Douglas Hofstadter and Doron Zeilberger (posted Jan. 7, 2014, revised April 17, 2014)
George Eyre Andrews (b. Dec. 4, 1938): A Reluctant REVOLUTIONARY [Videotaped Lecture] By Doron Zeilberger (posted Dec. 10, 2013)
How to Extend Károlyi and Nagy's BRILLIANT Proof of the Zeilberger-Bressoud q-Dyson Theorem in order to Evaluate ANY Coefficient of the q-Dyson Product By Shalosh B. Ekhad and Doron Zeilberger (posted Aug. 15, 2013)
Generalizing and Implementing Michael Hirschhorn's AMAZING Algorithm for Proving Ramanujan-Type Congruences By Edinah K. Gnang and Doron Zeilberger (posted June 27, 2013)
On a Conjecture of Melkamu Zeleke By Shalosh B. Ekhad (posted April 19, 2013)
A Short Proof of a Ptolemy-Like Relation for an Even number of Points
on a Circle Discovered by Jane McDougall
By Marc Chamberland and Doron Zeilberger (posted April 16, 2013)
[Also appeared (with a shorter title) in Amer. Mathematical Monthly v. 121(2014), 263-265]
On Euler's "Misleading Induction", Andrews' "Fix", and How to Fully Automate them By Shalosh B. Ekhad and Doron Zeilberger (posted April 3, 2013)
How To Generate As Many Somos-Like Miracles as You Wish
By Shalosh B. Ekhad and Doron Zeilberger (posted March 21, 2013)
[Also to appear in J. Difference Equations and Applications, a special issue in honor of Gerry Ladas]
How I Need a Drink, Alcoholic Of Course, After the Heavy Lectures Involving ... (Videotaped lecture) By Doron Zeilberger (posted March 20, 2013)
A Quick (.1 seconds!) Proof of Gigoujeu's Two-Circle Theorem By Shalosh B. Ekhad (posted March 17, 2013)
A (Human!) Proof of A Conjectured Triple Sum Identity Made By Juan Sebastian Pereyra By Doron Zeilberger (posted March 5, 2013)
A Proof in the Style of George Andrews (and G. H. Hardy, and Unfortunately MANY other, otherwise very smart, people) that 1+1+...+1 (n+1 times)= n+1 By Doron Zeilberger(posted Jan. 3, 2013)
Automated Counting of Towers (À La Bordelaise) [Or: Footnote to p. 81 of the Flajolet-Sedgewick Chef-d'œuvre] By Shalosh B. Ekhad and Doron Zeilberger(posted Dec. 17, 2012)
Pick Up Sticks By Larry Shepp, Doron Zeilberger, and Cun-Hui Zhang (posted Oct. 16, 2012)
The Amazing 3^{n} Theorem and its even more Amazing Proof [Discovered by Xavier G. Viennot and his École Bordelaise gang] By Doron Zeilberger (posted Aug. 10, 2012)
Joyal's Proof of Cayley's Formula By Gyu Eun Lee and Doron Zeilberger (posted July 18, 2012)
The Rise and Fall of Astrology and the Future Fall of the so-called Infinity(Videotaped lecture) By Doron Zeilberger (posted March 29, 2012)
The Joy of Dreaming to be Famous (Videotaped lecture) By Doron Zeilberger (posted March 1, 2012)
The Composition Enumeration Reciprocity Theorem By Doron Zeilberger (Written Feb. 28, 2012)
Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux By Shalosh B. Ekhad and Doron Zeilberger (Written Feb. 20, 2012)
The number of m-Dimensional Partitions of Eleven and Twelve By Shalosh B. Ekhad (Written Feb. 15, 2012)
A Maple One-Line Proof of George Andrews's Formula that Says that the Number of Triangles with Integer Sides Whose Perimeter is n Equals {n^{2}/12} -[n/4][(n+2)/4] By Shalosh B. Ekhad (Written Feb. 6, 2012)
Using GENERATINGFUNCTIONOLOGY to Enumerate Distinct-Multiplicity Partitions By Doron Zeilberger (Written Jan. 18, 2012)
Another Hanukkah Miracle: The Gaps Between Consecutive Christmas-in-Hanukkah Years is ALWAYS a Fibonacci Number! By Shalosh B. Ekhad (Written Jan. 2, 2012)
Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type By Shalosh B. Ekhad and Doron Zeilberger (Written Dec. 28, 2011)
The [NameRemoved] Determinant Identity is Purely Routine By Doron Zeilberger (Written Dec. 23, 2011)
The Binomial Theorem for (N+n)^{r} (where Nf(n)=f(n+1)) By Moa Apagodu, Shalosh B. Ekhad, and Patrick Gaskill [Added Dec. 13, 2011: scooped by Koutschan et. al.'s paper]
A Tribute to Herb Wilf By Doron Zeilberger(Written Dec. 7, 2011, to be copublished in the W80 proceedings volume)
The Simplest Proof That Phi Is Irrational By Zehava Yachas (Written Nov. 21, 2011)
Amanda Folsom and Ken Ono's Error Could Have (and Should Have!) been Discovered by Their Computers (in Less than Three Seconds!) By Shalosh B. Ekhad (Posted Nov. 18, 2011).
A Maple One-Liner that is a MUCH Better ANSWER than George Andrews' ``Explicit'' Formula for the Rademacher Coefficients By Shalosh B. Ekhad (Written Oct. 23, 2011).
Alexander Burstein's Lovely Combinatorial Proof of John Noonan's Beautiful Formula that the number of n-permutations that contain the Pattern 321 Exactly Once Equals (3/n)(2n)!/((n-3)!(n+3)!) By Doron Zeilberger (Written Oct. 18, 2011).
Table of Natural Logarithms of All Integers from 1 to 50000 By Shalosh B. Ekhad (Generated Sept. 14, 2011).
The Expected Number of Blocks in an Ordered Set Partition of n objects is n/log(4)+O(1), its Variance is (n/log(4))(1/log(4)-1/2)+O(1), and It is Asymptotically Normal! (An Experimental-Mathematical Proof) By Shalosh B. Ekhad (Written June 28, 2011).
Two Proofs that Σ_{k} (-1)^{k} k!S(n,k)=(-1)^{n} By Doron Zeilberger (Written June 26, 2011).
In How Many Ways Can the Chess Pieces Walk n Steps, Staying on the Board? By Shalosh B. Ekhad (Generated May 19, 2011)
Automatic Generation of Generating Functions for Enumerating Matchings By Shalosh B. Ekhad and Doron Zeilberger (Written April 29, 2011)
The Number of Same-Sex Marriages in a Perfectly Bisexual Population is Asymptotically Normal By Shalosh B. Ekhad (Written April 28, 2011)
In How Many Ways Can a King Return Home After Walking n Steps? By Shalosh B. Ekhad (Written April 13, 2011)
The Sum of Two and Seven and The Product of Three by Three By Semaj Srelles (Written April 12, 2011)
Automatic Generation of Generating Functions for Counting the Number of Spanning Trees for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width By Shalosh B. Ekhad and Doron Zeilberger (Written April 2, 2011)
Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width By Shalosh B. Ekhad, Jocelyn Quaintance, and Doron Zeilberger (Written March 30, 2011)
A Note on an American Mathematical Monthly Note By Doron Zeilberger (Written Feb. 11, 2011)
The Sagan-Savage Lucas-Catalan Polynomials Have Positive Coefficients By Shalosh B. Ekhad (Written Jan. 17, 2011)
The Maximal number of floors a Building can have ... By Shalosh B. Ekhad (Written Nov. 7, 2010)
A Case Study in Experimental (Yet Fully Rigorous!) Mathematics (Videotaped Lecture) By Doron Zeilberger (delivered Nov. 4, 2010, posted Nov. 6, 2010).
Play Time With Determinants By Tewodros Amdeberhan and Shalosh B. Ekhad (with an appendix by Christoph Koutschan and his computer) (Written Oct. 31, 2010)
Leon Ehrenpreis (1930-2010) A truly FUNDAMENTAL Mathematician (a Videotaped lecture) By Doron Zeilberger (posted Sept. 22, 2010, delivered Sept. 16, 2010).
Why Is it So Hard to Count? (Videotaped Lecture) By Doron Zeilberger (posted Sept. 2, 2010, delivered Aug. 14, 2010).
HISTABRUT: A Maple Package for Symbol-Crunching in Probability theory By Doron Zeilberger (Published: Aug. 25, 2010).
Refined Asymptotics and Explicit Recurrences for the numbers of Young tableaux in the (k,l) hook for k+l ≤ 5 By Shalosh B. Ekhad and Amitai Regev (Published: July 28, 2010).
3x+1 (Videtape of the 2010 Erdos Memorial Lecture) By Doron Zeilberger (posted May 21, 2010, produced by Mike McKenna and Marc Heft). ( reanactment (producted by Edinah Gnang))
Bijections for an identity of Young Tableaux By Amitai Regev and Doron Zeilberger . (Written: Feb. 22, 2010. Published: May 2, 2010).
Statistical Analysis of the Erdos, Zeilberger, and Shelah Numbers in the Audience in Doron Zeilberger's Erdos Memorial Lecture By Shalosh B. Ekhad and the students of RU-Math640(Sp2010) (published April 10, 2010).
The Number of Inversions and the Major Index of Permutations are Asymptotically Joint-Independently Normal (Second Edition!) By Andrew Baxter and Doron Zeilberger (First edition written April 7, 2010. Second (fully refereed!) edition published Feb. 4, 2011).
Experimental Mathematics: Alias, the Future of Mathematics (Videotaped Lecture) By Doron Zeilberger (posted March 23, 2010, produced by Edinah Gnang).
binomial(5,2) Proofs that binomial(n,k) ≤ binomial(n,k+1) if k < n/2 By Doron Zeilberger (published March 4, 2010).
A Note on the Stanley Distribution By Shalosh B. Ekhad (published Jan. 20, 2010).
A Eulogy for Jack Good By Doron Zeilberger (published Dec. 2, 2009).
You Don't Have To Be an Einstein to Figure Out that Sara Should (Asymptotically) Eat n/3+4/27+O(1/n) Dove Bars ... By Shalosh B. Ekhad (published Nov. 11, 2009).
A Multi-Set Identity for Partitions By Amitai Regev and Doron Zeilberger (posted here Sept. 22, 2009).
In How Many Ways Can You Reassemble Several Russian Dolls? By Doron Zeilberger (published Sept. 16, 2009).
A Computer-Generated Proof that P=NP By Doron Zeilberger (published April 1(!), 2009).
An Inelegant (but Short(!)) Proof of a Major Index Theorem of Garsia and Gessel By Doron Zeilberger (published March 29, 2009).
The Number of Walks on a Regular Cayley Tree By Eric Rowland and Doron Zeilberger (published March 12, 2009).
A Proof of George Andrews' and Dave Robbins' q-TSPP Conjecture (modulo a finite amount of routine calculations) By Manuel Kauers, Christoph Koutschan, and Doron Zeilberger (Written Aug. 2, 2008; Published: Jan. 25, 2009)