Odd partition

An odd partition is a way to write a positive integer as a sum of odd integers, where order does not matter. In combinatorics, it is studied alongside integer partitions, generating functions, and partition identities.

What is odd partition?

An odd partition in Combinatorics is a partition of a positive integer using only odd summands. So 7 can be written as 7, 5 + 1 + 1, 3 + 3 + 1, or 3 + 1 + 1 + 1 + 1, and each of those is an odd partition because every part is odd and order does not count.

The phrase “order does not count” is doing a lot of work here. Just like with regular integer partitions, 3 + 1 + 1 and 1 + 3 + 1 are the same partition. What matters is the multiset of parts, not the sequence you write them in.

Odd partitions show up when a course starts comparing restricted partitions to unrestricted partitions. An unrestricted partition lets you use any positive integers as parts. An odd partition adds a restriction: every part must be odd. That makes the counting problem more structured, and it sets up generating function methods very naturally.

The generating function for odd partitions is built from the odd numbers only: (1 + x + x^2 + x^3 + ...) for 1, then the same pattern for 3, 5, 7, and so on. Multiplying those factors gives a power series where the coefficient of x^n counts odd partitions of n. In compact form, that becomes 1 / ((1 - x)(1 - x^3)(1 - x^5) ...).

One especially useful fact in combinatorics is that odd partitions are equinumerous with partitions into distinct parts. That means there is a counting match between two different kinds of restrictions, even though the partitions themselves look very different. If your class gets into Euler’s partition identity, this is one of the cleanest places where the idea appears.

A common mistake is to think “odd partition” means the number being partitioned has to be odd. That is not true. Any positive integer can have odd partitions, including even numbers like 4, 6, or 10. The restriction is on the parts, not on the total.

Why odd partition matters in COMBINATORICS

Odd partitions matter because they are one of the cleanest examples of how combinatorics turns a counting problem into a structure problem. Instead of asking only “how many ways can you add to n,” you ask what rules the parts must follow and how those rules change the count.

This term also sits right next to the main tools of the topic 8.1 unit: partition functions and generating functions. If you can recognize an odd partition, you are better prepared to read a coefficient from a product, translate a restriction into a power series, or compare two partition families that look unrelated at first glance.

Odd partitions are especially useful when you start studying identities. The fact that odd partitions match partitions into distinct parts is not just a neat fact to memorize. It is a signal that combinatorics often has hidden bijections, where two counting problems are actually the same after a clever reorganization of the parts.

In problem sets, this term often appears in three ways: listing partitions for small n, building the right generating function, or using a known identity to count without enumerating everything by hand. That makes it a good checkpoint concept for the whole partition chapter.

How odd partition connects across the course

Partition Function

The partition function counts all partitions of n without restrictions, while odd partitions count only the ones made from odd parts. Comparing the two helps you see how adding a rule changes a counting problem. In this unit, odd partitions are often a restricted version of the larger partition function idea.

Euler's Partition Function Identity

Euler’s identity connects odd partitions to partitions into distinct parts. This is the big theorem-like relationship behind the topic, and it shows that two very different descriptions can produce the same counts. If you see a question asking for a bijection or a counting match, this connection is probably what it is aiming at.

restricted partition

An odd partition is a specific type of restricted partition, because it limits which parts are allowed. That makes it a useful example when you are learning how restrictions change partition counts and generating functions. Many problems in this area ask you to identify the restriction first, then build the correct counting model.

Pentagonal Number Theorem

The Pentagonal Number Theorem appears when partition theory gets more algebraic and recursive. It is not the definition of odd partitions, but it belongs in the same family of ideas because it helps generate identities and recurrences for partition functions. If your class moves beyond listing partitions, this theorem often enters the picture.

Is odd partition on the COMBINATORICS exam?

A problem set question might ask you to list all odd partitions of a small integer, build the generating function for odd parts, or compare odd partitions with another restricted partition family. The move is usually to check each part, not the total, and make sure order is ignored.

If the question is more advanced, you may be asked to use a product like 1 / ((1 - x)(1 - x^3)(1 - x^5) ...) and interpret the coefficient of x^n. That means you are reading a counting answer from the power series, not expanding the whole thing by brute force. For short quiz items, a clean example like 4 = 3 + 1 or 4 = 1 + 1 + 1 + 1 can show that you know the difference between a partition and a composition.

Odd partition vs Even Partition

Odd partitions use only odd summands, while even partitions use only even summands. Both are restricted partitions, so they can look similar at a glance, but the allowed parts are completely different. A number can have many odd partitions and many even partitions, but the sets you list will not overlap unless a part is both odd and even, which does not happen.

Key things to remember about odd partition

• An odd partition is a partition of a positive integer into odd parts, with order ignored.

• The restriction is on the summands, not on the total number being partitioned, so even integers can have odd partitions.

• Odd partitions are counted with generating functions built from odd powers only, starting with 1, 3, 5, and so on.

• This term is closely tied to partition functions and Euler’s identity, especially when a course compares different restricted partition families.

• A common mistake is to treat different orders as different answers, but in partition problems, 3 + 1 + 1 and 1 + 3 + 1 are the same partition.

Frequently asked questions about odd partition

What is odd partition in Combinatorics?

An odd partition is a way to write a positive integer as a sum of odd integers, where the order of the addends does not matter. For example, 7 = 5 + 1 + 1 is an odd partition of 7. The idea belongs to integer partition theory, where you count sums under specific restrictions.

How is an odd partition different from a partition?

A regular partition can use any positive integers as parts, but an odd partition allows only odd parts. So 4 has the partitions 4, 3 + 1, 2 + 2, 2 + 1 + 1, and 1 + 1 + 1 + 1, but only 3 + 1 and 1 + 1 + 1 + 1 are odd partitions. The counting rules change as soon as you add the odd-only restriction.

What is the generating function for odd partitions?

The generating function is 1 / ((1 - x)(1 - x^3)(1 - x^5)...). Each factor tracks how many times you can use a given odd part. When you expand the product, the coefficient of x^n counts the odd partitions of n.

Why are odd partitions connected to distinct parts?

Euler showed that the number of odd partitions of n equals the number of partitions of n into distinct parts. The partitions themselves are different, but the counts match. This is one of the classic identities in partition theory and a favorite example of a hidden combinatorial equivalence.