Confirming your payment

Skip to content

The World of Algorithms · Question 8 of 15

(Challenge) Divisors occur in pairs. For instance, the divisors of 18 are (1, 18), (2, 9) and (3, 6).

Question 84 marksMedium

(Challenge) Divisors occur in pairs. For instance, the divisors of 18 are (1, 18), (2, 9) and (3, 6).

(i) If we write out divisors in pairs, how many numbers do we have to examine between 1 and nn to find all the divisors of nn?

(ii) If we list out the divisors in pairs, will our gcd algorithm still work in the manner we have described?