The number of divisors of (26 × 35 × 53 × 72 ) , which are of the form (3r + 1) , where r is a non-negative integer, is
Solution :
The correct answer is 42.
We are given the number , and we need to find the number of its divisors that are of the form , where is a non-negative integer. A divisor of this form leaves a remainder of 1 when divided by 3, which means it is congruent to 1 modulo 3.
Any divisor of can be written in the form:
where the powers must satisfy the conditions , , , and .
Let's analyze the remainder of each prime factor when divided by 3:
1. For the factor 3: If , the divisor will be a multiple of 3. A multiple of 3 can never leave a remainder of 1 when divided by 3. Therefore, to have , we must strictly have . This leaves us with 1 choice for the exponent .
2. For the factor 2: Notice that . Thus, .
3. For the factor 5: Notice that . Thus, .
4. For the factor 7: Notice that . Thus, for any power of .
Putting this all together, the divisor modulo 3 is given by:
For the divisor to be of the form , we need . This requires . This means that the sum must be an even integer. For the sum of two numbers to be even, they must both have the same parity (either both are even or both are odd).
Case 1: Both
and
are even.
The possible values for
are from the set {0, 1, 2, 3, 4, 5, 6}. The even values are {0, 2, 4, 6}, which gives 4 choices.
The possible values for
are from the set {0, 1, 2, 3}. The even values are {0, 2}, which gives 2 choices.
Total combinations for Case 1 =
.
Case 2: Both
and
are odd.
The odd values for
are {1, 3, 5}, which gives 3 choices.
The odd values for
are {1, 3}, which gives 2 choices.
Total combinations for Case 2 =
.
Summing the possibilities from both cases, there are valid combinations for the pair .
Finally, we consider the exponent for the prime 7. Since 7 is congruent to 1 modulo 3, the exponent can be any valid value {0, 1, 2}. This gives 3 independent choices.
To find the total number of divisors of the form , we multiply the number of choices for the pair by the number of choices for (and remembering that has exactly 1 choice, 0):
Therefore, there are exactly 42 divisors satisfying the condition.
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.