Identify primes appearing in both factorisation lists. For each shared prime base, select the smaller of its two exponents, multiply these lowest powers together and report that final product as the GCD. Class 9 Ganita Manjari Part 2 chapter 11 question ...
Discussion Forum Latest Questions
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 ...
Compute divisors(n) to find all factors. Initialize an empty list prime-list. Iterate through each factor in divisors(n); if prime(d) returns true, add d into prime-list, then report prime-list. Cbse Class 9 Maths Ganita Manjari Part 2 Solutions class 9 maths ganita ...
Compute divisors(n) using our earlier algorithm to get the list of factors. If the list has exactly two elements, 1 and n, report that n is prime; otherwise, report it is not. Cbse Class 9 Maths Ganita Manjari Part 2 Solutions
Express m = qn + r, where r = m mod n. If d divides m and n, it divides r = m − qn. Conversely, if d divides n and r, it divides m = qn + r. Class 9 ...