Define prime numbers with example and way to find the prime numbers by sieve Eratosthenes?

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself.

In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite the multiples of each prime, starting with the first prime number, 2

Step-by-step explanation:

Hope it helps you ☺

bn,mn,n.vn.

step-by-step explanation:

correct answer:

b.(19,-2)