MERCHANT

combinatorics.openverbs.com x402 offerings

No merchant-supplied description has been published for combinatorics.openverbs.com. Browse its currently listed x402 offerings and observed catalog information.

This provider profile is generated from public catalog observations and has no verified controller.

5offerings
$0.004median USD/USDC cost (5 priced)
569 msmedian observed latency (5 tested)

Offering types

Api Endpoint: 5

Methods

Get: 5

Observed health

Healthy: 5

Offerings

Showing 1–5 of 5

Binomial coefficient nCr = n!/(r!(n-r)!), the number of unordered r-subsets of n. Requires r ≤ n and min(r, n-r) ≤ 10000.

Api EndpointScience And EducationHealthy · 174 ms0.004 USDC0.004 USDC · eip155:8453 · USDC
https://combinatorics.openverbs.com/v1/combinations
Details

The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000.

Api EndpointScience And EducationHealthy · 168 ms0.004 USDC0.004 USDC · eip155:8453 · USDC
https://combinatorics.openverbs.com/v1/catalan
Details

Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000.

Api EndpointScience And EducationHealthy · 169 ms0.004 USDC0.004 USDC · eip155:8453 · USDC
https://combinatorics.openverbs.com/v1/permutations
Details

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.

Api EndpointScience And EducationHealthy · 169 ms0.004 USDC0.004 USDC · eip155:8453 · USDC
https://combinatorics.openverbs.com/v1/multinomial
Details

Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count.

Api EndpointScience And EducationHealthy · 170 ms0.004 USDC0.004 USDC · eip155:8453 · USDC
https://combinatorics.openverbs.com/v1/factorial
Details