Combinatorics

active

Exact combinatorial counting on arbitrary-precision integers — factorials, permutations (nPr), combinations (nCr), multinomial coefficients and Catalan numbers.

UtilityBasex402 v2exactcombinatorics.openverbs.com ↗︎
Transactions · 30d
0
Volume · 30d
$0.00
Unique buyers · 30d
0
Uptime · 30d
100.0%
Latency p50
186ms
Reported calls · 30d
8

Endpoints (5 live)

  • POST /v1/permutations — Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000. (0.004 USDC on Base)
  • POST /v1/multinomial — Multinomial coefficient (k1+k2+…)! / (k1! k2! …) — the number of ways to partition n = Σki items into labelled groups of the given sizes. The sum must be ≤ 20000. (0.004 USDC on Base)
  • POST /v1/factorial — Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count. (0.004 USDC on Base)
  • POST /v1/combinations — Binomial coefficient nCr = n!/(r!(n-r)!), the number of unordered r-subsets of n. Requires r ≤ n and min(r, n-r) ≤ 10000. (0.004 USDC on Base)
  • POST /v1/catalan — The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000. (0.004 USDC on Base)

First seen · last seen