Confirming your payment

Skip to content

The World of Algorithms · Question 15 of 15

(Challenge) We can also find the gcd of two numbers by computing prime factorisation of both the numbers.

Question 154 marksMedium

(Challenge) We can also find the gcd of two numbers by computing prime factorisation of both the numbers. Try to write an algorithm to compute the prime factorisation of a number.

(i) The prime factorisation of 180 is 22×32×512^2 \times 3^2 \times 5^1. How would you represent this?

(ii) How would you compare the prime factorisations of two numbers?