MTHS

© All Rights Reserved

5 views

MTHS

© All Rights Reserved

- Appendices for AAAI’10 Submission Number 746: A
- Machine Problem 5-8
- 60173
- MITRES_6_007S11_hw19
- Advanced problems
- Test 5 Math
- g8m5l6- comparing linear functions and graphs 2
- cpds lab pgms list
- Math Funtions
- Neigbor Data Cluster 6
- 2d LSI Systems
- Intro Hwk Worksheet.pdf
- Optimization Theory Exercise 2.29(2)
- mech300_chap7
- Matlab Codes
- Analysis Verification
- 1383600861_827__AppPgrI_Hwk2_StrProgr
- Pop Quiz Objective
- 1
- Ejercicios Espacios Vectoriales

You are on page 1of 6

SOR201

1.

110SOR201(2002)

Solutions to Examples 1

i.e.

P(A B) = P(A) P(A B).

[complementarity rule]

= 1 P(A) P(B) + P(A B).

[addition law]

(iii) P(exactly one of A, B occurs) = P((A B) (A B))

= P(A B) + P(A B)

[m.e. events: axiom 3]

= P(A) P(A B) + P(B) P(B A) [using part (i) result]

= P(A) + P(B) 2P(A B).

[from part (i)]

(iv) P(A B) P(A)P(B) = P(A) P(A B) P(A)P(B)

= P(A)[1 P(B)] P(A B)

