ELEMENTARY PROOFS OF VARIOUS FACTS ABOUT 3-CORES
- 17 April 2009
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 79 (3) , 507-512
Abstract
Using elementary means, we derive an explicit formula for a3(n), the number of 3-core partitions of n, in terms of the prime factorization of 3n+1. Based on this result, we are able to prove several infinite families of arithmetic results involving a3(n), one of which specializes to the recent result of Baruah and Berndt which states that, for all n≥0, a3(4n+1)=a3(n).Keywords
This publication has 7 references indexed in Scilit:
- A Letter from Fitzroy HouseThe American Mathematical Monthly, 2008
- Partition identities and Ramanujan's modular equationsJournal of Combinatorial Theory, Series A, 2007
- Defect zero blocks for finite simple groupsTransactions of the American Mathematical Society, 1996
- Some cubic modular identities of RamanujanTransactions of the American Mathematical Society, 1994
- Some Cubic Modular Identities of RamanujanTransactions of the American Mathematical Society, 1994
- Cubic Analogues of the Jacobian Theta Function θ(z, q)Canadian Journal of Mathematics, 1993
- A Cubic Counterpart of Jacobi's Identity and the AGMTransactions of the American Mathematical Society, 1991