ForHosting KIT · Developer Utilities

Distinct parts partition count

The distinct-parts partition function q(n) answers a classic number-theory question: in how many ways can you write a non-negative integer n as a sum of positive integers when every summand appears at most once and the order of summands does not matter?

● BetaFree · in your browser
Use it from WebAPIEmailTelegramApp soon

For example, 5 equals 5, 4+1, and 3+2, so q(5) equals three; 6 has four distinct-part partitions and 10 has ten. This count is different from the unrestricted partition function p(n), which allows repeated parts such as 2+2 or 1+1+1. Distinct-part partitions appear in generating-function identities, Euler's theorem equating them with odd-part partitions, olympiad problems, and contest dynamic-programming drills. This capability accepts a non-negative integer n and returns the exact q(n) as a decimal string computed with BigInt 0-1 knapsack-style dynamic programming, so values beyond ordinary safe-integer limits stay correct digit for digit. Negative n is rejected with a clear validation error instead of a silent zero or a wrong answer. The free browser tool and the paid API share one pure function, so classroom demos and automated pipelines never diverge on the same n.

How to use it

Enter your values in the form above. The tool checks them before calculating and shows the result on the same page.

Check your inputs

Use the labels and units shown next to each field. If something is missing or outside the allowed range, the page points to the field to fix.

Use it again or automate it

Use the browser tool for individual checks and the API when you need the same capability in an automated workflow.

Get an answer now

Enter one set of values and see the result without building a spreadsheet or script.

Compare scenarios

Change one value at a time and rerun the calculation to understand what affects the result.

Automate repeated work

Use the API when the same calculation needs to run inside your product or workflow.

How do I use this capability?

Complete the fields above and run it on this page. The form highlights anything that needs attention.

Everything on this page is available programmatically. This section is for teams who want to wire it into their own systems; everyone else can just use the tool above.

POSThttps://api.kit.forhosting.com/numth/distinct-partitions

Prefer to automate it? One authenticated POST creates the task; the result comes back by webhook or a signed link. The same capability also runs here on the web, by email and from Telegram — and soon from our app too.

curl -X POST https://api.kit.forhosting.com/numth/distinct-partitions \
  -H "Authorization: Bearer $KIT_KEY" \
  -H "Content-Type: application/json" \
  -d '{"n":10}'
{
  "n": 10
}
{
  "task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
  "type": "numth.distinct_partitions",
  "status": "queued",
  "_links": {
    "result": "/tasks/tsk_…/result"
  }
}

The API is asynchronous: the call returns a task_id immediately and the result arrives by webhook. Polling is capped at 1 req/s per task.

Per request$0.002

Published price — no tokens, no invented credits. A failed task is never charged.

HTTPCodeMeaning
401unauthorizedMissing or invalid API key.
402insufficient_balanceYour balance doesn't cover the task price.
404unknown_typeThat task type doesn't exist.
429rate_limitedToo many requests. Use the webhook instead of polling.

Read the full KIT documentation →