[(complementarity rule]

= P(A)P(B) P(A B).

The second result follows from symmetry: alternatively, using the first result,

P(A B) P(A)P(B) = P(B A) P(B)P(A)

= P(B)P(A) P(B A)

= P(A)P(B) P(A B).

To prove the third result:

P(A B) P(A)P(B) = P(A) + P(B) P(A B) P(A)P(B)[addn. law]

= 1 P(A) + 1 P(B) P(A B)

(1 P(A))(1 P(B)) [complementarity]

= 1 P(A)P(B) P(A B)

[after cancellation]

= P(A B) P(A)P(B).

[complementarity]

2.

(i)

P(

n

S

Ai ) = 1 P

i=1

=1P

Ai

i=1

n

T

Ai

n

T

Ai

Ai

n

S

i=1

P(

n

T

i=1

Ai ) = 1 P

=1P

i=1

n

S

i=1

[complementarity rule]

.

[complementarity rule]

/continued overleaf

page 2

110SOR201(2002)

P(A1 A2 ) = P(A1 ) + P(A2 ) P(A1 A2 )

[addition law]

6 P(A1 ) + P(A2 ),

[by axiom P() > 0]

(1)

the result holds for n = 2.

Now suppose that it holds for n = m (> 2), i.e. that

P(A1 ... Am ) 6

m

X

P(Ai ).

(2)

i=1

Then

P([A1 ... Am ] Am+1 ) 6 P(A1 ... Am ) + P(Am+1 )

m

X

P(Ai ) + P(Am+1 )

6

=

i=1

m+1

X

[using (1)]

[using (2)]

P(Ai ),

i=1

i.e. the result holds for n = m + 1. So by induction it holds for all n > 2.

[Note: this result concerns one side of the Bonferroni inequality ((1.17a) in

lecture notes): for the other side, see Qn. 6 below.]

(b) We have that

P(

n

T

Ai ) = 1 P(

i=1

n

S

Ai )

P(Ai )

i=1

> 1

n

X

i=1

= 1

=

n

X

n

X

{1 P(Ai )}

[complementarity]

i=1

P(Ai ) (n 1).

i=1

3.

(i) (a) List total sample space and count favourable outcomes

Outcome = (a, b, c), where a is the floor at which A gets out, etc.

A

1

1

1

1

1

1

1

1

1

B

1

1

1

2

2

2

3

3

3

C

1

2

3

1

2

3*

1

2*

3

A

2

2

2

2

2

2

2

2

2

B

1

1

1

2

2

2

3

3

3

C

1

2

3*

1

2

3

1*

2

3

A

3

3

3

3

3

3

3

3

3

B

1

1

1

2

2

2

3

2

2

C

1

2*

3

1*

2

3

1

2

2

So

P(one person gets out at each floor) = 6/27 = 2/9

(since the outcomes are equally likely).

/continued overleaf

page 3

110SOR201(2002)

The favourable outcomes are the arrangements of 1,2,3: there are 3! = 6 such

arrangements.

Total number of outcomes= 3 3 3 = 27.

So required probability = 6/27 = 2/9.

(ii) From lecture notes (page 11):

p = (1 a)(1 2a)...(1 (n 1)a),

So

loge p =

n1

X

where a = 1/365.

loge (1 ra).

r=1

n1

n1

X

X

n(n 1)

n(n 1)

So loge p

ra = a

r=

a=

.

2

730

r=1

r=1

For n = 30:

loge p

30 29

= 1.1918,

730

so p 0.3037.

(The exact value is p = 0.294. )

20

4.

(a)

P(Ai ) =

2

2

18

2

20

4

Q

Q

Pair i

2

43

3

=

= .

20 19

95

18 others

2

Q

Q

4

By symmetry this result holds for i = 1, ..., 10.

20

For i 6= j :

P(Ai Aj ) =

2

2

2

2

20

4

16

0

1

=

.

4845

Q

Q

2

2

0

Q

Q

Q

4

Again by symmetry this result holds for i, j = 1, ..., 10; i 6= j.

Also P(Ai Aj Ak ) = 0, i 6= j 6= k;

P(Ai Aj Ak Al ) = 0; i 6= j 6= k 6= l etc.

Then

P(at least one pair) = P(A1 A2 A10 )

10

X

X

P(Ai )

P(Ai Aj )

=

16i<j610

i=1

3

= 10

95

10

2

1

99

=

0.31.

4845

323

/continued overleaf

page 4

110SOR201(2002)

of one from each of 4 different

10 4

pairs. The number of such selections

is

2 . The total number of possible

4

20

(equally likely) selections is 4 . So

10 4

2

224

.

P(no pair) = 420 =

323

4

224

99

=

(as in (a)).

323

323

(c) To find P(exactly

one pair): the one pair can be chosen in 10 ways, and the other 2

9 2

shoes in 2 2 ways. So

10 92 22

96

=

P(exactly one pair) =

.

20

323

4

So P(at least one pair) = 1

Ai : dinosaur i not found in purchase of 6 packets (i = 1, 2, 3).

The required probability is

P(A1 A2 A3 ) = 1 P(A1 A2 A3 )

= 1 P(A1 A2 A3 ).

Now

P(A1 A2 A3 ) =

3

X

P(Ai )

P(Ai Aj ) + P(A1 A2 A3 ),

16i<j63

i=1

where

6

4

,

P(Ai ) =

5

444444

555555

6

3

,

P(Ai Aj ) =

5

6

2

P(A1 A2 A3 ) =

.

5

So the required probability is

i 6= j

6

6 6

4

3

2

13

+3

.

5

5

5

6. The result is true (as an equality) for n = 2 (by the addition law).

Assume that it is true for n = m(> 2), i.e. that

P(A1 Am ) >

m

X

i=1

P(Ai )

P(Ai Aj ).

()

16i<j6m

Then

P([A1 Am ] Am+1 ) = P(A1 Am ) + P(Am+1 ) P([A1 Am ] Am+1 ).

/continued overleaf

page 5

110SOR201(2002)

The first term is developed using (*); we can write the third term as P( (Ai Am+1 ))

i=1

and then use the result in Qn. 2(ii)(a) above. Finally we obtain

P(A1 Am+1 ) >

=

m

X

i=1

m+1

X

P(Ai )

P(Ai Aj ) + P(Am+1 )

16i<j6m

P(Ai )

m

X

P(Ai Am+1 )

i=1

P(Ai Aj ),

16i<j6m+1

i=1

i.e. the result is true for n = m + 1. So by induction it is true for all n > 2.

7. Listing the outcomes in which no cup is placed on a saucer of the same colour:

Saucer:

Y Y

G G

Cup:

B B G G Y Y

G G Y Y B B

B G Y G B Y

B G Y G Y B

B G G Y B Y

B G G Y Y B

G B Y G B Y

G B Y G Y B

G B G Y B Y

G B G Y Y B

There are 10 favourable outcomes altogether.

Total number of arrangements of cups on saucers is

6!

= 90.

2!2!2!

1

10

= .

90

9

(Solution of this problem by means of the generalized addition law is difficult.)

8. First consider matches on a particular set of k cards. The probability that there are no

matches on any of the other (n k) cards is

11+

1

1

(1)nk

++

2! 3!

(n k)!

()

(from result in Lectures applied to (n k) cards.) Now there are (n k)! ways of

arranging the (n k) cards, so the number

of arrangements which yield no matches

n

is () (n k)!. But also there are k possible selections of the k matching cards.

So the number of arrangements of all n cards in which there are exactly k matches is

n

(n k)! (). The required probability is then obtained by dividing this by n!, the

k

total number of arrangements, giving

1

(1)nk

1

11+ ++

/k!

2! 3!

(n k)!

For large n this is approximately e1 /k!. The values

e1 /k! ,

k = 0, 1, ...

[The above argument is more succinctly expressed using conditional probabilities

(discussed in the next chapter of the lecture notes).]

page 6

110SOR201(2002)

Then

P(at least one player does not win a game) = P(A1 An )

n

X

X

=

P(Ai )

+ + (1)

Now

P(Ai Aj )

16i<j6n

n+1

i=1

P(A1 An ).

& player i doesnt win game 2

& player i doesnt win game 3

...................................

&

playerir doesnt win game n)

