All Exams Test series for 1 year @ ₹349 only
Question

A school has 100 students distributed among $1^{\text{st}}$ to $10^{\text{th}}$ standards.

Based on this, which one of the following statements is always correct?

The correct answer is
There are at least 10 students who belong to the same standard.

Understanding Student Distribution

The question asks us to identify a statement that is guaranteed to be true when 100 students are distributed among 10 different standards (from 1st to 10th).

Applying the Pigeonhole Principle

This problem can be solved using the Pigeonhole Principle. In this scenario:

  • Pigeons: The 100 students.
  • Pigeonholes: The 10 standards.

The generalized Pigeonhole Principle states that if $n$ items are placed into $m$ containers, then at least one container must hold at least $\lceil n/m \rceil$ items.

Calculating Minimum Students Per Standard

We apply the principle with $n=100$ students and $m=10$ standards:

Minimum number of students in at least one standard = $\lceil \frac{\text{Total Students}}{\text{Number of Standards}} \rceil$

Calculation: $\lceil \frac{100}{10} \rceil = \lceil 10 \rceil = 10$

Identifying the Always Correct Statement

The calculation shows that there must be at least one standard containing a minimum of 10 students. This directly confirms the first option.

Therefore, the statement "There are at least 10 students who belong to the same standard" is always correct.

Analyzing Why Other Options Are Not Always Correct

Let's examine why the other options might not always hold true:

  • Option 2: It's possible all 100 students are in just one or a few standards, leaving others empty.
  • Option 3: All 100 students could be concentrated in the 10th standard alone.
  • Option 4: The students could all be in standards 6th to 10th, making the total for 1st to 5th zero.
Was this answer helpful?

Important Questions from Pigeonhole Principle

  1. There are 4 red, 5 green, and 6 blue balls inside a box. If $N$ number of balls are picked simultaneously, what is the smallest value of $N$ that guarantees there will be at least two balls of the same colour? 

    One cannot see the colour of the balls until they are picked.

Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App