Activity 2-5: What are you implying? www.carom-maths.co.uk.

Slides:



Advertisements
Similar presentations
1a)I can identify the hypothesis and the conclusion of a conditional 1b)I can determine if a conditional is true or false 1c)I can write the converse of.
Advertisements

1/15/ : Truth and Validity in Logical Arguments Expectations: L3.2.1: Know and use the terms of basic logic L3.3.3: Explain the difference between.
Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
PROOF BY CONTRADICTION
Copyright © Cengage Learning. All rights reserved.
Activity 2-3: Pearl Tilings
Logic 3 Tautological Implications and Tautological Equivalences
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
Lecture ,3.3 Sequences & Summations Proof by Induction.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
NEXT PAGE. ML RADIE M suobi ro n III-1 Kapitolyo High School Batch NEXT PAGE.
Biconditional Statements and Definitions 2-4
2.3 Biconditionals and Definitions
Warm Up: For the given statement, determine the converse, inverse, and contrapositive. Assuming the given statement is true, determine if each new statement.
Algorithm Design and Analysis (ADA)
Methods of Proof & Proof Strategies
Simplest Fractions for Whole Numbers. Look at this picture. How many parts are in each group? Yes, 4. What’s the bottom number for the fraction shown.
Discrete Maths Objective to introduce mathematical induction through examples , Semester 2, Mathematical Induction 1.
Activity 2-17: Zeroes of a Recurrence Relation
Activity 2-20: Pearl Tilings
Activity 2-2: Mapping a set to itself
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Activity 2-4: Tangles You need four people for this, A, B, C and D, and two ropes, starting like this:
Activity 2-1: The Game of Life
Activity 1-9: Siders My local café features this pleasing motif in its flooring. I made a few copies and cut out the shapes…
Fun with fives I am learning to work out my times six, seven, and eight tables from my times five tables.
Discrete Maths: Induction/1 1 Discrete Maths Objective – –to introduce mathematical induction through examples , Semester
Activity 1-7: The Overlapping Circles
Warm Up Write a conditional statement from each of the following. 1. The intersection of two lines is a point. 2. An odd number is one more than a multiple.
Activity 2-10: Inversion There are some transformations of the plane we know all about: Reflection Rotation Enlargement.
Holt Geometry 2-4 Biconditional Statements and Definitions 2-4 Biconditional Statements and Definitions Holt Geometry Warm Up Warm Up Lesson Presentation.
Activity 1-19: The Propositional Calculus
Hoppers. 11 Create a circle – call out 1,2 or 3 11 is eliminated How can we adapt the task?
Scale Factor and the relationship to area and volume GLE SPI:
21C: Cyclic quadrilaterals. What is a cyclic quadrilateral?  A cyclic quadrilateral is a 4 sided shape that has all four corners on the circumference.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
The Four Colour Theorem
Activity 2-13: Triangle Centres
Activity 1-8: Repunits 111, 11111, , are all repunits. They have received a lot of attention down the.
Success Criteria:  I can write good definitions  I can identify good definitions Today 1.Do Now 2.Check HW #13 3.Lesson HW # 14 Do Now Write a.
Solving Linear Equations. Example 1 It’s obvious what the answer is. However, we need to start with the basics and work our way up because we need to.
Activity 1-13: Descent This problem is due to Euler. Task: Show that the equation x 3 + 2y 3 + 4z 3 = 0 has the sole solution (0,
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
Activity 2-11: Quadratic Reciprocity
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2012 CSE
Welcome to Math 6 Our subject for today is… Divisibility.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Activity 1-12 : Multiple-free sets
Warm Up Week 6 1) write an equation that passes through the given point and y-intercept. ( 2, 1 ) ; b = 5.
Section 2-2 Biconditionals and Definitions. What is a biconditional When both the conditional and converse are true the statement can be written as: If.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Entry Task 1. Translate the triangle with vertices A(2, –1), B(4, 3), and C(–5, 4) along the vector. 2. Given the points (-3,2) and (6,-1) reflect them.
Geometry Chapter 2: Reasoning and Introduction to Proof We can do this dude!
Inductive Reasoning Section 1.2. Objectives: Use inductive reasoning to make conjectures.
2-1 Vocabulary conditional statement hypothesis/conclusion
Biconditional Statements and Definitions 2-4
The rectangle is split into 4 equal parts
Biconditional Statements and Definitions 2-4
Objective Students will… Write and analyze biconditional statements.
Biconditional Statements and Definitions 2-4
Biconditional Statements and Definitions 2-4
Here are four triangles. What do all of these triangles have in common
Biconditional Statements and Definitions 2-4
Biconditional Statements and Definitions 2-4
Biconditional Statements and Definitions 2-2
Biconditional Statements and Definitions 2-4
Biconditional Statements and Definitions 2-4
Objective Write and analyze biconditional statements.
Biconditional Statements and Definitions 2-4
Calculating Probabilities
Presentation transcript:

