Muft Shiksha
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
Class 12MathematicsRelations and FunctionsIntroduction to RelationsExpert
0 reads0 ratings0 helpful

In the divisibility relation on (A={1,2,3,6,12}), what is the greatest lower bound of (6) and (12)?

Answer and explanation

Correct answer: (6)

Step 1: A lower bound must divide both (6) and (12). Step 2: (1,2,3,6) are lower bounds. Step 3: The greatest among them under divisibility is (6).

Related tags

RelationsPartial-OrderGlbDivisibilityIntroduction To RelationsRelations And FunctionsMathematicsClass 12 Mcq
सुधार सुझाएँ / Earn

Was this question useful?

No ratings yetWrite a review / Rate this question

Student Reviews

No published reviews yet.

KEEP PRACTISING

10 more MCQs
  1. 1If (A={1,2}), what does a relation on (A) mean?
  2. 2If (A={a,b}) and (B={1,2}), how many ordered pairs are there in (A\times B)?
  3. 3If (A={1,2}), how many total relations can be formed on (A)?
  4. 4Which relation is the universal relation on (A={1,2,3})?
  5. 5Which statement is correct about the empty relation?
  6. 6If (A={1,2,3}), how many pairs are there in the universal relation on (A)?
  7. 7Which pairs are compulsory in the identity relation on a set (A)?
  8. 8If (A={1,2,3}), which is the identity relation?
  9. 9What condition is necessary for a relation (R) to be reflexive?
  10. 10On (A={1,2}), which property is definitely satisfied by (R={(1,1),(2,2),(1,2)})?
Found an issue? Help improve this questionMy reports and replies

Add Muft Shiksha to your Home Screen

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