Home/ Questions/Q 550854
Next
In Process
Virat
  • 1
Asked: 2026-10-03T04:38:20+00:00 In:

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. The prime factorisation of 180 is 2² × 3² × 5¹. How would you represent this?

  • 1

Represent the factorisation as a list of pairs where each pair contains (prime, exponent). For example, 180 is represented cleanly as [(2, 2), (3, 2), (5, 1)] denoting primes and their respective powers.

Class 9 Chapter 11 The World of Algorithms solutions
Class 9 Maths Ganita Manjari Part 2 Book and Solutions

compute the prime factorisation of a numberganita manjari part 2 chapter 11 question answerprime factorisation of 180 is 2² × 3² × 5¹the gcd of two numbers by computing prime factorisationthe world of algorithms solutions
Share

    1 Answer

    1. We can represent prime factorisation as a list of pairs, where each pair consists of (prime_factor, power). For the number 180 (2² × 3² × 5¹), the representation is [(2, 2), (3, 2), (5, 1)]. Alternatively, it can be represented as an expanded list of repeated prime factors in ascending order, such as [2, 2, 3, 3, 5].

       

      For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 11 The World of Algorithms Question Answer (2026-27)

      https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-11/

      • 0
    Leave an answer

    Leave an answer

    Browse