Activity 2-5: What are you implying?

You are given these four cards: Each of these cards has a letter on one side and a digit on the other. This rule may or may not be true: if a card has a vowel on one side, then it has an even number on the other. Which cards must you turn to check the rule for these cards?

This is a famous question that has tested people’s grasp of logic for years. Most people pick Card with A, correctly. Many pick Card with 2 in addition. The right answer is to pick Card with 7 in addition to the A. But… if the other side of the Card with 2 is a vowel, that’s fine. And if the other side of the Card with 2 is a consonant, that’s fine too! If the other side of the 7 is a vowel, there IS a problem.

In the statements below, a, n and m are positive integers 1. a is even 2. a 2 is even 3. a can be written as 3n a can be written as 6m + 1 Consider these four assertions:

If we make a card with one statement on the front and one on the back, there are six possible cards we could make.

Define A I B to signify ‘A implies B’, Define A RO B to signify ‘A rules out B’, and A NINRO B to mean ‘A neither implies nor rules out B’. Task: how many different types of card do we have with these definitions? We can see that the statements for Card 1 mean that this is of type (I, I): each side implies the other.

We conclude we have four different types of card: 1 is (I, I), 3 and 5 are (RO, RO), 2 and 4 are (NINRO, NINRO), while 6 is (I, NINRO).

Are these the only possible types of card? Yes, since if A RO B, then B RO A, so (RO,I) and RO, NINRO) are impossible cards to produce. Can we be sure that if A RO B, then B RO A? We can use a logical tautology called MODUS TOLLENS: if A implies B, then (not B) implies (not A). Now A RO B means A I (not B). If A I (not B), then by Modus Tollens, not (not B) implies (not A). Thus B implies (not A), that is B RO A.

What mistake do people make with the four-card problem? They assume that A I B can be reversed to B I A. So Vowel I Even reverses to (Not Even) I (Not Vowel), which shows we need to pick the 7 card. if A implies B, then (not B) implies (not A). In fact, A I B CAN be reversed, but to (not B) I (not A) – Modus Tollens. Let’s try a variation on our initial four-card problem.

You are given four cards below. Each has a plant on one side and an animal on the other. Task: you are given the rule: if one side shows a tree, the other side is not a panda. Which cards do you need to turn over to check the rule? This time the obvious reversal works, for ‘Tree RO Panda’ is the same as ‘Panda RO Tree’: you DO need to turn over the two cards named in the question.

Given two circles, there are four ways that they can lie in relation to each other. Task: if you had to assign (I, I), (RO, RO), (NINRO, NINRO), and (I, NINRO) to these, how would you do it?

Let’s invent a new word, DONRO, standing for DOes Not Rule Out. Task: is it true that if A DONRO B and B DONRO C, then A DONRO C? Pick an example to illustrate your answer. A: x = 2 B: x 2 = 4 C: x =  2 A: The shape S is a red quadrilateral B: The shape S is a rectangle C: The shape S is a blue quadrilateral A: ab is even B: b is less than a C: ab is odd

Carom is written by Jonny Griffiths, With thanks to: The Open University and my teachers on the Researching Mathematical Learning course. Mathematics In School for publishing my original article on this subject.