You are not logged in.
Try using the hypergeometric distribution. You have two groups of tickets, winning and losing.
How many ways can you select 0 winning and 4 losing tickets?
How many ways can you select 3 winning and 1 losing ticket?
Use those numbers divided by the total number of ways of selecting 4 out of 50 tickets and you've got your answer!
Very good Bobbym!
You never cease to amaze me.
Ok. Try this one...
This is a little challenging...
Prove
A real killer!
A man walks through a tunnel. Two thirds of the way through he sees a car heading for him. The car is moving at 75 mph. If he starts to run he can get to either end of the tunnel just as the car does. What is the speed in mph of the running man?
A says) Impossible! You have to know the distance the car is from the man.
B says) I don't think so, but I am unable to solve it.
C says) I solved it. It was easy. The man is moving at 25 mph.
D says) I agree with B. It can be solved but C's answer is wrong. But I can't prove it.What do you think?
Hello elliot60,
Welcome to the math forum!
Wait! I think I know what the problem is, we are thinking about two different problems. In the problem I posted the player is supposed to pick a box, that box becomes empty, and the player continues picking boxes, emptying them along the way until he reaches an empty box. You are thinking that the player picks a box, the situation starts all over again and the player picks again, so in theory the game could go on forever. Maybe I should be more clear next time!
Bobbym,
The 5 empty boxes divide the 10 boxes into 6 segments. So the average number of boxes with money until an empty box is reached is 10/6 = 5/3. The empty box is next, so we have 8/3 boxes to reach an empty box. I thought my answer was correct, but if you have wrote a simulation and done so correctly then I can't really argue with that.
No I didn't, so maybe your answer is correct.
Ok. Here's what I have...
BobbyM,
I have a different answer to #1.
Well, after reading your post I don't feel bad I couldn't solve it. I knew how to solve it when the probablilities are the same but when they are different it is very complicated. If you have come up with another method for solving this problem I'm sure that I and the other members would like to see it. Anyways here's a couple problems I made up myself. I'm fairly certain that I have the right answer but I'm not 100% certain. If I'm wrong I'm sure the other members will let me know!
1. You have 15 boxes. Five of them are empty. Ten of them have the following dollar amounts.
1, 5, 6, 7, 13, 14, 16, 17, 18, 25.
You keep opening boxes and you win whatever is in the box until you open an empty box, at which point you stop.
What is the average amount won by the player?
2. You have 3 boxes which contain $2, $3 and $5. You pick a box and win the dollar amount inside the box. Inside one of the three boxes along with the money is a piece of paper which has 'Play again' written on it. If the box you pick happens to contain the slip of paper, you get to play again with exactly the same conditions. If you don't get the box with the piece of paper you then stop.
What is the average amount won by the player?
Two die are thrown at once. The sample space is 2,3,4,5,6,7,8,9,10,11,12. How many times must this be done on average to get all eleven numbers?
I am amazed that somebody got the exact answer! Good job! I would really like to see the solution. I wracked my brain trying to figure it out.
Two die are thrown at once. The sample space is 2,3,4,5,6,7,8,9,10,11,12. How many times must this be done on average to get all eleven numbers?
I just got a new computer. But, I wrote a C++ program on my old computer to solve this and I got an answer of about
My compiler dates from 1992! I'm going to have to download a newer one from the Internet.
I can't see an easy way of getting the answer without computer help.
How did you go about getting your answer?
Well I got two equations...
Then it was just trial and error.
Yeah, I haven't posted in a while, I'm going to try to become more active on the forum.
A bunch of quarters, dimes , nickels and pennies has an average value of 14 cents. If a quarter is replaced by 25 pennies the average would drop to 7 cents. Or if a nickel was replaced by 5 pennies the average becomes 12 cents. What is the largest amount of nickels you can have?
Thank you for the interesting and challenging problems Bobbym.
Here's another one: problem #996
A sum of 35 integers is S. Two digits in one of the integers are interchanged and a new sum T is produced. Then the difference S - T is necessarily divisible by:
They think the answer is 11.
Take the sum of the first 35 counting numbers...(35*36)/2 = 630.
Now switch 31 into 13 and add again and you end up with 612.
630-612 = 18 which is divisible by 3 and not 11.
Thanks for verifying this BobbyM,
I wasn't sure if I was losing my mind or not.
Problem #1011 at projectEUREKA says:
"If the length of each side of a triangle is increased by 20%, then the area
of the triangle is increased by:"
Take a 3-4-5 triangle, increase each side by 20%
we get 3.6-4.8-6
which has an area of 8.64
8.64/6 = 1.44
I get 44% as the answer, but it says that's wrong.
It even says solution verified.
Thank You BobbyM!
Yeah, I've been working on this problem for about two months!
It is amazing that a simple game can have such complicated math associated with it.
I've finally completed my analysis of Four Card Poker. The difficult part was figuring out the probabilities for the dealer to wind up with various hands.
The player initially makes a bet on the Ante spot. After the player receives his cards, he can either fold his hand and lose his ante, or he can bet from one to three times the ante bet.
If the player's hand ties or beats the dealer's hand the player wins and gets paid 1-to-1 on both his ante and raise bet.
If the dealer's hand beats the player's hand, the player loses both his ante and raise bet.
If the player gets Three of a kind, Straight Flush, or Four of a kind, the player receives a bonus based on the Ante bet as follows:
Three of a kind pays 2-to-1
Straight Flush pays 20-to-1
Four of a kind pays 25-to-1
The bonus pays regardless of the dealer's hand.
The dealer receives six cards and the player receives five, giving the casino an edge.
Hands are ranked as follows:
Fouf of a kind
Straight flush
Three of a kind
Flush
Straight
Two pair
One pair
High card
The Ace can count both high and low in making the player's or dealer's hand.
Here are the various ways that the dealer can wind up with various hands:
(Just divide by
Four of a kind
Straight Flush
Three of a kind
Flush
Straight
Two pair
One pair
High card
The number of ways for the player to wind up with the hands are as follows:
Four of a kind
Straight Flush
Three of a kind
Flush
Straight
Two pair
One pair
High card
The best strategy for the player is to fold if he only has high card, bet 1x the ante for a pair of 2's through 9's, bet 3x the ante for a pair of 10's or higher.
We are now in a position to estimate the player's mathematical expectation.
In order to simplify the calculation, I ignored the situations where both the player and the dealer have the same hand.
High card
pair of 2's through pair of 9's
pair of 10's through Aces
Two pair
Straight
Flush
Three of a kind
Straight Flush
Four of a kind
Hello all!
I haven't posted in a while, but I've been working on a math problem and I'm kind of stuck. I wasn't sure whether to post this under Help! or not. I would like this to be a help/discussion. Anyways, I was at a casino and there is this game called four card poker. The player receives 5 cards from a standard 52 card deck and makes the best 4-card poker hand he can out of those 5 cards. The player also makes an initial 'ante' bet. The dealer receives 6 cards and makes the best 4-card poker hand out of those 6 cards. The extra card that the dealer receives is what gives the casino the advantage. Once the player receives his cards he can either fold and lose his 'ante' bet, or he can bet up to 3x his ante bet and continue against the dealer. If the player continues and wins, he gets paid 1-to-1 on both his ante bet and additional bet. It seems to me that the best strategy for the player would be to know which hand he receives that would give him a 50% or greater chance of winning. If his chances of winning are 50% or greater, then he should bet 3x his ante bet and continue, otherwise he should fold. Apparently there is a strategy that has been proposed by Stanley Ko in which he recommends...Raise 3x with pair of tens or higher...Raise 1x with a pair of twos to nines...fold all others. I really don't understand why somebody would raise 1x. So in order to figure out the best strategy for the player, we need to figure out the probability of the dealer winding up with various hands. Once I started doing the math, I began to realize that this is very, very complicated. Here's the ranking of the hands...
Four of a kind
Straight flush
Three of a kind
Flush
Straight (Ace counts both high and low)
Two pair
One pair
Nothing/High card
Here's what I have so far for the dealer.
These are the total number of ways for the dealer to receive these hands..
Four of a kind
Straight Flush
Three of a kind
Flush
Straight
Two pair
One pair
Nothing/High card
These total to 21,224,216, but they should total to _{52}C_6 = 20,358,520.
So I have nearly 1 million extra card combinations.
My mistake(s) is (are) probably in the high card/one pair/two pair totals since these are most complicated and difficult.
Hmmm...
I'm not sure why that's the answer. In step 3, we aren't counting A or B as being the umpire. We are only counting the remaining 4 people, none of whom are A or B.
We can also count the remaining 7 people in turn as being the umpire.
We put A on one team and B on the other team so we have...
I believe your problem lies in step 3. You have to take into account that any 1 of the remaining 4 people can be the umpire so it should be...
a) 5! = 120
b)
c)
d)
OK. I think you're right. My argument doesn't work because any natural number I come up with can have only a finite number of digits so it must be on my list of natural numbers. Any real number that doesn't end can't be on my list of pairing the natural numbers with the real numbers. I guess this is why Cantor paired up the numbers the way he did. It is very weird because we don't normally think of there being different 'sizes' of infinity.
If I select the new natural number 5832...
This number appears on your list of integers in the 5832th spot, so there is no contradiction: it is on your list.
Maybe I didn't make this clear enough, but the natural number 5832... is not the number 5832. The three little dots means it continues forever. So it is not listed in the 5832th spot.
There now seems to be a 1-to-1 correspondence between the natural numbers and the real numbers.
The real (actually, rational) number:
0.211111111111111111111111...
Would not appear on that list.
Actually, that real number can be paired with a natural number it is
...111111111111111111111112
Every time you add a 1 to the end of your real number you create a new real number, so I add a 1 to the front of my number to match it.