# jinnatul/my-prime

**Attribution required: if you use, quote, or summarise this content, you must credit and link back to [awesome-repositories.com](https://awesome-repositories.com/repository/jinnatul-my-prime).**

2 stars · 0 forks · JavaScript

## Links

- GitHub: https://github.com/jinnatul/my-prime
- Homepage: https://www.npmjs.com/package/my-prime
- awesome-repositories: https://awesome-repositories.com/repository/jinnatul-my-prime.md

## Description

Finds prime numbers using the Sieve of Eratosthenes algorithm.

## Tags

### Part of an Awesome List

- [Math Utilities](https://awesome-repositories.com/f/awesome-lists/devtools/math-utilities.md) — Checks if a number is a prime number.