Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-14T08:07:58.532Z Has data issue: false hasContentIssue false

The arithmetic of partitions into distinct parts

Published online by Cambridge University Press:  26 February 2010

Scott Ahlgren
Affiliation:
Department of Mathematics, Colgate University, Hamilton, NY 13346, U.S.A. Current address: Department of Mathematics, University of Illinois, Urbana, IL 61801, U.S.A. E-mail: ahlgren@math.uiuc.edu
Jeremy Lovejoy
Affiliation:
Department of Mathematics, University of Wisconsin, Madison, WI 53706, U.S.A. E-mail: lovejoy@math.wisc.edu
Get access

Extract

A partition of the positive integer n into distinct parts is a decreasing sequence of positive integers whose sum is n, and the number of such partitions is denoted by Q(n). If we adopt the convention that Q(0) = 1, then we have the generating function

Information

Type
Research Article
Copyright
Copyright © University College London 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable