Probability, Random Variables, And Random Processes 4th Edition Hwei P. Hsu all chapter instant download
Probability, Random Variables, And Random Processes 4th Edition Hwei P. Hsu all chapter instant download
com
https://ebookmeta.com/product/probability-random-variables-
and-random-processes-4th-edition-hwei-p-hsu/
OR CLICK BUTTON
DOWNLOAD NOW
https://ebookmeta.com/product/schaum-s-outline-of-probability-random-
variables-and-random-processes-4th-edition-hwei-p-hsu/
ebookmeta.com
https://ebookmeta.com/product/probability-and-random-processes-4th-
edition-geoffrey-r-grimmett/
ebookmeta.com
https://ebookmeta.com/product/probability-random-variables-and-data-
analytics-with-engineering-applications-p-mohana-shankar/
ebookmeta.com
https://ebookmeta.com/product/business-in-latin-america-strategic-
opportunities-and-risks-2nd-edition-fernando-robles/
ebookmeta.com
Soulless 1st Edition Shyla Colt
https://ebookmeta.com/product/soulless-1st-edition-shyla-colt/
ebookmeta.com
https://ebookmeta.com/product/science-of-sport-swimming-1st-edition-
alexander-marinof/
ebookmeta.com
https://ebookmeta.com/product/contemporary-methods-and-austrian-
economics-1st-edition-daniel-j-damico/
ebookmeta.com
https://ebookmeta.com/product/isometric-pixel-art-guide-1st-edition-
rhys-davies/
ebookmeta.com
https://ebookmeta.com/product/dad-i-love-you-so-much-seqouia-
childrens-publishing/
ebookmeta.com
Sydney In Love An Instalove Travel Vacation Romance
Destination HEA Book 1 1st Edition Pearl Ava
https://ebookmeta.com/product/sydney-in-love-an-instalove-travel-
vacation-romance-destination-hea-book-1-1st-edition-pearl-ava/
ebookmeta.com
00_Hsu_Probability_FM_Schaum's design 31/08/19 4:11 PM Page i
Probability,
Random Variables,
and Random Processes
00_Hsu_Probability_FM_Schaum's design 31/08/19 4:11 PM Page ii
00_Hsu_Probability_FM_Schaum's design 31/08/19 4:11 PM Page iii
Probability,
Random Variables,
and Random Processes
Fourth Edition
Copyright © 2020, 2013, 2009, 1998 by McGraw-Hill Education. All rights reserved. Except as permitted under the United States
Copyright Act of 1976, no part of this publication may be reproduced or distributed in any form or by any means, or stored in a
database or retrieval system, without the prior written permission of the publisher.
ISBN: 978-1-26-045382-9
MHID: 1-26-045382-0
The material in this eBook also appears in the print version of this title: ISBN: 978-1-26-045381-2,
MHID: 1-26-045381-2.
All trademarks are trademarks of their respective owners. Rather than put a trademark symbol after every occurrence of a trade-
marked name, we use names in an editorial fashion only, and to the benefit of the trademark owner, with no intention of infringe-
ment of the trademark. Where such designations appear in this book, they have been printed with initial caps.
McGraw-Hill Education eBooks are available at special quantity discounts to use as premiums and sales promotions or for use in
corporate training programs. To contact a representative, please visit the Contact Us page at www.mhprofessional.com.
McGraw-Hill Education, the McGraw-Hill Education logo, Schaum’s, and related trade dress are trademarks or registered trade-
marks of McGraw-Hill Education and/or its affiliates in the United States and other countries and may not be used without written
permission. All other trademarks are the property of their respective owners. McGraw-Hill Education is not associated with any
product or vendor mentioned in this book.
TERMS OF USE
This is a copyrighted work and McGraw-Hill Education and its licensors reserve all rights in and to the work. Use of this work
is subject to these terms. Except as permitted under the Copyright Act of 1976 and the right to store and retrieve one copy of the
work, you may not decompile, disassemble, reverse engineer, reproduce, modify, create derivative works based upon, transmit,
distribute, disseminate, sell, publish or sublicense the work or any part of it without McGraw-Hill Education’s prior consent. You
may use the work for your own noncommercial and personal use; any other use of the work is strictly prohibited. Your right to
use the work may be terminated if you fail to comply with these terms.
THE WORK IS PROVIDED “AS IS.” McGRAW-HILL EDUCATION AND ITS LICENSORS MAKE NO GUARANTEES
OR WARRANTIES AS TO THE ACCURACY, ADEQUACY OR COMPLETENESS OF OR RESULTS TO BE OBTAINED
FROM USING THE WORK, INCLUDING ANY INFORMATION THAT CAN BE ACCESSED THROUGH THE WORK VIA
HYPERLINK OR OTHERWISE, AND EXPRESSLY DISCLAIM ANY WARRANTY, EXPRESS OR IMPLIED, INCLUD-
ING BUT NOT LIMITED TO IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR
PURPOSE. McGraw-Hill Education and its licensors do not warrant or guarantee that the functions contained in the work will
meet your requirements or that its operation will be uninterrupted or error free. Neither McGraw-Hill Education nor its licensors
shall be liable to you or anyone else for any inaccuracy, error or omission, regardless of cause, in the work or for any damages
resulting therefrom. McGraw-Hill Education has no responsibility for the content of any information accessed through the work.
Under no circumstances shall McGraw-Hill Education and/or its licensors be liable for any indirect, incidental, special, punitive,
consequential or similar damages that result from the use of or inability to use the work, even if any of them has been advised of
the possibility of such damages. This limitation of liability shall apply to any claim or cause whatsoever whether such claim or
cause arises in contract, tort or otherwise.
00_Hsu_Probability_FM_Schaum's design 31/08/19 4:11 PM Page v
HWEI P. HSU
Shannondell at Valley Forge, Audubon, Pennsylvania
v
00_Hsu_Probability_FM_Schaum's design 31/08/19 4:11 PM Page vi
HWEI P. HSU
Montville, New Jersey
vi
00_Hsu_Probability_FM_Schaum's design 31/08/19 4:11 PM Page vii
Contents
CHAPTER 1 Probability 1
1.1 Introduction 1
1.2 Sample Space and Events 1
1.3 Algebra of Sets 2
1.4 Probability Space 6
1.5 Equally Likely Events 9
1.6 Conditional Probability 10
1.7 Total Probability 10
1.8 Independent Events 11
Solved Problems 12
vii
00_Hsu_Probability_FM_Schaum's design 31/08/19 4:11 PM Page viii
viii Contents
Contents ix
INDEX 417
*The laptop icon next to an exercise indicates that the exercise is also available as a video with step-by-step
instructions. These videos are available on the Schaums.com website by following the instructions on the inside
front cover.
00_Hsu_Probability_FM_Schaum's design 31/08/19 4:11 PM Page x
01_Hsu_Probability 8/31/19 3:55 PM Page 1
CHAPTER 1
Probability
1.1 Introduction
The study of probability stems from the analysis of certain games of chance, and it has found applications in
most branches of science and engineering. In this chapter the basic concepts of probability theory are presented.
B. Sample Space:
The set of all possible outcomes of a random experiment is called the sample space (or universal set), and it is
denoted by S. An element in S is called a sample point. Each outcome of a random experiment corresponds to a
sample point.
EXAMPLE 1.1 Find the sample space for the experiment of tossing a coin (a) once and (b) twice.
S {H, T}
(b) There are four possible outcomes. They are pairs of heads and tails. Thus:
EXAMPLE 1.2 Find the sample space for the experiment of tossing a coin repeatedly and of counting the number
of tosses required until the first head appears.
Clearly all possible outcomes for this experiment are the terms of the sequence 1, 2, 3, … Thus:
S {1, 2, 3, …}
2 CHAPTER 1 Probability
EXAMPLE 1.3 Find the sample space for the experiment of measuring (in hours) the lifetime of a transistor.
Clearly all possible outcomes are all nonnegative real numbers. That is,
S {τ : 0 τ ∞}
C. Events:
Since we have identified a sample space S as the set of all possible outcomes of a random experiment, we will
review some set notations in the following.
If ζ is an element of S (or belongs to S), then we write
ζ僆S
ζ∉S
A⊂B
if every element of A is also an element of B. Any subset of the sample space S is called an event. A sample point
of S is often referred to as an elementary event. Note that the sample space S is the subset of itself: that is, S ⊂
S. Since S is the set of all possible outcomes, it is often called the certain event.
EXAMPLE 1.4 Consider the experiment of Example 1.2. Let A be the event that the number of tosses required
until the first head appears is even. Let B be the event that the number of tosses required until the first head appears
is odd. Let C be the event that the number of tosses required until the first head appears is less than 5. Express
events A, B, and C.
A {2, 4, 6, …}
B {1, 3, 5, …}
C {1, 2, 3, 4}
1. Equality:
Two sets A and B are equal, denoted A B, if and only if A ⊂ B and B ⊂ A.
2. Complementation:
–
Suppose A ⊂ S. The complement of set A, denoted A, is the set containing all elements in S but not in A.
–
A {ζ : ζ ∈ S and ζ ∉ A}
01_Hsu_Probability 8/31/19 3:55 PM Page 3
CHAPTER 1 Probability 3
3. Union:
The union of sets A and B, denoted A ∪ B, is the set containing all elements in either A or B or both.
A ∪ B {ζ : ζ ∈ A or ζ ∈ B}
4. Intersection:
The intersection of sets A and B, denoted A ∩ B, is the set containing all elements in both A and B.
A ∩ B { ζ : ζ ∈ A and ζ ∈ B}
5. Difference:
The difference of sets A and B, denoted A\ B, is the set containing all elements in A but not in B.
A\ B {ζ : ζ ∈ A and ζ ∉ B}
–
Note that A\ B A ∩ B .
6. Symmetrical Difference:
The symmetrical difference of sets A and B, denoted A Δ B, is the set of all elements that are in A or B but not
in both.
A Δ B { ζ: ζ ∈ A or ζ ∈ B and ζ ∉ A ∩ B}
– –
Note that A Δ B (A ∩ B ) ∪ (A ∩ B) (A\ B) ∪ (B \ A).
7. Null Set:
The set containing no element is called the null set, denoted ∅. Note that
–
∅S
8. Disjoint Sets:
Two sets A and B are called disjoint or mutually exclusive if they contain no common element, that is,
if A ∩ B ∅.
The definitions of the union and intersection of two sets can be extended to any finite number of sets as
follows:
n
∪ Ai A1 ∪ A2 ∪ ∪ An
i 1
{ζ : ζ ∈ A1 or ζ ∈ A2 or ζ ∈ An }
n
∩ Ai A1 ∩ A2 ∩ ∩ An
i 1
{ζ : ζ ∈ A1 and ζ ∈ A2 and ζ ∈ An }
∞
∪ Ai A1 ∪ A2 ∪ A3 ∪
i 1
∞
∩ Ai A1 ∩ A2 ∩ A3 ∩
i 1
01_Hsu_Probability 8/31/19 3:55 PM Page 4
4 CHAPTER 1 Probability
In our definition of event, we state that every subset of S is an event, including S and the null set ∅. Then
n
∪ Ai the event that at least one of the Ai occurreed
i 1
n
∩ Ai the event that all of the Ai occurred
i 1
9. Partition of S :
k
If Ai ∩ Aj ∅ for i ≠ j and ∪ Ai S , then the collection {Ai ; 1 i k} is said to form a partition of S.
i 1
10. Size of Set:
When sets are countable, the size (or cardinality) of set A, denoted ⎪ A ⎪, is the number of elements contained
in A. When sets have a finite number of elements, it is easy to see that size has the following properties:
Note that the property (iv) can be easily seen if A and B are subsets of a line with length ⎪A⎪ and ⎪B⎪, respectively.
C A B {(a, b): a ∈ A, b ∈ B}
EXAMPLE 1.5 Let A {a1, a2, a3} and B {b1, b2}. Then
C A B {(a1, b1), (a1, b2), (a2, b1), (a2, b2), (a3, b1), (a3, b2)}
D B A {(b1, a1), (b1, a2), (b1, a3), (b2, a1), (b2, a2), (b2, a3)}
B. Venn Diagram:
A graphical representation that is very useful for illustrating set operation is the Venn diagram. For instance, in
the three Venn diagrams shown in Fig. 1-1, the shaded areas represent, respectively, the events A ∪ B, A ∩ B,
– –
and A. The Venn diagram in Fig. 1-2(a) indicates that B 傺 A, and the event A ∩ B A\ B is shown as the shaded
area. In Fig. 1-2(b), the shaded area represents the event A Δ B.
Other documents randomly have
different content
containing a part of this work or any other work associated with
Project Gutenberg™.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must,
at no additional cost, fee or expense to the user, provide a copy,
a means of exporting a copy, or a means of obtaining a copy
upon request, of the work in its original “Plain Vanilla ASCII” or
other form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.
• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to the
Project Gutenberg Literary Archive Foundation. Royalty payments
must be paid within 60 days following each date on which you
prepare (or are legally required to prepare) your periodic tax
returns. Royalty payments should be clearly marked as such and
sent to the Project Gutenberg Literary Archive Foundation at the
address specified in Section 4, “Information about donations to
the Project Gutenberg Literary Archive Foundation.”
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.F.
Most people start at our website which has the main PG search
facility: www.gutenberg.org.