Topic 3 Sets, Logic and Probability Joanna Livinalli and Evelyn Anderson.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

TRUTH TABLES Section 1.3.
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Truth Tables Presented by: Tutorial Services The Math Center.
IB Math Studies – Topic 3. IB Course Guide Description.
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
IB Math Studies – Topic 3. IB Course Guide Description.
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
Discrete Maths 2. Propositional Logic Objective
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Warm-Up 1. What is Benford’s Law?
MATH 102 Contemporary Math S. Rook
Normal Forms, Tautology and Satisfiability 2/3/121.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Conditional Statements
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
How do I show that two compound propositions are logically equivalent?
Review Given p: Today is Thursday q: Tomorrow is Friday
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.
LOGIC.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Logical Form and Logical Equivalence M Logical Form Example 1 If the syntax is faulty or execution results in division by zero, then the program.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
UNIT 01 – LESSON 10 - LOGIC ESSENTIAL QUESTION HOW DO YOU USE LOGICAL REASONING TO PROVE STATEMENTS ARE TRUE? SCHOLARS WILL DETERMINE TRUTH VALUES OF NEGATIONS,
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
Ms. Andrejko 2-2 Logic. Real World Legally Blonde.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
Assign Yourself and Do Now Thursday, January 10, 2013.
Reasoning and Proof Chapter Use Inductive Reasoning Conjecture- an unproven statement based on an observation Inductive reasoning- finding a pattern.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
1 What Is Probability?. 2 To discuss probability, let’s begin by defining some terms. An experiment is a process, such as tossing a coin, that gives definite.
Chapter 1 Logic and proofs
Material Taken From: Mathematics for the international student Mathematical Studies SL Mal Coad, Glen Whiffen, John Owen, Robert Haese, Sandra Haese and.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
PROBABILITY Probability Concepts
Chapter 4 Probability Concepts
MODULE 15 - PROBABILITY.
Chapter 8 Logic Topics
PROBABILITY Vocabulary: Theory Book
Presentation transcript:

Topic 3 Sets, Logic and Probability Joanna Livinalli and Evelyn Anderson

IB Course Guide description

Topic 3.1 and 3.3: Set Theory Set Notation SymbolDefinitionMeans… Uuniversal setAll the elements given in a question  is an element ofIs an element or member of the set  is not an element ofIs not an element or member of the set ‘Complementopposite of the set  the empty setan empty set with no members/elements  IntersectionAn overlap; only the elements in both sets.  Union A marriage; all the elements in each set, including all elements that are in both.  SubsetA smaller set contained wholly within a larger set n(A) Number of elements inside set A

Topic 3.2: Venn diagrams and sets Intersection UnionSubset Mutually exclusive events

(A  B)’ A’  B (A  B)’ A’  B

Example Problem A group of 40 IB students were surveyed about the languages they have chosen at IB: E = English, F = French, S = Spanish. 3 students did not study any of the languages above. 2 students study all three languages 8 study English and French 10 study English and Spanish 6 study French and Spanish 13 students study French 28 students study English (a) Draw a Venn diagram to illustrate the data above. On your diagram write the number in each set. (b) How many students study only Spanish? (c) On your diagram shade (E  F)’, the students who do not study English or French.

Check your answers (a) (b) There 4 students who do Spanish only (c) Shade everything but the union of E and F (where the 6 is)

Topic 3.4 – 3.7 : Logic and truth tables Propositions – A statement that can be either true or false. For example, the baby is a girl. Negation – A proposition that has become negative: For example, the baby is not Australian. Be careful that it is a negative and not the opposite. The symbol used is ¬. Conjunction – the word ‘and’ used to join two conjunctions together. For example, the baby is a girl and Australian. The symbol used is . p¬p TF FT pq p  q TTT TFF FTF FFF

Disjunction – the word ‘or’ used to join the conjunctions together. For example, the baby is a girl or Australian. The symbol used is . Exclusive Disjunction - is true when only one of the propositions is true. The word ‘or’ is used again, but in this case you must write “or, but not both”. The symbol used is  pq p  q TTT TFT FTT FFF pq TTF TFT FTT FFF

