P, Q, R, and S are four towns. One can travel between P and Q along 3 direct paths, between Q and S along 4 direct paths, and between P and R along 4 direct paths. There is no direct path between P and S, while there are a few direct paths between Q and R, and between RandS.OnecantravelfromPtoSeitherviaQ,orviaR,orviaQfollowed by R, respectively, in exactly 62 possible ways. One can also travel from Q to R either directly, or via P, or via S, in exactly 27 possible ways. Then, the number of direct paths between Q and R is:
Solution :
The correct option is 7.
To find the number of direct paths between towns Q and R, we can define the variables and represent the connections between the towns mathematically. Let:
- be the number of direct paths between P and Q, so .
- be the number of direct paths between Q and S, so .
- be the number of direct paths between P and R, so .
- be the number of direct paths between P and S, so .
- be the number of direct paths between Q and R.
- be the number of direct paths between R and S.
Step 1: Formulate the first equation using paths from P to S
According to the problem, one can travel from P to S either via Q, or via R, or via Q followed by R, in exactly 62 possible ways. We can express the number of ways for each route as follows:
1. Path via Q (P → Q → S):
ways.
2. Path via R (P → R → S):
ways.
3. Path via Q followed by R (P → Q → R → S):
ways.
Summing these options gives the total number of ways to travel from P to S:
Subtracting 12 from both sides, we get:
— (Equation 1)
Step 2: Formulate the second equation using paths from Q to R
The problem states that one can travel from Q to R either directly, or via P, or via S, in exactly 27 possible ways:
1. Directly (Q → R):
ways.
2. Via P (Q → P → R):
ways.
3. Via S (Q → S → R):
ways.
Summing these options gives the total number of ways to travel from Q to R:
Subtracting 12 from both sides, we get:
From this, we can express in terms of :
— (Equation 2)
Step 3: Solve the system of equations
Substitute Equation 2 into Equation 1:
Multiply both sides by 4:
Expand the terms:
Simplify and rearrange the equation into a standard quadratic form:
Solve the quadratic equation by factoring:
This yields two potential solutions:
or
Since the number of paths between towns must be a non-negative integer, we discard the fractional value. Thus:
Substituting back into Equation 2 confirms that , which is also a valid integer.
Therefore, the number of direct paths between Q and R is 7.
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.
Practice the complete CLAT 2015 UG Question Paper to improve your preparation for the Common Law Admission Test. This previous year paper covers the key sections of CLAT UG, including English, General Knowledge & Current Affairs, Elementary Mathematics, Legal Aptitude, and Logical Reasoning. Solve CLAT 2015 UG questions to understand the previous year exam pattern, practice important concepts, improve accuracy and speed, and prepare effectively for law entrance examinations.
Prepare for CLAT 2019 UG with the complete question paper and solutions. This paper covers all major sections of the Common Law Admission Test (CLAT) Undergraduate exam, including English Language, Current Affairs & General Knowledge, Legal Reasoning, Logical Reasoning, and Quantitative Techniques.Use the CLAT 2019 UG question paper to practice exam-level questions, understand the question pattern, improve time management, and strengthen your preparation for law entrance examinations.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.