Claude-skill-registry bignum-calculator
Arbitrary precision integer calculator for handling extremely large numbers. Use when users need to compute with numbers that exceed standard numeric limits, including operations like factorial of large numbers (e.g., 100!), powers with large exponents (e.g., 2^1000), arithmetic on numbers with hundreds of digits, or prime checking, GCD, LCM, Fibonacci, and binomial coefficients.
install
source · Clone the upstream repo
git clone https://github.com/majiayu000/claude-skill-registry
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/majiayu000/claude-skill-registry "$T" && mkdir -p ~/.claude/skills && cp -r "$T/skills/data/bignum-calculator" ~/.claude/skills/majiayu000-claude-skill-registry-bignum-calculator && rm -rf "$T"
manifest:
skills/data/bignum-calculator/SKILL.mdsource content
Big Number Calculator
Perform arbitrary precision integer arithmetic using Python's native big integer support.
Quick Start
Run the calculator script:
python scripts/bignum_calc.py <operation> <args...>
Supported Operations
| Operation | Args | Example | Description |
|---|---|---|---|
| a b | | Addition |
| a b | | Subtraction |
| a b | | Multiplication |
| a b | | Integer division |
| a b | | Modulo |
| base exp | | Power (2^1000) |
| n | | Factorial (100!) |
| a b | | Greatest common divisor |
| a b | | Least common multiple |
| n | | Check if prime |
| n | | Count digits |
| n | | Sum of digits |
| n | | n-th Fibonacci number |
| n k | | Binomial coefficient C(n,k) |
Examples
# Calculate 2^1000 python scripts/bignum_calc.py pow 2 1000 # Calculate 100! python scripts/bignum_calc.py fact 100 # Calculate 1000th Fibonacci number python scripts/bignum_calc.py fib 1000 # Check if a large number is prime python scripts/bignum_calc.py prime 104729 # Calculate C(100, 50) python scripts/bignum_calc.py binomial 100 50
Direct Python Usage
For complex calculations, use Python directly:
# Large factorial import math result = math.factorial(1000) print(f"1000! has {len(str(result))} digits") # Large power result = 2 ** 10000 print(f"2^10000 has {len(str(result))} digits") # Modular exponentiation (efficient) result = pow(2, 1000000, 10**9 + 7)