Loading UtilityForge…
CALCULATION DESK
Compute the number of ordered arrangements of r items chosen from n. Inputs are non-negative integers with r ≤ n.
WHAT THIS DOES
Runs entirely in your browser.
/tools/permutation-calculatorpermutation-calcv4.0.0LOCAL · LOCAL RUNIMPLEMENTED — This workbench is functional in the current release.Presets for this workbench
No preset yet. A preset stores the values in this form — never the result — and only for workbenches that run entirely in your browser.
Collections
Saved on this device only. Turn on sync to carry them to another device.
METHOD / LOCAL RUN
Iterative product: n × (n−1) × … × (n−r+1).
Boundary: Bounded by Number.MAX_SAFE_INTEGER (≈ 9 × 10^15). Inputs that overflow return Infinity.
The calculation or transformation runs in your browser using the values entered above. No input is sent to UtilityForge for this tool.
EXAMPLES / LOCAL RUN FIXTURES
FAQ
No. The permutation calculator runs locally.
The workbench states the exact method behind every result — the formula or procedure this page runs — so you can verify the computation instead of trusting a black box.
No. This workbench runs in the page: n, r are read by the code your browser already downloaded, and UtilityForge receives neither the values nor the result.
Bounded by Number.MAX_SAFE_INTEGER (≈ 9 × 10^15). Inputs that overflow return Infinity.
RELATED TOOLS
LOCAL — Runs entirely in your browser.
COMMON USE CASES / SOURCE NOTE
Last reviewed:
Source information: Local iterative product.