Update

Muft Shiksha™ एक 100% Free Education Portal है 🇮🇳, जिसका उद्देश्य Class 9–12 के हर विद्यार्थी तक High-Quality Education को पूरी तरह मुफ्त पहुँचाना है। 🇮🇳 हम मानते हैं कि अच्छी शिक्षा किसी student की आर्थिक स्थिति पर निर्भर नहीं होनी चाहिए। 🇮🇳 हर विद्यार्थी को वही Quality Study Material, MCQs, Quizzes, Exam Preparation, Concept-Based Learning और Bilingual Support मिलना चाहिए, जो आमतौर पर महंगी Coaching या Premium Platforms में मिलता है। Muft Shiksha™ 🇮🇳 इसी सोच के साथ बनाया गया है

Subjects

RELATED QUESTIONS

Hcf And Lcm Using Prime Factorisation

Class 10 Mathematics के इस tag से जुड़े questions। हर question के साथ chapter, topic, level और difficulty दी गई है।

MathematicsIf two numbers are (2^3\times3\times7) and (2\times3^2\times5), what is their LCM?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsWhich statement is correct for (150) and (210)?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf (a=2^3\times3^2\times5) and (b=2^5\times3\times5^2), what will be the power of (5) in their HCF?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf the HCF of two numbers is (16) and their LCM is (640), what is their product?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsThe prime factorisations of three numbers are (2^2\times3^3), (2^4\times3^2\times5), and (2^3\times3\times7). What is their HCF?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf a number leaves remainder (3) when divided by (16), (20), and (25), what is the smallest such number?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf (252=2^2\times3^2\times7) and (330=2\times3\times5\times11), how many distinct prime factors will their LCM have?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf the HCF of (126) and (315) is (63), what is their LCM?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf two numbers are coprime and their LCM is (221), what is their product?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsWhich pair has HCF (18) and LCM (540)?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsThe HCF of two numbers is (30) and their LCM is (900). If the numbers are (30a) and (30b), which statement about (a) and (b) is correct?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf (m=2^2\times3^a\times5) and (n=2^5\times3^3\times5^b) have LCM (2^5\times3^4\times5^2), which values can be correct?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf (x=2^a\times3^2\times5) and (y=2^4\times3^b\times7) have HCF (2^3\times3^2), which values are possible?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsWhat is the smallest number that leaves remainder (5) when divided by (18), (24), and (30)?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsA class has (84) pencils and (126) erasers. They are to be divided into the maximum number of identical packets. How many packets can be made?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsThree bells ring at intervals of (20), (28), and (35) seconds. They ring together now. After how many seconds will they ring together again?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf (p=2^4\times3^3\times5) and (q=2^2\times3\times5^2\times11), what is (\frac{\text{LCM}}{\text{HCF}})?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsIf the HCF of two numbers is (18) and their LCM is (378), which statement is correct?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsWhat is the greatest number that can exactly divide (144), (216), and (360)?Class 10Real NumbersHCF and LCM using prime factorisationHardMathematicsWhat is the smallest number exactly divisible by (32), (48), and (80)?Class 10Real NumbersHCF and LCM using prime factorisationHard

Add Muft Shiksha to your Home Screen

In Safari, tap Share, then Add to Home Screen.