math_factorial_calculator
Compute exact factorial, double factorial, permutations, and combinations using arbitrary-precision arithmetic for integers up to 10,000.
Instructions
Compute Factorial, Double Factorial, Permutations And Combinations. Compute exact integer combinatorics with arbitrary-precision BigInt: factorial (n!), double factorial (n!!), permutations (nPr), or combinations (nCr). Select the operation via the operation field; factorial and doubleFactorial take only n, while permutations and combinations also require r (with r at most n). Inputs n and r accept a number or a decimal-digit string and must be integers in the range 0 to 10000. Use this for exact counting and probability math where doubles lose precision (n! overflows IEEE 754 at n=171); use math_scientific_calculator instead for general expression evaluation, or math_gcd_lcm_calculator for greatest common divisor and least common multiple. Pure local computation: read-only, non-destructive, deterministic, contacts no external service, and is rate-limited (60 requests/minute for anonymous callers). Returns the result as a decimal string, its digit count, and leading digits for very large outputs.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| operation | Yes | Which calculation to perform. permutations and combinations additionally require r. | |
| n | Yes | Non-negative integer 0 to 10000, as a number or decimal-digit string. For permutations and combinations this is the set size. | |
| r | No | Selection size for permutations and combinations: integer 0 to n. Required for those operations, ignored otherwise. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| success | No | True when the calculation succeeded. | |
| operation | No | The operation that was performed. | |
| result | No | The computed value and its shape. |