How can we filter out numbers less than 2 in a number sequence to find prime numbers?(1 point)

Responses

We can test numbers less than 2 by checking if it is divisible by 2.
We can test numbers less than 2 by checking if it is divisible by 2.

Our code needs to throw an error if numbers less than 2 are given.
Our code needs to throw an error if numbers less than 2 are given.

We can have a conditional check to filter out numbers less than 2.
We can have a conditional check to filter out numbers less than 2.

We can have a predefined list of all prime numbers and check if the given number is inside that list.

1 answer

The correct response is:

We can have a conditional check to filter out numbers less than 2.

This approach ensures that only numbers 2 and greater are considered for prime testing, as prime numbers are defined as natural numbers greater than 1 that have no positive divisors other than 1 and themselves.