Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-27T15:44:51.621Z Has data issue: false hasContentIssue false
  • English
  • Français

Partitions and the dancing bear

Published online by Cambridge University Press:  01 August 2016

Nick Mackinnon
Nick Mackinnon*
Affiliation:
Winchester College
Get access Rights & Permissions [Opens in a new window]

Extract

A partition of n is a decomposition of n into a sum of positive integers. So the 5 partitions of 4 are

The number of partitions of n is written p(n) and (with the convection that p(0) = 1) the sequence p(0), p(1), p(2), ... begins

1, 1, 2, 3, 5, 7, 11, 15,....

Type
Research Article
Information
The Mathematical Gazette , Volume 74 , Issue 468 , June 1990 , pp. 127 - 129
Copyright
Copyright © The Mathematical Association 1990

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.)