Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Periodicity of the parity of a partition function related to making change


Authors: Patrick Costello and Michael Osborne
Journal: Math. Comp. 77 (2008), 1749-1754
MSC (2000): Primary 11P83
DOI: https://doi.org/10.1090/S0025-5718-08-02095-4
Published electronically: February 13, 2008
MathSciNet review: 2398792
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The solutions to a change problem form restricted partitions. For one particular change problem, we look at the sequence representing the parity of these restricted partition values. It appears that the period of this sequence has not been studied. Through recurrences involving binomial coefficients, we find that the sequence has a period of $ 200$.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11P83

Retrieve articles in all journals with MSC (2000): 11P83


Additional Information

Patrick Costello
Affiliation: Department of Mathematics and Statistics, Eastern Kentucky University, Richmond, Kentucky 40475-3102
Email: pat.costello@eku.edu

Michael Osborne
Affiliation: Department of Mathematics and Statistics, Eastern Kentucky University, Richmond, Kentucky 40475-3102

DOI: https://doi.org/10.1090/S0025-5718-08-02095-4
Keywords: Partitions, parity
Received by editor(s): August 2, 2007
Received by editor(s) in revised form: August 22, 2007
Published electronically: February 13, 2008
Article copyright: © Copyright 2008 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.