sieve_of_eratosthenes
Generate every prime number up to a given upper bound using the Sieve of Eratosthenes algorithm, ideal for fast primality listing and number theory tasks.
Instructions
Generate all prime numbers up to N using the Sieve of Eratosthenes algorithm.
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": "sieve_of_eratosthenes"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes | Upper bound (inclusive), must be >= 2 and <= 10,000,000 |