Practice Naive Algorithm For Primality Testing (8.4)

Practise this section

10 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What defines a prime number?
Show hintHide hint
Think about the definition and the number of divisors.
Question 2.
Is the number 4 prime or composite?
Show hintHide hint
Consider the divisors of 4.
3Question 3.
What is a prime number?
- A number with more than two factors.
- A number with only two factors.
- A number that is always odd.
Show hintHide hint
Recall the definition of a prime number.
4Question 4.
The naive algorithm for primality testing uses which of the following methods?
- True
- False
Show hintHide hint
Think about how we identify potential factors.
Question 5.
Apply the naive algorithm to test whether 49 is a prime number. Show your steps.
Show hintHide hint
What numbers will you check against 49?
Question 6.
How many checks would you need to determine if 101 is prime using the naive method?
Show hintHide hint
Determine how many divisors you check.

6 more questions in this section. Enroll free to practise them all.