3.2 		Combinatorics

Factoring Functions, J. C. Bodenrader, 2:1, 1971, 23-26, 0.6, 5.1.2, 9.1
Pascal's Triangle, Karl J. Smith, 4:1, 1973, 1-13, 0.6, 9.2
Checkerboards and Sugar Cubes: Geometric Counting Patterns, David R. Duncan and Bonnie H. Litwiller, 4:2, 1973, 41-47
A Study of the Coefficients J[n, i], David L. Jones, 5:4, 1974, 12-15
A Computer Solution to "Instant Insanity", Larry Collister, 6:2, 1975, 36-41
Stories in Combinatorial Geometry, Ross Honsberger, 10:5, 1979, 344-347, 0.5
A Combinatorial Proof of Euler's Formula, Iain T. Adamson, 11:4, 1980, 272-273, C, 9.3
An Application from Combinatorics to Dice-Sum Frequencies, David L. Pugh, 11:5, 1980, 331-333, C, 7.1
An Alternative Proof to Dirac's Theorem, Penelope Barlow, 12:1, 1981, 57-58, C
On Dice-Sum Frequencies, V. N. Murty, 12:3, 1981, 209-211, C, 7.2
Point-and-Line Proof for the Sum of Cubes, Barbara Turner, 12:4, 1981, 270-271, C
Paths and Pascal Numbers, John F. Lucas, 14:4, 1983, 329-341, 9.2
A Sequel to "Another Way of Looking at n!", William Moser, 15:2, 1984, 142-143, C, 5.2.7, 5.7.2
Pascal's Triangle, Difference Tables and Arithmetic Sequences of Order N, Calvin Long, 15:4, 1984, 290-298, 5.4.1, 6.3, 9.2
On the Probability that the Better Team Wins the World Series, James L. Kepner, 16:4, 1985, 250-256, 7.2
A Discrete Look at 1 + 2 + ... + n, Loren C. Larson, 16:5, 1985, 369-382, 0.2, 0.9, 5.4.2, 3.1, 6.3
Trees and Tennis Rankings, Curtis Cooper, 17:1, 1986, 76-78, C, 3.1
The Pascal Polytope: An Extension of Pascal's Triangle to N Dimensions, John F. Putz, 17:2, 1986, 144-155, 5.4.1, 6.3, 9.2
Combinatorics by Coin Flipping, Joel Spencer, 17:5, 1986, 407-412, 3.1, 7.2
A Division Game: How Far Can You Stretch Mathematical Induction?, William H. Ruckle, 18:3, 1987, 212-218, 0.9, 9.9
Pascal Triangles and Combinations Where Repetitions Are Allowed, Kendell Hyde, 19:1, 1988, 60-62, C, 9.2
Rencontres Reencountered, Karl David, 19:2, 1988, 138-148, 9.4
How Many Bridge Actions?, Douglas S. Jungreis and Erich Friedman, 19:2, 1988, 171-172, C, 7.1
Ties at Rotation, Howard Lewis Penn, 19:3, 1988, 230-239, 9.10
Musical Notes, Angela B. Shiflet, 19:4, 1988, 345-347, C, 7.2, 9.2
A Chessboard Coloring Problem, May Beresin and Eugene Levine and John Winn, 20:2, 1989, 106-114
On-Line Partitioning of Partially Ordered Sets, William T. Trotter, 20:2, 1989, 124-131
It's Magic! Multiplication Theorems for Magic Squares, Daniel Widdis and R. Bruce Richter, 20:4, 1989, 301-306, 9.2, 9.3
The Eternal TriangleÑa History of a Counting Problem, Mogens Esrom Larsen, 20:5, 1989, 370-384, 6.3
Herbert and the Hungarian Mathematician: Avoiding Certain Subsequence Sums, Dean S. Clark and James T. Lewis, 21:2, 1990, 100-104
Using Euler's Formula to Solve Plane Separation Problems, Thomas L. Moore, 22:2, 1991, 125-130, 3.1
Counting It Twice, Doris Schattschneider, 22:3, 1991, 203-211
Clapping MusicÑA Combinatorial Problem, Joel K. Haack, 22:3, 1991, 224-227, C
FFF #46. A Straightforward Cancellation, Ed Barbeau, 22:5, 1991, 403-404, F, 0.2
Rubberbanding and Holding Out, James C. Kirby, 23:2, 1992, 148-149, C
Square-Free Sets on Square Grids: Student Research Project, Stephen L. Davis, 23:3, 1992, 214-224
Software Review: EDUCOM Higher Education Software Awards for 1991: Combinatorica@, Bruce E. Sagan, 23:4, 1992, 334-339, 3.4
Some Applications of Elementary Linear Algebra in Combinatorics, Richard A. Brualdi and Jennifer J. Q. Massey, 24:1, 1993, 10-19, 4.7
Permutation Puzzles: Student Research Project, John H. Wilson, 24:2, 1993, 163-165, 9.2
The Doors: Student Research Project, L. R. King and Benjamin G. Klein and Irl C. Bivens, 24:3, 1993, 245-246
Remarks Concerning "Square-Free Sets on Square Grids": Student Research Project, H. L. Abbott, 24:4, 1993, 353-355
Lottery Drawings Often Have Consecutive Numbers, David M. Berman, 25:1, 1994, 45-47, C
Investigation of a Recurrence Relation: Student Research Project, Dmitri Thoro and Linda Valdes, 25:4, 1994, 322-324, 6.3, 9.3
Eulerian Polynomials and Faulhaber's Result on Sums of Powers of Integers, H. K. Krishnapriyan, 26:2, 1995, 118-123
Pizza Combinatorics, Griffin Weber and Glenn Weber, 26:2, 1995, 141-143, C
Sums of Selected Binomial Coefficients, David R. Guichard, 26:3, 1995, 209-213
A Combinatorial Queueing Model, Shahar Boneh and David C. Ogden, 26:5, 1995, 346-357, 3.1
Pascal's Triangle Gets Its Genes from Stirling Numbers of the First Kind, Tommy Wright, 26:5, 1995, 368-371
A Master Key for Ten Locks, Stephen R. Cavior, 27:1, 1996, 33-36
Generalizations of a Mathematical Olympiad Problem, Joe Klerlein and Scott Sportsman, 27:4, 1996, 296-297, 9.3
Multiple Derivatives of Compositions: Investigating Some Special Cases, Irl C. Bivens, 28:4, 1997, 299-300, 5.7.1
FFF #127. Arranging a Collection of Objects, Montie Monzingo, 29:2, 1998, 134, F
Nothing Counts for Something, Norton Starr, 29:4, 1998, 308-309, C
The Trinomial Triangle, James Chappell and Thomas Osler, 30:2, 1999, 141-142, C, 0.2
Relating Geometry and Algebra in the Pascal Triangle, Hexagon, Tetrahedron, and Cuboctahedron I, Peter Hilton and Jean Pedersen, 30:3, 1999, 170-186
FFF #144.  Spoiled for Choice, Norton Starr, 30:3, 1999, 210, F, 0.1
Relating Geometry and Algebra in the Pascal Triangle, Hexagon, and Cuboctahedron II,  Peter Hilton and Jean Pedersen, 30:4, 1999, 279-292, 9.7
Minimizing Aroma Loss, Robert Barrington Leigh and Richard Travis Ng, 30:5, 1999, 356-358, 9.10
Recounting Fibonacci and Lucas Identities, Arthur T. Benjamin and Jennifer J. Quinn, 30:5, 1999, 359-366
A Rational Solution to Cootie, Arthur Benjamin and Matthew Fluet, 31:2, 2000, 124-125, C, 7.2
More on Cootie, Michael Hirschhorn, 31:2, 2000, 126-128, C, 7.2
Some New Results on Magic Hexagrams, Martin Gardner, 31:4, 2000, 274-280, 9.2
The Pascal Pyramid, Hans Walser, 31:5, 2000, 383-392, 0.3
The Sum of min(i,j) Equals the Sum of the First k Integers Squared (Mathematics Without Words), Abraham Arcavi and Alfinio Flores, 31:5, 2000, 392, C
Against the Odds, Martin Gardner, 32:1, 2001, 39-43, 2.2
Slicing Space, Seth Zimmerman, 32:2, 2001, 126-128, C
Linear Relations Between Powers of Terms in Arithmetic Progression, Calvin Long and Boyd Henry, 32:2, 2001, 135-137, C, 0.2
The Interior Diagonals of a Polygon, Margaux Marie Siegel, 32:3, 2001, 239-240, C
Generating Functions and the Electoral College, Christopher Stuart, 32:5, 2001, 380, C
A Sum Equaling n cubed (Mathematics Without Words), Roger Nelsen, 33:2, 2002, 171, C
Sums of Uniformly Distributed Variables: A Combinatorial Approach, Jeanne Albert, 33:3, 2002, 201-206, 7.2
Introducing Binary and Ternary Codes via Weighings, James Tanton, 33:4, 2002, 313-314, C, 0.1
Two Quick Combinatorial Proofs of the Sum of the First n Cubes, Arthur T. Benjamin and Michael E. Orrison, 33:5, 2002, 406-408, C
A Codeword Proof of the Binomial Theorem, Mark Ramras, 34:2, 2003, 144, C
Taking the Sting out of Wasp Nests: A Dialogue on Modeling in Mathematical Biology, Jennifer C. Klein and Thomas Q. Sibley, 34:3, 2003, 207-215, 9.10
Dice Distributions Using Combinatorics, Recursion, and Generating Functions, Janet M. McShane and Michael I. Ratliff, 34:5, 2003, 370-376, 7.2
The Old Hats Problem Revisited, Heba Hathout, 35:2, 2004, 97-102
Tiling with Dominoes, Nathan S. Mendelsohn, 35:2, 2004, 115-120, 3.1
Combinatorial Proofs via Flagpole Arrangements, Duane DeTemple, 35:2, 2004, 129-133, C
How Do You Stack Up?, John P. Bonomo and Carolyn K. Cuff, 35:5, 2004, 351-361
The Probability that an Amazing Card Trick Is Dull, Christopher Swanson, 36:3, 2005, 209-212, 7.2
Graeco-Latin Squares and a Mistaken Conjecture of Euler, Dominic Klyve and Lee Stemkoski, 37:1, 2006, 2-15, 9.2, 9.4
FFF #243. Funky Yahtzee, Dale R. Buske, 37:1, 2006, 39-40, F
FFF #244. Combination lock, Ed Barbeau, 37:1, 2006, 40, F
Pizza Combinatorics Revisited, Griffin Weber and Glen Weber, 37:1, 2006, 43-44, C
Parity and Primality of Catalan Numbers, Thomas Koshy and Mohammad Salmassi, 37:1, 2006, 52-53, C, 9.3
Streaks and Generalized Fibonacci Sequences, Shahla Ahdout, Sheldon Rothman, and Helen Strassberg, 37:3, 2006, 221-223, C
Names in Boxes Puzzle, Peter Winkler, 37:4, 2006, 260, 285, 289, C, 9.4
More Combinatorial Proofs via Flagpole Arrangements, Duane DeTemple and H. David Reynolds II, 37:4, 2006, 279-285
Fibonacci Identities via the Determinant Sum Property, Michael Z. Spivey, 37:4, 2006, 286-289, 4.2, 9.3
Exhaustive sampling and related binomial identities, Jim Ridenhour and David Grimmett, 37:4, 2006, 296-299, C, 7.2
Summing Cubes by Counting Rectangles, Arthur T. Benjamin, Jennifer J. Quinn and Calyssa Wurtz, 37:5, 2006, 387-389, C
Not Just Hats Anymore: Binomial Inversion and the Problem of Multiple Coincidences, Leith Hathout, 38:3, 2007, 179-184, 7.2
Some Half-Row Sums from PascalÕs Triangle via Laplace Transforms, Thomas P. Dence, 38:3, 2007, 205-209, 6.4
Proof Without Words: A Graph Theoretic Summation of the First n Integers, Joe DeMaio and Joey Tyson, 38:4, 2007, C, 3.1

Finding All Solutions to the Magic Hexagram, Alexander Karabegov and Jason Holland, 39:2, 2008, 102-106, 9.2
An Alternate Approach to Alternating Sums: A Method to DIE for, Arthur T. Benjamin and Jennifer J. Quinn, 39:3, 2008, 191-201
Dinner Tables and Concentric Circles: A Harmony of Mathematics, Music, and Physics, Jack Douthett and Richard J. Krantz, 39:3, 2008, 203-211, 9.1, 9.10
FFF #286. Lines of cubes in a block, Ed Barbeau, 39:5, 2008, 383, F, 9.2