Understanding Two Dice Events: EF, E U F, FG, EF^(c), and EFG

  • Thread starter Thread starter knowLittle
  • Start date Start date
  • Tags Tags
    Dice Events
AI Thread Summary
The discussion revolves around understanding the events related to two dice being thrown, specifically focusing on the definitions of EF, E U F, FG, EF^(c), and EFG. The user expresses confusion about why the outcome (1,1) is not included in the event E U F, which represents the union of the events where the sum is odd or at least one die shows a 1. It is clarified that (1,1) indeed satisfies the conditions for E U F, contradicting the book's solution. The user also criticizes the textbook for containing errors, which complicates learning probability concepts. Overall, the conversation highlights the importance of accurate resources in understanding probability.
knowLittle
Messages
307
Reaction score
3
I have a problem that is suppose to be very basic, but it's hard for me to understand.

Problem:
Two dice are thrown. Let E be the event that the sum of the dice is odd; let F be the event that at least one of the dice lands on 1; and let G be the event that the sum is 5. Describe the events EF, E U F, FG, EF^(c), and EFG.
Note that EF means intersection of the two.

My problem is in E U F.
Why isn't it (1,1) considered? Doesn't it fulfill the requirements of either the sum of dice is odd OR at least one dice lands on a 1?
Namely, that one dice lands on a 1.


The solution from the book is:
S={ (1,2), (1,4), (1,6) ,( 2,1 ) , (4,1) , (6,1) , (2,3) ,(2,5) ,(3,2) , (3,4) ,(3,6 ) ,(4,3) , (4,5) , (5,2) , (5,4) , (5,6) , (6,3),(6,5) } Thank you.
 
Last edited:
Physics news on Phys.org
(1,1) is in E\cup F. If the book says it is not, then the book is wrong.
 
Thank you. It's very annoying to have books like this. My Introduction to Probability and Statistics is filled with typos. It's horrible to be introduced to Probability with textbooks like this.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
22
Views
4K
Replies
2
Views
3K
Replies
1
Views
3K
Back
Top