How many numbers must be selected from the set {1, 2, 3, 4} to guarantee that at least one pair of these numbers add up to 7?

Related MCQs

• From a group of 8 men and 6 women, five persons are to be selected to form a committee so that at least 3 women are there on the committee. In how many ways can it be done?
• During a month with 30 days, a cricket team plays at least one game a day, but no more than 45 games. There must be a period of some number of consecutive days during which the team must play exactly               number of games.
• How many ways are there to divide 4 Indian countries and 4 China countries into 4 groups of 2 each such that at least one group must have only Indian countries?
• If A is the set of students who play crocket, B is the set of students who play football then the set of students who play either football or cricket, but not both, can be symbolically depicted as the set
• If in sets A, B, C, the set B ∩ C consists of 8 elements, set A ∩ B consists of 7 elements and set C ∩ A consists of 7 elements then the minimum element in set A U B U C will be?
• At a software company, skilled workers have been hired for a project. Out of 75 candidates, 48 of them were software engineer; 35 of them were hardware engineer; 42 of them were network engineer; 18 of them had skills in all three jobs and all of them had skills in at least one of these jobs. How many candidates were hired who were skilled in exactly 2 jobs?
• A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as                
• A drawer contains 12 red and 12 blue socks, all unmatched. A person takes socks out at random in the dark. How many socks must he take out to be sure that he has at least two blue socks?
• Amit must choose a seven-digit PIN number and each digit can be chosen from 0 to 9. How many different possible PIN numbers can Amit choose?
• Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.