n1

,

i = 1, ..., n.

=

n

(n1).(n1)....(n1)

n.n....n

n1

n1

( n )....( n )]

or product of probabilities:

Similarly

P(Ai Aj ) =

and so on.

n2

n

r

i 6= j

Finally P(A1 An ) = 0.

So required probability is

r

r

r

r

n2

n3

1

n

n

n

n1

n

+

+ (1)

.

n

2

3

n1

n

n

n

n

10. Let Ai : couple i seated together.

1 P(A1 An ) = 1

n

X

P(Ai )+

i=1

++

P(Ai1 Ai2 )

16i1 <i2 6n

(1)n P(A1 A2

An ).

There are (2n)! equally likely seatings. Consider a typical term P(Ai1 Aik ) in the

k th summation. Regard as k entities the k couples who are are seated together. There are

(2n 2k) other people, i.e. (2n k) entities in all. Number of (linear) arrangements

is (2n k)! But also each couple can be seated in 2 ways. So the total number of

seatings with k specified couples together is 2k (2n k)! So

P(Ai1 Aik ) =

2k (2n k)!

(2n)!

n 2!(2n 1)!

n 2!(2n 2)!

n!

n n

1

+

+ (1)

.

2n

(2n)!

(2n)!

(2n)!

1

2

n

For n = 4 this is

1

48

16

3

2

1

12

42 64

+

+

=11+

+

= .

8

87 676 8765

7 21 105

35