Implication – Using the words if …… then with two propositions. For example: If you do not sleep tonight then you will be tired tomorrow. The symbol used for implication is . Equivalence – If two propositions are linked with “…if and only if…”. Then it is an equivalence. p  q is the same as p  q and q  p. Or using notation: (p  q) = (p  q)  (q  p) pq pqpq TTT TFF FTT FFT pq pqpq TTT TFF FTF FFT

p: My shoes are too small q: My feet hurt – Implication: p  q. If my shoes are too small, then my feet hurt. – Converse: q  p. If my feet hurt, then my shoes are too small. – Inverse:  p   q. If my shoes are not too small, then my feet do not hurt. – Contrapositive:  q   p. If my feet do not hurt, then my shoes are not too small.

Tautology – a statement that produces True (T) throughout the column of the truth table. Column (?) would be a tautology Contradiction – a statement that produces False (F) throughout the column of a truth table. Column (?) Would be a contradiction pq? TTT TFT FTT FFT pq? TTF TFF FTF FFF

Example Problem PQr p  q  (p  q)  (p  q)  r TTT TTF TFT TFF FTT FTF FFT FFF p: Andrea studies IB English. q: Andrea studies IB Spanish. r: The school offers at least 2 IB languages. (a)Write the following in logical form. If Andrea studies English and Spanish, then the school offers at least 2 languages. (b) Write the following statement in words: ¬ p  ¬ q (c) Copy and complete the truth table below. (d) Is  (p  q)  r a tautology, contradiction or neither?

Check your answers (a) (p  q)  r (b) If Andrea does not study English then she will not study Spanish (c) (d) Neither a tautology nor a contradiction pqr p  q  (p  q)  (p  q)  r TTTTFT TTFTFT TFTFTT TFFFTF FTTFTT FTFFTF FFTFTT FFFFTF

Probability Probability ranges between 0 and 1 or 0 and 100%

Terminology Trials—times experiment is repeated Outcomes—different possible results Frequency—the number of times an outcome is repeated Relative frequency—the number of times an outcome is repeated in terms of a fraction or percentage

Example Problem In assigning 32 assignments, Ms. Boswell has noticed that Maxine has done her homework 12 times. Describe the trials, outcomes, frequency, and relative frequency of this situation. Note: The greater the number of trials, the more reliable the information becomes, and the closer the relative frequency will be as a predictor for future outcomes.

3.8 Equally Likely Events If the probability of an event A given by P(A)=n(a)/n(U) Probability of a complementary event is P(A’)=1-P(A) Example: In a coin, there are two possible outcomes—heads or tails. So the probability of it not being tails is equal to 1-(the probability of it being heads, or.5), which is also.5.

Venn Diagrams There are 48 students. 22 watch Dragon Ball Z, 15 watch Pokémon, 20 watch Naruto, and 12 watch none. 5 3 What is the probability of (DUP)’? DUP=(30/48)=(5/8) (DUP)’=1-(5/8) or (3/8) What is the probability that the student watches Dragon Ball Z? (22/48) or (11/22) What is the probability the student watches Pokémon and Naruto, but not Dragon Ball Z? (3/48) What is the probability the student watches Naruto or Pokemon, but not both? ((7+6)+(3+5))/48 or 21/48=(7/16)

What is the probability the coin will fall on heads three times in a row? (Tree Diagrams) Heads (1/2) Tails (1/2) Heads (1/2) Tails (1/2) Heads (1/2) (1/2)*(1/2)*(1/2)=(1/8) Number of possibilities for a particular outcome/Number of total possible outcomes

If there are 5 red marbles and 2 blue marbles in a bag, what is the probability that when picking one out, one will be blue and the other red? (the marbles are not replaced when removed) Red (5/7) Blue (2/7) Blue (2/6) Red (4/6) Blue (1/6) Red (5/6) ((5/7)*(2/6))+((2/7)+(5/6)) =(10/21)

Table of Outcomes Example: Rolling two pairs of dice

Mutually Exclusive Events A situation where only one outcome is possible (i.e., if the coin is heads, it cannot be tails also.) A die is tossed. What is the probability the shown is 4? What is the probability that it is 4 or 3? What is the probability that it is 4 and 3? What is the probability that the dice will roll a 4, and when tossing a coin at the same time, it will be heads?