Find g.c.d of 150 and 32 by euclills nithor and find l.c.m by fomula method
Answers
Answered by
0
Step-by-step explanation:
The GCD is used for a variety of applications in number theory, particularly in modular arithmetic and thus encryption algorithms such as RSA. It is also used for simpler applications, such as simplifying fractions.
In principle, greatest common divisors can be computed by determining the prime factorizations of the two numbers and comparing factors, as in the following example: to compute gcd(18, 84), we find the prime factorizations 18 = 2 · 32 and 84 = 22 · 3 · 7, and since the "overlap" of the two expressions is 2 · 3, gcd(18, ...
Similar questions
Math,
2 months ago
Science,
2 months ago
Computer Science,
2 months ago
English,
5 months ago
Business Studies,
5 months ago
Social Sciences,
10 months ago
Physics,
10 months ago
Biology,
10 months ago