- Appendices for AAAI’10 Submission Number 746: AUploaded byanonymousaaaiauthor
- Machine Problem 5-8Uploaded byJan Abanes-Dating
- 60173Uploaded byContinuing Education at the University of Vermont
- MITRES_6_007S11_hw19Uploaded byxabihdez05
- Advanced problemsUploaded byCharlie Pinedo
- Test 5 MathUploaded byBagus Ali Fikri
- g8m5l6- comparing linear functions and graphs 2Uploaded byapi-276774049
- cpds lab pgms listUploaded byPraveen Rao
- Math FuntionsUploaded byChien Ling Liu
- Neigbor Data Cluster 6Uploaded byHumayun Kabir
- 2d LSI SystemsUploaded byelamaran_vlsi
- Intro Hwk Worksheet.pdfUploaded byHilary
- Optimization Theory Exercise 2.29(2)Uploaded byoveboncc2284
- mech300_chap7Uploaded byBigJ
- Matlab CodesUploaded byetayhailu
- Analysis VerificationUploaded byMatthew Wee
- 1383600861_827__AppPgrI_Hwk2_StrProgrUploaded byPaul Renato Montero
- Pop Quiz ObjectiveUploaded byNK28
- 1Uploaded byKhushbu Tandon
- Ejercicios Espacios VectorialesUploaded byIvan
- Timus SourcesUploaded byGansukh Batjargal
- 5_2017_02_28!06_29_47_PMUploaded bysurya
- two way coef-1Uploaded byKim Limuel Tabago Gomez
- contoh soalUploaded byRizka Soleha
- lagrange.pdfUploaded byem01803257
- Feigenbaum Major AccomplishmentsUploaded bychrisfitzpat
- optimization.xlsUploaded byMohit Rajai
- Series de FourierUploaded bySantiago Paul Pilaquinga
- Engineering OptimizationUploaded byLele Zhao
- Civil 17 Batch.pdfUploaded byAreeba

- pcaLectureShort_6ppUploaded byCarl Wells
- 2 Square Factorial ExptUploaded byAmit Kumar
- QuestionnaireUploaded byAmit Kumar
- Lecture1-Module1-Anova-1.pdfUploaded byAmit Kumar
- Real VariablesUploaded byEdy Eko Santoso
- Physics syllabusUploaded byDeepakSingh
- syl_msc_stats.pdfUploaded byAmit Kumar
- Chap9Uploaded byvivekverma390
- Quiz3 MTH417 SolutionUploaded byAmit Kumar
- pawan_pr1Uploaded byAmit Kumar
- UntitledUploaded byAmit Kumar
- ass3Uploaded byAmit Kumar
- ass1Uploaded byAmit Kumar
- aerodynamics-for-engineers-bertin-solutions-manual.pdfUploaded byAmit Kumar
- Problem 7Uploaded byAmit Kumar

- UMUploaded byManideep Narakula
- new appUploaded byapi-403786940
- Oxygen Plant ManualUploaded bymahaveen
- Inkscape Tutorial for Beginners: How to Make a Yoga Classes FlyerUploaded byRenee Liverpool
- 9781587204258_sim_labUploaded byaqil_shamsi
- 2013 RAMS Determining Right Sample SizeUploaded byMemoona Shees
- 7 Occena vs MarquezUploaded byToni Calsado
- Chapter 2 - Effects of Accident & Accident CausationUploaded byizzuddin_4
- The 10 Best Women’s Education and Empowerment Institutes in India 2018Uploaded bytheknowledgereview
- research project paperUploaded byapi-397340482
- Pass4sure Exin EX0-105Uploaded bychotaajay
- social media strategy proposalUploaded byapi-281580930
- Chapter CHAPTER 28 Recommended ClausesUploaded byKwalar King
- LogUploaded byGanesh GP
- Raymarine Chartplotter 425Uploaded byMauricio Hurtado
- Surge ProtectionUploaded byalkaisar_198637
- PI User GuideUploaded byGanapathi
- Case Study of a Drainage BasinUploaded byGrace Kamau
- Top 100 STN 2010 TDUploaded byFloryn Fjh
- NIA vs CA Case DigestUploaded byjamesmhv
- Gujarat University PhD Admissions-2015 Rules Regulations and OrdinancesUploaded byDinesh Shah
- E CommerceUploaded byMintu Choudhury
- 4432154131Uploaded bysibtain_rajpoo
- SVAR ReviewerUploaded byAndré Gil Item Sabanal
- D4972Uploaded byMilton Jose Pino
- ICSA Firewall TestingUploaded byGeorge Zecheru
- JSE Regulatory Review Consultation Paper FINAL_19 SeptemberUploaded byBusinessTech
- EnantiomerosUploaded byJames Willan Calva
- ProjectUploaded byvasajamun
- FinalUploaded byRachna Iyer