Arthur T. Benjamin

From MaRDI portal
Person:200897

Available identifiers

zbMath Open benjamin.arthur-tWikidataQ2865351 ScholiaQ2865351MaRDI QIDQ200897

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q58892702023-04-19Paper
https://portal.mardi4nfdi.de/entity/Q50570722022-12-14Paper
A Proof of the Optimal Leapfrogging Conjecture2021-10-15Paper
Counting on Euler and Bernoulli Number Identities2021-02-19Paper
https://portal.mardi4nfdi.de/entity/Q51179902020-08-26Paper
The Long and the Short of Benford’s Law2020-05-04Paper
https://portal.mardi4nfdi.de/entity/Q52305662019-08-28Paper
https://portal.mardi4nfdi.de/entity/Q45567542018-11-28Paper
The BINGO Paradox2018-10-29Paper
Challenging Knight’s Tours2018-10-29Paper
https://portal.mardi4nfdi.de/entity/Q46896722018-10-17Paper
Factoring Numbers with Conway’s 150 Method2018-08-20Paper
https://portal.mardi4nfdi.de/entity/Q29531932017-01-04Paper
https://portal.mardi4nfdi.de/entity/Q34572682015-12-14Paper
Challenging Magic Squares for Magicians2015-10-19Paper
https://portal.mardi4nfdi.de/entity/Q54971142015-02-03Paper
Counting on \(r\)-Fibonacci numbers2014-08-08Paper
Squaring, Cubing, and Cube Rooting2012-07-18Paper
When does \(F^L_m\) divide \(F_n\)? A combinatorial solution2012-05-10Paper
Recounting the sums of cubes of Fibonacci numbers2012-05-10Paper
https://portal.mardi4nfdi.de/entity/Q31053672012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31053852012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31034012011-12-07Paper
https://portal.mardi4nfdi.de/entity/Q30954222011-11-01Paper
The combinatorialization of linear recurrences2011-06-24Paper
A (Not so) Complex Solution to a<sup>2</sup> + b<sup>2</sup> = c<sup>n</sup>2011-05-19Paper
https://portal.mardi4nfdi.de/entity/Q30004722011-05-18Paper
An amazing mathematical card trick2011-04-13Paper
https://portal.mardi4nfdi.de/entity/Q30690072011-01-21Paper
https://portal.mardi4nfdi.de/entity/Q35818382010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35818202010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35818532010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35740772010-07-09Paper
Combinatorial trigonometry with Chebyshev polynomials2010-05-21Paper
Combinatorially composing Chebyshev polynomials2010-05-21Paper
https://portal.mardi4nfdi.de/entity/Q35500832010-03-30Paper
The Probability of Relatively Prime Polynomials2009-07-06Paper
Tiling proofs of recent sum identities involving Pell numbers2009-06-08Paper
https://portal.mardi4nfdi.de/entity/Q36200702009-04-14Paper
The 99th Fibonacci identity2009-04-07Paper
A Combinatorial Proof of Vandermonde's Determinant2009-04-03Paper
An Alternate Approach to Alternating Sums: A Method to DIE for2009-02-11Paper
https://portal.mardi4nfdi.de/entity/Q54453702008-03-04Paper
https://portal.mardi4nfdi.de/entity/Q54404372008-02-05Paper
Counting on Determinants2007-07-30Paper
https://portal.mardi4nfdi.de/entity/Q52949192007-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54773782006-07-03Paper
https://portal.mardi4nfdi.de/entity/Q33774962006-03-23Paper
Recounting the Odds of an Even Derangement2006-02-06Paper
Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems2005-11-08Paper
A Stirling Encounter with Harmonic Numbers2005-04-22Paper
https://portal.mardi4nfdi.de/entity/Q46574532005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q46574542005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q48314632005-01-03Paper
https://portal.mardi4nfdi.de/entity/Q44725662004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44439232004-03-16Paper
The Fibonacci Numbers: Exposed More Discretely2003-12-09Paper
https://portal.mardi4nfdi.de/entity/Q44248742003-09-07Paper
Analysis of the \(N\)-card version of the game Le Her2003-03-10Paper
Recounting Fibonacci and Lucas Identities2002-10-17Paper
https://portal.mardi4nfdi.de/entity/Q45521842002-08-29Paper
Composite fermions and integer partitions2002-06-03Paper
Random Approaches to Fibonacci Identities2001-11-26Paper
Magic "Squares" Indeed!2001-11-26Paper
What's Best?2001-11-26Paper
Optimal token allocation in solitaire knock'm down2001-10-16Paper
https://portal.mardi4nfdi.de/entity/Q44948962000-08-09Paper
https://portal.mardi4nfdi.de/entity/Q49378122000-07-19Paper
Strong chromatic index of subset graphs1998-01-28Paper
Determinants of the Tournaments1996-07-31Paper
How do I marry thee? Let me count the ways1995-07-03Paper
Sensible Rules for Remembering Duals—the S-O-B Method1995-06-13Paper
Localization of optimal strategies in certain games1994-09-19Paper
Optimal Leapfrogging1993-10-25Paper
Another Way of Counting $N^N $1993-01-16Paper
Graphs, Maneuvers and Turnpikes1990-01-01Paper
The Bisection Method: Which Root?1987-01-01Paper

Research outcomes over time

This page was built for person: Arthur T. Benjamin