My Math Forum  

Go Back   My Math Forum > High School Math Forum > Probability and Statistics

Probability and Statistics Basic Probability and Statistics Math Forum


Thanks Tree5Thanks
Reply
 
LinkBack Thread Tools Display Modes
February 3rd, 2019, 07:38 AM   #1
Newbie
 
Joined: Feb 2019
From: United states

Posts: 8
Thanks: 0

Post Solve deer hunting probability

A hunter knows that a deer is hidden in one of the two near by bushes, the probability of its being hidden in bush-I being 4/5. The hunter having a rifle containing 10 bullets decides to fire them all at bush-I or II. It is known that each shot may hit one of the two bushes, independently of the other with probability 1/2. Number of bullets must he fire on bush-I to hit the animal with maximum probability is ________. (Assume that the bullet hitting the bush also hits the animal).

Please help me as how to approach this problem.

Last edited by skipjack; February 4th, 2019 at 04:35 AM.
Jayant98 is offline  
 
February 3rd, 2019, 09:15 AM   #2
Senior Member
 
Joined: May 2016
From: USA

Posts: 1,306
Thanks: 549

I suggest that you copy the problem exactly as it is written. if it makes no difference which bush he aims at, the problem does not seem to make much sense.
JeffM1 is offline  
February 3rd, 2019, 09:28 AM   #3
Newbie
 
Joined: Feb 2019
From: United states

Posts: 8
Thanks: 0

I have posted as it is. I can give you the link also if you want.
Jayant98 is offline  
February 3rd, 2019, 10:02 AM   #4
Senior Member
 
Joined: May 2016
From: USA

Posts: 1,306
Thanks: 549

Quote:
Originally Posted by Jayant98 View Post
I have posted as it is. I can give you the link also if you want.
Well I am not too sure I want to galivant off to some unknown site. It says that you are in the US. Why are you using a site that has such terrible English, or is it written in some other language that you have translated from?
Thanks from Denis
JeffM1 is offline  
February 3rd, 2019, 11:44 AM   #5
Newbie
 
Joined: Feb 2019
From: United states

Posts: 8
Thanks: 0

Quote:
Originally Posted by JeffM1 View Post
Well I am not too sure I want to galivant off to some unknown site. It says that you are in the US. Why are you using a site that has such terrible English, or is it written in some other language that you have translated from?
What can I say to this? I had downloaded this assignment so as to practice the questions from Probabs and then I got this.
Jayant98 is offline  
February 3rd, 2019, 01:24 PM   #6
Math Team
 
Joined: Oct 2011
From: Ottawa Ontario, Canada

Posts: 13,978
Thanks: 994

Home, home on the range,
Where the deer and the antelope play
Denis is offline  
February 3rd, 2019, 06:30 PM   #7
Senior Member
 
Joined: May 2016
From: USA

Posts: 1,306
Thanks: 549

Quote:
Originally Posted by Jayant98 View Post
What can I say to this? I had downloaded this assignment so as to practice the questions from Probabs and then I got this.
I am sorry. We DO like to help. But we must understand the question before we can give sensible help.

What is PROBABS? I was not able to find a probabs.com, probab.com,
probabs.edu, probab.edu, probabs.edu, or a probab.org. This did not increase my desire to visit the site.

Given that your question seems to have been written by someone who barely knows English, perhaps there is a more reliable site to use. (I am fully aware that knowledge of English is not a prerequisite to being a great mathematician, but knowledge of English is a prerequisite to asking intelligible questions and giving intelligible explanations in English.)

Have you looked at Khan Academy for example?
JeffM1 is offline  
February 3rd, 2019, 10:39 PM   #8
Senior Member
 
romsek's Avatar
 
Joined: Sep 2015
From: USA

Posts: 2,314
Thanks: 1230

I think I understand what the problem is trying to say.

You've got 10 arrows. You're going to shoot all 10.
$n$ at bush 1 and $10-n$ at bush 2

$P_{kill}(n) = \dfrac{4}{5}\left(1-\left(\dfrac 1 2\right)^n\right) +
\dfrac{1}{5}\left(1-\left(\dfrac 1 2\right)^{10-n}\right)$

You can maximize this the usual way via the first derivative, or as there are only 11 values you can just list them and find the maximum by inspection.

It's seen that $p_{kill}(6) = 0.975$ is the maximum
Thanks from JeffM1 and Jayant98
romsek is online now  
February 4th, 2019, 04:32 AM   #9
Global Moderator
 
Joined: Dec 2006

Posts: 20,298
Thanks: 1971

A web search finds this problem on various web sites, with much the same poor English on all of them.
Thanks from Jayant98
skipjack is offline  
February 7th, 2019, 03:38 AM   #10
Newbie
 
Joined: Feb 2019
From: United states

Posts: 8
Thanks: 0

Quote:
Originally Posted by romsek View Post
I think I understand what the problem is trying to say.

You've got 10 arrows. You're going to shoot all 10.
$n$ at bush 1 and $10-n$ at bush 2

$P_{kill}(n) = \dfrac{4}{5}\left(1-\left(\dfrac 1 2\right)^n\right) +
\dfrac{1}{5}\left(1-\left(\dfrac 1 2\right)^{10-n}\right)$

You can maximize this the usual way via the first derivative, or as there are only 11 values you can just list them and find the maximum by inspection.

It's seen that $p_{kill}(6) = 0.975$ is the maximum
Why did you do (1-(0.5)^n)? Shouldn't it be (0.5)^n only for getting the 1st bush shot perfectly? And similarly for second bush also.

Last edited by Jayant98; February 7th, 2019 at 03:39 AM. Reason: Added more details
Jayant98 is offline  
Reply

  My Math Forum > High School Math Forum > Probability and Statistics

Tags
approach, deer, deer-hunt, hunt, proabability, problem



Thread Tools
Display Modes


Similar Threads
Thread Thread Starter Forum Replies Last Post
The annual increase I I in the deer population in a national park is ............... GIjoefan1976 Algebra 4 September 26th, 2017 03:23 PM
How do you approach this word problem? davedave Elementary Math 3 November 25th, 2016 02:33 AM
How to approach this problem? alikim Elementary Math 6 June 10th, 2015 10:35 AM
chaos simulation - comet hunt Martin Hopf Applied Math 0 April 17th, 2015 01:28 PM
How to approach this problem JohnA Algebra 2 February 19th, 2012 10:29 AM





Copyright © 2019 My Math Forum. All rights reserved.