Skip to content
Allin
Sign up · Sign in

Partition function calculator

Compute p(n), the number of ways to write an integer as a sum of positive integers regardless of order — so 4 = 4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1 gives p(4) = 5. It uses Euler's pentagonal number recurrence with big integers, exact up to n = 500.

Related tools

All Sequences & series tools →
Catalan number generatorGenerate the nth Catalan number exactly, with big-integer precision. The Catalan numbers Cₙ = (2n)! / ((n+1)! n!) count an astonishing range of structures: balanced parentheses, binary trees, polygon triangulations, Dyck paths and hundreds more. Also lists C₀ through Cₙ.Ceiling and floor function calculatorThe ceiling ⌈x⌉ rounds up to the next integer, the floor ⌊x⌋ rounds down. Enter any number to get both, plus the ordinary round, the truncation toward zero and the fractional part left over.Gamma function calculator Γ(x)Evaluate the gamma function Γ(x), the continuous extension of the factorial with Γ(n) = (n−1)! for positive integers. It uses the Lanczos approximation and Euler's reflection formula to handle negative arguments, and flags the poles at 0, −1, −2, … where Γ blows up. For whole numbers it also shows the exact factorial (x−1)!. Γ appears throughout probability, combinatorics and the analysis of special functions.Möbius function calculator μ(n)The Möbius function μ(n) is 0 if n has a squared prime factor, otherwise +1 or −1 for an even or odd number of distinct prime factors. Enter n and get μ(n) with its prime factorisation and whether n is squarefree.Beta Function CalculatorCompute the Euler Beta function B(x, y) = Γ(x)·Γ(y) / Γ(x+y) via a stable log-gamma.Complementary Error Function CalculatorCompute erfc(x) = 1 − erf(x) to high precision, accurate even far in the tail.Error Function CalculatorEvaluate erf(x), erfc(x) and their inverses erf⁻¹ and erfc⁻¹ to high precision.Function Composition CalculatorEvaluate and graph (f∘g)(x) and (g∘f)(x) for any two functions, with a value table and point evaluation.

Enter Non-negative integer (0–500) and the Partition function calculator works out p(n) — number of partitions, Number of digits straight away. For instance, with Non-negative integer (0–500) = 10 it returns p(n) — number of partitions = 42 and Number of digits = 2.

How to use it

  1. Enter your values: Non-negative integer (0–500).
  2. Read the result instantly: p(n) — number of partitions, Number of digits.

Frequently asked questions

How does the Partition function calculator work?

It takes Non-negative integer (0–500) and derives p(n) — number of partitions and Number of digits from them. The calculation is live as you type, so the result updates on every change.

Which values does the calculator ask for?

A single value: Non-negative integer (0–500). Nothing else is required — no account, no file upload.

What does a typical calculation look like?

With Non-negative integer (0–500) = 10, the calculator returns p(n) — number of partitions = 42 and Number of digits = 2. Those figures come from running this exact tool, so you can reproduce them by entering the same values.

How much does the result change with different inputs?

It moves a lot. Using Non-negative integer (0–500) = 20 instead, Number of digits goes from 2 to 3 — which is why it is worth testing a few scenarios rather than trusting a single figure.

What does it give for smaller values?

Scaled down to Non-negative integer (0–500) = 5, Number of digits comes out at 1. The relationship is worth checking at both ends before you rely on a single result.

When would I actually use this?

Finding the nth term without listing every one before it, summing a long run in one step, and recognising which family a sequence belongs to.

What is the most common mistake?

Starting the index at the wrong end. Whether the first term is a₀ or a₁ shifts every result by one position, and the two conventions are both common.

What is the difference between the Partition function calculator and the Catalan number generator?

This one returns p(n) — number of partitions; the Catalan number generator returns Catalan number Cₙ and C₀ … Cₙ. That is the whole difference — open the one whose figure you need.

Is there a tool for the next step?

Ceiling and floor function calculator is the closest one after this: The ceiling ⌈x⌉ rounds up to the next integer, the floor ⌊x⌋ rounds down. Enter any number to get both, plus the ordinary round, the truncation toward zero and the fractional part left over.

What else is worth having open alongside it?

Gamma function calculator Γ(x) and Möbius function calculator μ(n) — they come up in the same task often enough to be worth a second tab.

Further reading

All guides →
ExplainerFibonacci and the Golden RatioThe Fibonacci sequence adds each pair of terms to make the next; the ratio of neighboring terms homes in on the golden ratio φ ≈ 1.618. See how, and where the pattern turns up.ExplainerThe Flat Pattern of a Cone Is a Sector, Not a CircleRoll a 50 mm cone 80 mm tall and its pattern is a 190.8° slice of a 94 mm circle. Flatten a nearly cylindrical lampshade and the pattern radius runs to 839 mm — the shallower the taper, the further away the apex.ExplainerA 1 % Drop Rate Does Not Mean One Hundred RunsAt 1 %, a hundred attempts give you 63.4 % — not certainty. Ninety per cent takes 230 attempts and ninety-nine takes 459, and more than a third of players are still empty-handed at a hundred.ExplainerWhat Is a Z-Score? Standard Deviations Above the MeanA z-score is z = (x − μ) / σ — how many standard deviations a value sits from the mean. Learn how to compute it, read the standard normal curve, and turn it into a percentile.How-toHow to Find the Distance Between Two PointsUse the distance formula d = √((x₂−x₁)² + (y₂−y₁)²) to measure the straight-line distance between two points on a plane, with a worked example and the midpoint too.How-toHow to Calculate the Slope of a Line: Rise Over RunFind the slope of a line from two points with m = (y₂ − y₁) / (x₂ − x₁), and read what a positive, negative, zero, or undefined slope tells you.