# Thread: probability::tree diagram ::argent H.W

1. ## probability::tree diagram ::argent H.W

John tries to repair a broken toy.Each time he tries the probability that he succeeds is 0.8 .Each time he fails he tries again...

(a) Copy and complete the tree diagram below:

1st try
0.8 ــــــــــــــ succeeds
0.2 ــــــــــــــ fails

2nd try

.... ــــــــــــــ succeeds
.... ــــــــــــــ fails

3rd try

.... ــــــــــــــ succeeds
.... ــــــــــــــ fails

(b) Find the probability that, to succeed, it takes

(i) exactly two tries,

(ii) one,two or three tries,

(iii) exactly five tries

(c) Write down a formula for the probability that he has not succeeded after n tries.

------------------

plz help me in these problem

and i wanna da answer with da steps plz......

2. Originally Posted by elmysterio
John tries to repair a broken toy.Each time he tries the probability that he succeeds is 0.8 .Each time he fails he tries again...

(a) Copy and complete the tree diagram below:

1st try
0.8 ــــــــــــــ succeeds
0.2 ــــــــــــــ fails

2nd try

.... ــــــــــــــ succeeds
.... ــــــــــــــ fails

3rd try

.... ــــــــــــــ succeeds
.... ــــــــــــــ fails

(b) Find the probability that, to succeed, it takes

(i) exactly two tries,

(ii) one,two or three tries,

(iii) exactly five tries

(c) Write down a formula for the probability that he has not succeeded after n tries.

------------------

plz help me in these problem

and i wanna da answer with da steps plz......
With a tree diagram you multiply along the branches and add down each event. As a check the sum of each event must be 1.

Let A=success and B=failure

i)The chance of taking two goes is BA = 0.2*0.8

ii) The chance of taking 1, 2 or 3 tries is 1 minus the chance of not succeeding in three goes. (1-0.2^3)

iii) Same as i) but with 4 failures instead of 1 (0.2^4 * 0.8)

B) The chance of not succeeding means he fails each time which will be 0.2^n for n tries

3. thank u so so much

i needed to solve this problem

thx alot
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9430528283119202, "perplexity": 8721.18188996153}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917120338.97/warc/CC-MAIN-20170423031200-00510-ip-10-145-167-34.ec2.internal.warc.gz"}