Question

Counting and Pigeonhole Principle (a). A set of four different integers is chosen at random between 1 and 200 (inclusive). Ho

0 0
Add a comment Improve this question Transcribed image text
Answer #1

(a). the total possible number of ways to choose 4 object out of 200 objects is

\binom{200}{4} = 200!/(196!4!)= 64684950.

(b). if we choose n integers from 1 to 200 and if n is less then or equals to 100 then there is always possibility that all the choosen n integers are even because there are 100 odd integers between 1 and 200, if we choose 101 or 102 integers then there is possibility that out of 101 or 102 choosen integers 100 integers are odd but if we choose 103 integers then since there are only 100 odd integers between 1 and 200 then 3 integers out of choosen 103 integers must be even so 103 is the answer.

(C) if we choose n number of integers from 1 to 200 and if n is less then or equals to 191 then there is always possibility that all those choosen n integers are greater then or equals to 10 so in this scenerio it's not possible to choose two integers such that there sum is 20 out of n integers as all such n integers will be greater then or ewuals to 10 so sum of any two of them will always exceed 20 ,now if we choose 192 integers between 1 and 200 then there will always exist two integers such that sum of them is 20 as we have choosen 192 integers only 8 integers between 1 and 200 are not choosen so only atmost 8 integer between 1 to 9 are not choosen for particular suppose that 8 integers from 1 to 9 are not choosen so exactly1 integer from 1 to 9 is choosen let's say it is 'a' then 20-a is also choosen and a+(20-a)=20. similarly if less then 8 integer between 1 and 9 are not choosen we can show that there exist an integer 'a' between 1 to 9 such that a and 20-a both are choosen ,so 192 is the answer.

(d). there are 29 integers between integers from 1 to 200 ,so we must choose atleast (200-29)+1 = 172 integers to make sure that atleast one of them have digit 5.

Add a comment
Know the answer?
Add Answer to:
Counting and Pigeonhole Principle (a). A set of four different integers is chosen at random between...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Show your work, please 1. Counting and Pigeonhole Principle (a). A set of four different integers...

    Show your work, please 1. Counting and Pigeonhole Principle (a). A set of four different integers is chosen at random between 1 and 200 (inclusive). How many different outcomes are possible? (b). How many different integers between 1 and 200 (inclusive) must be chosen to be sure that at least 3 of them are even? (C). How many different integers between 1 and 200 (inclusive) mu be chosen to be sure that at least 2 of them add up to...

  • Given 11 different integers from 1 to 20. Prove that at least two of them are exactly 5 apart. pigeonhole principle.

    Given 11 different integers from 1 to 20. Prove that at least two of them are exactly 5 apart. pigeonhole principle.

  • Question 1 (a) How many positive integers are there between 1000 and 4999, inclusive? (b) How...

    Question 1 (a) How many positive integers are there between 1000 and 4999, inclusive? (b) How many positive integers between 1000 and 4999, inclusive: 1. have no repeated digit? 2. have at least one repeated digit? 3. have at most two repeated digits? Note that by 'one repeated digit' we mean that there is a digit that appears at least twice (eg, 1123 has one repeated digit). Similarly, by two repeated digits we mean a digit that appears at least...

  • Question 9: Let S be a set consisting of 19 two-digit integers. Thus, each element of...

    Question 9: Let S be a set consisting of 19 two-digit integers. Thus, each element of S belongs to the set 10, 11,...,99) Use the Pigeonhole Principle to prove that this set S contains two distinct elements r and y, such that the sum of the two digits of r is equal to the sum of the two digits of y. Question 10: Let S be a set consisting of 9 people. Every person r in S has an age...

  • Please send me solutions for the above five questions. The questions are based on Pigeonhole Principle. 3. A shop co...

    Please send me solutions for the above five questions. The questions are based on Pigeonhole Principle. 3. A shop contains twelve samples of read shirts, seven samples of white shirts, and N samples of blue shirts. Suppose that the smallest K such that choosing K samples from the collection guarantees that you have six samples of the same color of shirt is K-15. What is N? 4. Show that among any n1 positive integers not exceeding 2nthere must be integer...

  • 1- If four alphabets are to be chosen from L, M, N, O, P, Q such...

    1- If four alphabets are to be chosen from L, M, N, O, P, Q such that repetition is not allowed then in how many ways it can be done? 2- Sally must choose a 5-digit PIN. Each digit can be chosen from 0 to 9 and the same digit can be used repeatedly. How many possible PIN numbers can be created? 3- Jenny has 8 tops, 5 bottoms, 2 belts, and 2 bracelets. Assuming that everything matches, how many...

  • This program will use the Random class to generate random temperatures (integers) between some minimum (inclusive)...

    This program will use the Random class to generate random temperatures (integers) between some minimum (inclusive) and some maximum (inclusive) values. You will need to calculate the minimum and maximum given a starting temperature integer and a possible change in temperature integer. (1) Copy the following method stub into your Temperature Predictor class and complete it according to the specifications described in the header comments. * Generates a random temperature (int) within a range when given the current temperature *...

  • Let Gh be the collection of all graphs with the vertex set V = {1, 2,...

    Let Gh be the collection of all graphs with the vertex set V = {1, 2, 3, 4, 5, 6, 7, 8}. Suppose we are given a list of 32 graphs G1, G2, . . . G32, each in Gh. (a) The following argument is wrong. Identify the error. There are = 28 two-element subsets of V . Given any graph G ∈ Gh, each edge e ∈ E(G) is a two-element subset of V . So there are 28...

  • Sets and Counting: Problem Set 2 Directions 1. Solve the following problems. Hand write your solutions and explanat...

    Sets and Counting: Problem Set 2 Directions 1. Solve the following problems. Hand write your solutions and explanations on your own paper. Do not write answers on this page. 2. Show your work AND explain your reasoning using complcte English sentences. Explanations must directly follow the solution for each part of the problem. You must write your name on the top right of the paper you turn in. 4. You must write the title of this problem set on the...

  • Write a java recursive method digitMatch that takes two nonnegative integers as parameters and that returns...

    Write a java recursive method digitMatch that takes two nonnegative integers as parameters and that returns the number of digits that match between them. Two digits match if they are equal and have the same relative position starting from the end of the number (i.e., starting with the ones digit). In other words, the method should compare the last digits of each number, the second-to-last digits of each number, the third-to-last digits of each number, and so forth, counting how...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT