You are using the new UI (Beta).Return to the original UI

This page has been automatically translated by machine translation. Please note that translations may not be entirely accurate.

keisanHigh-precision calculations for everyday life and work

Eratosthenes' Sieve

Author: hidekchi45Executions: 741

※ This library was created by a member. This site is not responsible for its content.

Manage Bookmarks
Sieve of Eratosthenes Last updated February 22, 2022
Lists all prime numbers less than or equal to the specified natural number. The upper limit for values appears to be around 200,000.
MAXsieve
To run the Sieve of Eratosthenes, you need to allocate memory. To extract large prime numbers, you must allocate an array up to the value of that prime number to serve as the Sieve of Eratosthenes. While it is possible to split the sieve, whether there is room for improvement will depend on the performance capabilities of the calculation program provided by Casio.The 1-minute timeout limit is significant, and since this program’s performance threshold is set too low, it’s safe to say that the performance of Casio’s calculation program feature is not particularly high; therefore, even if improvements were made, it is unlikely that significant results would be achieved.
I have also created an executable program that performs only memory allocation, so please refer to that as well.

No customer feedback for this calculation yet.