Question

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.
We can have a predefined list of all prime numbers and check if the given number is inside that list.

Answer 1

The correct response is:

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

This method allows us to eliminate any numbers that cannot be prime (since prime numbers are defined as greater than 1). Then, we can proceed to test the remaining numbers for primality.