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 ...
Home/ganita manjari part 2 chapter 11 question answer
Discussion Forum Latest Questions
Piyush365
Asked: In: Class 9 Maths
81000 mod 51000 = 30000, giving gcd(51000, 30000). Then 51000 mod 30000 = 21000, 30000 mod 21000 = 9000, 21000 mod 9000 = 3000 and 9000 mod 3000 = 0. With zero reached, the greatest common divisor is 3000. Ganita Manjari ...
Piyush365
Asked: In: Class 9 Maths
We only need to examine numbers from 1 up to ⌊√n⌋. Because any divisor d larger than √n pairs with a quotient n/d smaller than √n, testing up to √n finds them all. Class 9 Chapter 11 The World of Algorithms ...
The maximum single-digit sum is 9 + 9 = 18. Adding the maximum incoming carry of 1 gives 19. Because 19 produces a tens digit of 1, the carry can never exceed 1. Class 9 Ganita Manjari Part 2 chapter 11 ...