Question

please tell me the answer​

Answer 1

Answer:

3) odd

4) 1

5)2/7

please make my answer a brainlist

Answer 2

Answer:

Qs 3) 2

Qs 4) In the Euclidean algorithm, this is commonly used as the basic case. If a divides the product b⋅c, and gcd(a, b) = d, then a/d divides c. If m is a non-negative integer, then gcd(m⋅a, m⋅b) = m⋅gcd(a, b). If m is any integer, then gcd(a + m⋅b, b) = gcd(a, b).

Qs 5) 2/7