number_theory_calculator
Perform number theory calculations including prime factorization, primality testing, modular arithmetic, and Fibonacci sequence generation.
Instructions
Brief description: Advanced number theory calculation tool, supporting prime testing, factorization, modular arithmetic, etc.
Examples:
number_theory_calculator(operation='prime_factorization', number=60)
number_theory_calculator(operation='prime_test', number=97)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| operation | Yes | Number theory operation. Supports: 'prime_factorization', 'prime_test', 'generate_primes', 'modular_arithmetic', 'extended_gcd', 'euler_totient', 'fibonacci' | |
| number | No | Primary operand, must be a positive integer | |
| numbers | No | List of numbers for operations requiring multiple numbers | |
| modulus | No | Modulus for modular arithmetic, must be positive | |
| base | No | Base for modular exponentiation | |
| exponent | No | Exponent for modular exponentiation, must be non-negative | |
| limit | No | Limit value for prime generation or fibonacci sequence | |
| precision | No | Number of terms for continued fraction expansion |