8 citations · 19 across the 32 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013★ 3 cited
Generalizing and Implementing Michael Hirschhorn's Amazing Algorithm for Proving Ramanujan-Type Congruences
Edinah Gnang, Doron Zeilberger
When Mike Hirschhorn showed us his lovely gem, that gives the simplest-to-date proof of Ramanujan's famous result that p(11n+6) is divisible by 11, we realized that his amazing met…
math.CO2013
Some integer formula-encodings and related algorithms
Edinah K. Gnang, Patrick Devlin
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are…
math.CO2013
Zeroless Arithmetic: Representing Integers ONLY using ONE
Edinah K. Gnang, Doron Zeilberger
We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using a…