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.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes | Upper bound (inclusive), must be >= 2 and <= 10,000,000 |