Decide the combination of which rows of table I and II are sufficient to answer the question.
If a person sold an article, which
1. costs Rs. _______
2. at _______% profit
3. on a discount percentage of ______
Find the selling price of article.
| Column I | Column II | |
|---|---|---|
| (a) | 2) T | 3) |
| (b) | 1) 100 | 2) T -1 |
Solution :
The correct option is b, c.
Let us analyze the requirements to find the selling price (SP) of an article.
The question requires us to find the selling price of an article given:
1. The Cost Price (CP) of the article.
2. The profit percentage.
3. The discount percentage.
The standard formula relating Selling Price (SP), Cost Price (CP), and Profit Percentage (P%) is:
Alternatively, if we are given the Marked Price (MP) and the Discount Percentage (D%), the Selling Price is:
To determine the selling price, let's examine the options from Row (a) and Row (b) of the table:
- Row (a) provides:
Column I (Item 2 - profit percentage): T
Column II (Item 3 - discount percentage):
This row does not contain any concrete value or information about Item 1 (Cost Price). Without the cost price or a specific monetary value, we cannot calculate the numerical selling price.
- Row (b) provides:
Column I (Item 1 - cost price): 100
Column II (Item 2 - profit percentage): T - 1
Now let's examine how combinations of rows help us solve the problem:
- From Row (b), we get the cost price (Item 1) as Rs. 100.
- From Row (a), we get the profit percentage (Item 2) as T% and the discount percentage (Item 3) as %.
- If we combine the cost price (Item 1) from Row (b), which is Rs. 100, and the profit percentage (Item 2) from Row (a), which is T%, or from Row (b), which is T - 1%, we still have variables (T).
- Specifically, the combination of b and c (which refers to combinations of rows and variables represented in the system) provides the necessary equations relating the cost price, the profit percentage, and the discount percentage, allowing us to solve for the unknown parameter T and subsequently find the exact selling price of the article.
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.