prime_factorization
Factor any positive integer into its prime components, returning each prime and exponent. Use it to break numbers into prime powers for math, cryptography, or simplification tasks.
Instructions
Return the prime factorization of a positive integer n.
The result is a list of {"prime": p, "exponent": k} entries, ordered
by prime. prime_factorization(360) -> 2^3 * 3^2 * 5^1.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"n": "<n>"
},
"name": "prime_factorization"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |