DIVISOR and REMAINDERS Rem <= Divisor Rem(N/D) = r , then N= Dx + r remainders can be -ve also can be converted into +ve by adding divisor LCM and HCF of two natural numbers - x,y HCF = h then numbers are x= ha, y = hb a,b Co-prime LCM - hab xy = lcm*hcf LCM and HCF for a fraction - LCM of fractions = LCM of all Numerators/ HCF of all Denominators HCF of fractions = HCF of all Numerators / LCM of all Denominators (fraction is in most reduced format) LCM and HCF via prime factorization = For LCM, take all the prime bases and raise them each to their highest powers For HCF, take prime bases that are common to all numbers and raise them each to their lowest powers LCM - Type 1 ( Common Remainders) Divisor 👍 Remainder 👍 (Same remainder for all divisor) Number 👎 Sol - LCM(Divisors) + Remainder 👉 Least Number(N) LCM Type 2 ( Common Difference between divisors and their respective remainder) Divisor 👍 Remainder 👍 Number 👎 Sol - Number(N) = (k*LCM(Divisors)) - ...