---
title: "Restricted Partition | Combinatorics"
description: "Restricted partition in Combinatorics means a partition with rules on allowed parts, like distinct parts or size limits, often counted with generating functions."
canonical: "https://fiveable.me/combinatorics/key-terms/restricted-partition"
type: "key-term"
subject: "Combinatorics"
unit: "Unit 8"
---

# Restricted Partition | Combinatorics

## Definition

A restricted partition is an integer partition in Combinatorics that has extra rules on the parts, such as distinct parts, odd parts, or a maximum part size. It is a partition problem with constraints.

## What It Is

A restricted partition in combinatorics is a partition of an integer with added rules on what the parts can be. You still write a number as a sum of positive integers, but now the partition has to satisfy a condition such as “all parts are distinct,” “all parts are odd,” or “no part is bigger than k.”

That restriction changes the counting problem. For example, the partitions of 6 with distinct parts are different from the partitions of 6 with no size limit, because repeats like 3 + 2 + 1 are allowed but 2 + 2 + 2 is not. If the rule says parts must be odd, then 4 + 1 + 1 is out, even though it is a valid ordinary partition. The main idea is that you are counting only the partitions that survive the rule.

A useful way to think about restricted partitions is that the restriction becomes part of the structure, not just an extra detail. In a regular partition, order does not matter, so 4 + 1 and 1 + 4 are the same partition. In a restricted partition, you still ignore order, but you also check the constraint before counting. That is why these problems often show up as “count the partitions of n using only certain allowed pieces.”

This topic connects directly to generating functions. For unrestricted partitions, the partition function uses an infinite product. For restricted partitions, you modify that product to match the rule. For instance, if each part size can be used at most once, the factor for that size looks different from the factor for unlimited repetition. If parts must be odd, the generating function only includes odd exponents. So the restriction is visible in the algebra, not just in the counting list.

A compact example is the number 5. The ordinary partitions of 5 are 5, 4 + 1, 3 + 2, 3 + 1 + 1, 2 + 2 + 1, and 1 + 1 + 1 + 1 + 1. If you restrict to distinct parts, you keep 5, 4 + 1, and 3 + 2. If you restrict to odd parts, you keep 5, 3 + 1 + 1, and 1 + 1 + 1 + 1 + 1. Same integer, different counting rules, different answer.

The common mistake is to forget that a restricted partition still ignores order. Another one is to apply the restriction after counting instead of building it into the setup. In combinatorics, the whole point is to describe the allowed objects first, then count only those objects.

## Why It Matters

Restricted partitions are one of the cleanest places where combinatorics turns a counting problem into a rule-based structure. They show how a simple idea, splitting an integer into sums, becomes much richer once you add constraints. That is exactly the kind of thinking used across integer partitions, generating functions, and identities.

In this topic, restricted partitions also give you a bridge between a list of examples and a symbolic formula. If a problem says parts are distinct, odd, or bounded above by k, you can translate that rule into a counting setup instead of trying to list every partition by hand. That skill matters because many partition problems are impossible to brute-force once the number gets larger.

Restricted partitions also help explain why different-looking counting problems can turn out to have the same answer. For example, partitions into odd parts and partitions into distinct parts are linked by Euler’s partition identity. Even if you do not prove the identity yet, restricted partitions give you the language for seeing why those two families are worth comparing.

They also show up as a stepping stone to deeper tools in combinatorics, especially generating functions and q-series. Once you understand how the restriction changes the allowed parts, the algebraic form of the counting function starts to make sense instead of looking arbitrary.

## Connections

### Integer partition

A restricted partition is still an integer partition, just with extra rules. If you can list ordinary partitions of a number, the next step is checking which of those partitions satisfy the restriction. This makes the unrestricted idea the base case and the restricted version the filtered case.

### Partition function

The partition function counts all partitions of n, while a restricted partition count only measures the partitions that meet a condition. That means restricted partitions often lead to new counting functions that look like modified versions of p(n). They are a natural extension of the same counting idea.

### Generating functions

Restricted partitions are often counted with generating functions because the restriction changes the factors in the product. Distinct parts, odd parts, and size limits each create a different series setup. If you know how to build the generating function, you can turn the counting rule into algebra.

### [Euler's Partition Function Identity](/combinatorics/key-terms/eulers-partition-function-identity)

This identity is one of the most famous results involving restricted partitions. It compares partitions into odd parts with partitions into distinct parts, showing that two very different restrictions can produce the same count. That makes it a perfect example of why restriction-based counting is interesting.

## On the AP Exam

A problem set or quiz question will usually ask you to count partitions under a rule, list the valid partitions of a small n, or build the generating function that matches the restriction. Your job is to read the condition carefully, then include only the allowed parts and exclude everything else. For example, if the prompt says “distinct parts,” you cannot repeat a number, and if it says “parts at most 4,” every summand has to be 4 or smaller.

