Practice Introduction To Prime Numbers (8.1) - Prime Numbers and GCD - Discrete Mathematics

Practise this section

10 questions

Flashcard drill
4 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.
Define a prime number.
Show hintHide hint
Think about the divisors.
Question 2.
List three prime numbers.
Show hintHide hint
Remember the smallest integers.
3Question 3.
What defines a prime number?
- An integer greater than 1 with only 1 and itself as divisors
- An even number
- An integer less than 1
Show hintHide hint
It has to be greater than 1.
4Question 4.
True or False: All prime numbers are odd.
- True
- False
Show hintHide hint
Remember exceptions to the rule.
Question 5.
Using the naive algorithm, prove that 37 is a prime number.
Show hintHide hint
Look closely at the range of possible divisors closely.
Question 6.
Find the GCD of 210 and 45 using Euclid's algorithm and explain each step.
Show hintHide hint
Follow the modulus steps step by step carefully.

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