Register

GATE ACADEMY TEST SERIES

708 views
0 votes
0 votes
What is the minimum number of students, each of whom comes from one of the 50 states, who must be enrolled in a university to guarantee that there are at least 100 who come from the same state?
User Avatar

1 Answer

Best answer
5 votes
5 votes

99*50=4950 it is the maximum number of students when none of the university is having 100 or more student. Now adding 1 more student will guarantee that there are at least 100 who come from the same state.

So answer = 99*50 +1 = 4951

Note: To guarantee that there are at least 100 who come from the same state answer is 4951 else the answer will be 100 (All the 100 students come from the same state). 

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Souvik33 asked Oct 30, 2022
405 views
Ace Academy Test Series Qn#7
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
User Avatar
0 votes
0 votes
0 answers
2
Souvik33 asked Oct 30, 2022
336 views
Ace Academy Test Series
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
User Avatar
0 votes
0 votes
2 answers
3
saumya mishra asked Jun 1, 2018
829 views
Number of ordered pairs
User Avatar
0 votes
0 votes
1 answer
4
Sammohan Ganguly asked May 29, 2018
3,060 views
Combinatorics
Among the integers $1,2,3,....,200$ if $101$ integers are chosen,then show that there are two among the chosen,such that one is divisible by the other.
Among the integers $1,2,3,....,200$ if $101$ integers are chosen,then show that there are two among the chosen,such that one is divisible by the other.
User Avatar
Link Copied!