 My Math Forum How do I find the least number tickets from a jar if the number isn't given?

 Probability and Statistics Basic Probability and Statistics Math Forum

 November 7th, 2019, 12:45 AM #1 Senior Member   Joined: Jun 2017 From: Lima, Peru Posts: 178 Thanks: 5 Math Focus: Calculus How do I find the least number tickets from a jar if the number isn't given? The problem is as follows: In a jar there are tickets of the same size and color which have a number printed from $10$ to $\left(4n+10\right),\, n\geq 2,\,n \in \mathbb{N}$ .How many tickets could be taken out at random from the jar the least possible to be certain that among the tickets extracted there are $3$ having an odd number printed?. The alternatives given in my book are as follows: $\begin{array}{ll} 1.&2n+1\\ 2.&2n+2\\ 3.&2n+3\\ 4.&2n+4\\ \end{array}$ I'm confused about this problem. What I believe the procedure to solve this is to think about the worst case and add to that the elements requested so we can claim that we have what it is being asked. This task could be much easier if I had known the number of elements explicitly let's say a number belonging to $n \in \mathbb{N}$, but having it defined by a constant not indicated by a formula. The next thing which I attempted to do was that the worst case would be taking out all even numbers from $10$ to $\left(4n+10\right),\, n\geq 2,\,n \in \mathbb{N}$ and adding to that $3$ as then we can claim we have three odds. But since the number of elements is not given explicitly I could obtain them by subtracting the total from the number of all odds and adding $3$ to that. Thus I counted (considering not making the [fencepost error](https://en.wikipedia.org/wiki/Off-by...encepost_error)). Total: $\left(4n+10\right)-10+1=4n+1$ Total of all odds: $11+(n-1)2-11+1=2n-1$ Therefore the total needed to be extrated from that jar would be: $4n+1-(2n-1)+3= 2n+5$ But this answer doesn't appear within any of the alternatives. What could be the part where I got it wrong?. Can somebody help me with this?.  November 7th, 2019, 06:12 AM #2 Senior Member   Joined: Jun 2019 From: USA Posts: 376 Thanks: 202 Consider $n=2$. The tickets are 10, 11, 12, 13, 14, 15, 16, 17, 18. $2n$ are odd, $2n+1$ are even. (OBO, the scourge of beginner and intermediate programmers everywhere) Tags find, jar, number, tickets Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode Similar Threads Thread Thread Starter Forum Replies Last Post thanhvinh0906 Advanced Statistics 3 August 30th, 2017 05:27 PM Shen Elementary Math 2 June 5th, 2014 08:50 AM Omnispark Number Theory 25 November 28th, 2013 08:01 PM MATHEMATICIAN Number Theory 15 August 26th, 2013 11:16 PM jsonliu Algebra 3 May 18th, 2010 06:01 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top      