Pigeon Hole Principle says that if there are many pigeons and a few pigeon holes, then there must be some pigeon holes occupied by--------------

Related MCQs

• Fact 1: All chickens are birds. Fact 2: Some chickens are hens. Fact 3: Female birds lay eggs. If the first three statements are facts, which of the following statements must also be a fact? I: All birds lay eggs. II: Some Hens are birds. III: Some chickens are not hens.
• Fact 1:All dogs like to run.Fact 2:Some dogs like to swim.Fact 3:Some dogs look like their masters.If the first three statements are facts, which of the following statements must also be a fact? I:All dogs who like to swim look like their masters. II:Dogs who like to swim also like to run.III:Dogs who like to run do not look like their masters.
• Fact 1: All drink mixes are beverages. Fact 2: All beverages are drinkable. Fact 3: Some beverages are red. If the first three statements are facts, which of the following statements must also be a fact? I: Some drink mixes are red. II: All beverages are drink mixes. III: All red drink mixes are drinkable.
• In a room containing 28 females, there are 18 females who speak English, 15 females speak french and 22 speak german. 9 females speak both english and french, 11 females speak both french and german where as 13 speak both german and english. How many females speak all 3 languages?
• In a group of athletic teams in a certain institute, 21 are in the basket ball team, 26 in the hockey team, 29 in the foot ball team. If 14 play hockey and basketball, 12 play foot ball and basket ball, 15 play hockey and foot ball, 8 play all the three games. (i) How many players are there in all?
• How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric?
• Let S = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21}. What is the smallest integer N > 0 such that for any set of N integers, chosen from S, there must be two distinct integers that divide each other? IZ
• If |A|=5 and |B|=4, then there exists an injective function f: B→A.
• Determine the validity of argument given: s1: If I like mathematics then I will study. S2: Either I will study or I will fail. S: If I fail then I do not mlike mathematics.
• How many onto (or surjective) functions are there from an n-element (n => 2) set to a 2-element set?