M1B2-EM0-6

The proces of determination of HCF of two integers using Euclid division Lemma is called

• Euclids theorem

• Euclids division formula

• Euclids division algorithm

• Euclid algorithm

Every positive even and odd integers are respectively of the form .......

• 2q+1, q+1

• q+1, q+2

• 2q, 2q+2

• 2q, 2q+1

HCF of 135 and 225 is

• 65

• 45

• 55

• 75

A prime number is a number with

• Only 2 Factors, 1 and itself

• More than 2 Factors

The number 1 is

• Prime

• Composite

• Neither Prime nor Composite

Euclid's Division lemma states that for any tow positive integers a and b, there exists unique integers q and r such that a=bq+r where r must satisfy

• 0<r<b

• 0 $\le$ r<b

• 0<r $\le$ b

• 0 $\le$ r $\le$ b

Euclid's division lemma states that if a and b are two positive integers, then there exist unique integers q and r such that:

• a = bq + r, 0<r<b

• a = bq + r, 0 $\le$ r $\le$ b

• a = bq + r, 0 $\le$ r< b

• a = bq + r, 0 $\ge$ r $\le$ b

Joe has listed the first 4 multiples of 7 as: 
7   14    22     28
Which one is incorrect?

• 7
• 14
• 22
• 28

Name the factors of 42.

• 1, 6, 7, 42
• 1, 2, 3, 6, 7, 14, 21, 42
• 1, 2, 6, 7, 21, 42

Find the greatest common divisor.

(9, 24)

• 1

• 2

• 3

• 6