On longer problems, you may need to compare two restricted families or explain why a product formula changes when the rule changes. A common test move is to use a small example first, then generalize the pattern into a generating function or recurrence. If you can explain how the restriction changes the count, you are doing the right kind of combinatorics reasoning.

## restricted partition vs Integer partition

An integer partition is any way to write a number as a sum of positive integers, with order ignored. A restricted partition is a partition that also follows an extra rule, like distinct parts or odd parts only. So every restricted partition is an integer partition, but not every integer partition is restricted.

## Key Takeaways

- A restricted partition is an integer partition with an extra rule on the parts.
- The restriction might require distinct parts, odd parts, even parts, or a maximum part size.
- Order still does not matter, so 4 + 1 and 1 + 4 are the same partition.
- Restricted partitions are often counted with generating functions that match the rule.
- These problems are a gateway to identities like Euler’s partition identity and to more advanced counting methods.

## FAQs

### What is restricted partition in Combinatorics?

A restricted partition is a partition of an integer that must follow a specific rule. The rule might limit the size of the parts, require distinct parts, or allow only odd or even parts. You are still splitting an integer into a sum of positive integers, but not every partition counts.

### How is a restricted partition different from a regular partition?

A regular partition includes every way to write the number as a sum of positive integers, ignoring order. A restricted partition adds a condition, so you count only the partitions that fit that condition. That extra filter is what changes the answer.

### Can you give an example of a restricted partition?

Yes. For 5, the partition 3 + 2 is a restricted partition if the rule is “distinct parts,” but 2 + 2 + 1 is not. If the rule is “odd parts only,” then 3 + 1 + 1 works, while 4 + 1 does not because 4 is even.

### How do restricted partitions show up in problems?

You usually see them in counting questions, generating functions, or proofs about partition identities. A common task is to list all valid partitions of a small integer under a rule or to write the generating function that matches the restriction. The rule is the whole setup, so reading it carefully matters.

## Related Study Guides

- [8.1 Integer partitions and partition functions](/combinatorics/unit-8/integer-partitions-partition-functions/study-guide/7bOCCKMIxT4Jm4K0)

## About This Document

Canonical Fiveable pages are available as Markdown at the same path plus `.md`.

- [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns
- [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing
- [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`)
- [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`)

## Structured Data

```json
{"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/combinatorics/key-terms/restricted-partition#resource","name":"Restricted Partition | Combinatorics","url":"https://fiveable.me/combinatorics/key-terms/restricted-partition","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/combinatorics/key-terms/restricted-partition#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:21:06.613Z","isPartOf":{"@type":"Collection","name":"Combinatorics Key Terms","url":"https://fiveable.me/combinatorics/key-terms"},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/combinatorics/key-terms/restricted-partition#term","name":"restricted partition","description":"A restricted partition is an integer partition in Combinatorics that has extra rules on the parts, such as distinct parts, odd parts, or a maximum part size. It is a partition problem with constraints.","url":"https://fiveable.me/combinatorics/key-terms/restricted-partition","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Combinatorics Key Terms","url":"https://fiveable.me/combinatorics/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is restricted partition in Combinatorics?","acceptedAnswer":{"@type":"Answer","text":"A restricted partition is a partition of an integer that must follow a specific rule. The rule might limit the size of the parts, require distinct parts, or allow only odd or even parts. You are still splitting an integer into a sum of positive integers, but not every partition counts."}},{"@type":"Question","name":"How is a restricted partition different from a regular partition?","acceptedAnswer":{"@type":"Answer","text":"A regular partition includes every way to write the number as a sum of positive integers, ignoring order. A restricted partition adds a condition, so you count only the partitions that fit that condition. That extra filter is what changes the answer."}},{"@type":"Question","name":"Can you give an example of a restricted partition?","acceptedAnswer":{"@type":"Answer","text":"Yes. For 5, the partition 3 + 2 is a restricted partition if the rule is “distinct parts,” but 2 + 2 + 1 is not. If the rule is “odd parts only,” then 3 + 1 + 1 works, while 4 + 1 does not because 4 is even."}},{"@type":"Question","name":"How do restricted partitions show up in problems?","acceptedAnswer":{"@type":"Answer","text":"You usually see them in counting questions, generating functions, or proofs about partition identities. A common task is to list all valid partitions of a small integer under a rule or to write the generating function that matches the restriction. The rule is the whole setup, so reading it carefully matters."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Combinatorics","item":"https://fiveable.me/combinatorics"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/combinatorics/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 8","item":"https://fiveable.me/combinatorics/unit-8"},{"@type":"ListItem","position":4,"name":"restricted partition"}]}]}
```