Start Learning Free

Before You Begin

Question #41791

Difficulty: 8/10 | 🟢 Free

The Question

In a survey of students regarding their performance in three exams, it was found that 68 students passed Physics, 80 passed Chemistry, and 92 passed Mathematics. Let xx be the number of students who passed exactly two of these exams, and yy be the number of students who passed all three exams. A scholarship committee assigns a performance score SS to the group, given by S=x+12⌊y5⌋S = x + 12 \left\lfloor \frac{y}{5} \right\rfloor where ⌊⋅⌋\lfloor \cdot \rfloor denotes the greatest integer function. Find the maximum possible value of SS.

Options

  • A.

    168

  • B.

    172

  • C.

    174

  • D.

    176

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Bridge

Practice problems that bridge the gap between foundational theory and advanced practical application.

Concepts Behind This Question

Word Problem Modeling|Fundamental Principle of Counting (FPC)|Integral Part and Fractional Part|Cardinality Inclusion-Exclusion

Why This Question Is Tricky

Common Mistakes

This question tests the ability to model a word problem using the Principle of Inclusion-Exclusion to derive the hidden constraints of a feasible region (x+2y≤148x+2y \le 148).

The primary trap lies in the objective function containing a floor function, which forces non-linear discretization.

Students typically check only the vertices of the feasible region (e.g., y=68  ⟹  S=168y=68 \implies S=168), assuming the maximum of a linear-like model occurs at the boundaries.

However, the floor function's step-nature causes the true maximum to occur strictly inside an edge at a multiple of the denominator (y=65  ⟹  S=174y=65 \implies S=174), rewarding analytical lattice-point checking over blind algorithm application.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterLinear Programming - Class 12
ConceptWord Problem Modeling
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree