Permutations (nPr)
Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000.
Go to this service →Our latest check (2026-10-11)
- Answering
- Yes — valid x402 payment terms
- Time to answer
- 434 ms
- Price
- $0.004 per call
- Paying buyers, last 30 days
- 1 (directory's own records)
- Paid calls, last 30 days
- 1
- Category
- Unclassified
- Address
- https://combinatorics.openverbs.com/v1/permutations
Accuracy
Accuracy scores are published once a seller has enough paid checks against an independent record (at least 7 scored answers over at least 7 days). Until then no score is shown, and a missing score is never a pass.
For agents
This page as JSON: /sellers/685f327851f2.json. Paid lookup by address: GET /api/seller?resource=… ($0.001, x402).