There are n sets of numbers each having only three positive integers with LCM equal to 1001 and HCF equal to 1. What is the value of n?
Solution :
The correct option is More than 8.
Let's find the value of , which represents the total number of sets of three positive integers such that:
1.
2.
First, let's find the prime factorization of 1001:
Let the three numbers be of the form:
Where each exponent .
For each prime factor :
- Since , the maximum exponent among the three numbers for each prime factor must be 1.
- Since , the minimum exponent among the three numbers for each prime factor must be 0.
Thus, for each prime factor, the exponents chosen for must be a combination of 0s and 1s that contains at least one 0 and at least one 1.
Out of all possible combinations of 3 binary exponents (0 or 1):
- The combination is invalid (maximum is not 1).
- The combination is invalid (minimum is not 0).
So, there are valid exponent choices for each prime factor.
Since the choices for each prime factor (7, 11, and 13) are independent, the total number of ordered triplets is:
To find the total number of unordered sets of 3 distinct positive integers, we must account for symmetric triplets:
1. Triplets with 3 distinct numbers:
Each distinct set can be ordered in ways.
2. Triplets where two numbers are equal (e.g., ):
For , the exponents for each prime factor must be identical for and , and different for .
The exponent pairs must have one value 0 and the other 1:
- or -> 2 valid choices per prime factor.
So there are triplets of the form .
Similarly, there are 8 triplets for and 8 triplets for .
Thus, there are ordered triplets having 2 equal numbers.
Subtracting these from the total gives the number of ordered triplets with 3 distinct elements:
The number of distinct unordered sets of 3 numbers is:
Since 32 is significantly greater than 8, the value of is More than 8.
Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.
Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.
Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.
A comprehensive SSC MTS 2026 Mock Test 4 designed to help aspirants strengthen their preparation and improve their performance for the Staff Selection Commission Multi-Tasking Staff examination. This mock test covers all major sections including Numerical and Mathematical Ability, Reasoning Ability and Problem Solving, General Awareness, and English Language and Comprehension. It includes a balanced combination of conceptual, analytical, and exam-oriented multiple-choice questions aligned with the latest SSC MTS syllabus and exam pattern. Ideal for practice, revision, self-evaluation, accuracy improvement, speed enhancement, and effective time management, this mock test helps candidates assess their exam readiness, identify improvement areas, and build confidence for the SSC MTS 2026 examination
A comprehensive SSC MTS 2026 Mock Test 3 designed to help aspirants prepare thoroughly for the Staff Selection Commission Multi-Tasking Staff examination. This mock test covers all important sections including Numerical and Mathematical Ability, Reasoning Ability and Problem Solving, General Awareness, and English Language and Comprehension. It features a carefully curated set of multiple-choice questions that test conceptual understanding, logical reasoning, problem-solving skills, speed, and accuracy in accordance with the latest SSC MTS exam pattern. Ideal for practice, revision, self-assessment, performance evaluation, and time management improvement, this mock test enables candidates to identify strengths and weaknesses while building confidence for the SSC MTS 2026 examination.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.