ATAT Innovation Labs

AT-FS10 · Maths in code

Prime Number Finder (Sieve Method)

Finds all primes up to a limit with the Sieve of Eratosthenes and shows how the sieve removes numbers.

Get the cost on WhatsApp

Suits
1st year
Branches
CSE, ISE, AIML
Type
Software

How it works

The program writes out all numbers up to your limit in a grid. Starting from 2, it strikes out every multiple of each prime it finds, and whatever is left at the end is prime. The grid changes colour as numbers are removed, so the working of the Sieve of Eratosthenes is visible. The final list and the count of primes are printed.

What it does

  • Fast for large limits
  • Visual sieve grid
  • Prime count

Built with

Python or C

What you get

  • Working software with full source code
  • Steps to install and run it on your laptop
  • Rough report and explanation of the working
  • Live demo on video call before the final payment

Good to know

  • Features are as listed here. Anything extra is quoted separately.
  • Runs on a normal laptop unless we tell you otherwise.
  • Full reports and PPTs are not included.

Similar projects