Question: Why is it so difficult for a student to write a coherent argument?

Slides:

Advertisements

Similar presentations

The Seven Rules About Taking Career Tests

Advertisements

With examples from Number Theory

PROOF BY CONTRADICTION

Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett

Two puzzles about omnipotence

Direct Proof and Counterexample II Lecture 12 Section 3.2 Thu, Feb 9, 2006.

Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.

Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari

Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.

Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.

Strong Induction 2/27/121. Induction Rule 2/27/122.

Index FAQ Limits of Sequences of Real Numbers Sequences of Real Numbers Limits through Rigorous Definitions The Squeeze Theorem Using the Squeeze Theorem.

2.3 Deductive Reasoning and Angle Relationships. Traditional.

Writing Boot Camp! Pt. 1 Introductions, Thesis Statements, and Topic Sentences AY! This is General C with PART 1 of your GOSH DANG Writing Bootcamp. Today.

Propositional Logic.

Conditional Statements

Three-Pronged Thesis Statements

Accelerated 10 English 1. Read 2. Details 3. Topic – Significant to the Text 4. Return to the details. o Details are combined/interpreted to determine.

Holt Geometry 2-1 Using Inductive Reasoning to Make Conjectures Welcome to our Unit on Logic. Over the next three days, you will be learning the basics.

Introduction to Proofs

College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.

CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.

Chapter 2.1 Common Core G.CO.9, G.CO.10 & G.CO.11 Prove theorems about lines, angles, triangles and parallelograms. Objective – To use inductive reasoning.

Proofs1 Elementary Discrete Mathematics Jim Skon.

Methods of Proofs PREDICATE LOGIC The “Quantifiers” and are known as predicate quantifiers. " means for all and means there exists. Example 1: If we.

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

Let’s review for the final! No points, just review.

Theorems and conjectures

9.4 Mathematical Induction

Type Safety Kangwon National University 임현승 Programming Languages.

Perfecting Generalities.  Challenge- ◦ Due to cultural differences- reflecting the proper level of formality ◦ Always show respect, but level of.

Applying Deductive Reasoning Section 2.3. Essential Question How do you construct a logical argument?

Solve Absolute Value Inequalities © 2011 The Enlightened Elephant.

Subject and Verb Identification: Notes and Practice ELA

Opinions and Commonplace Assertions VS. Facts

1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,

2.1 Conditional Statements Ms. Kelly Fall Standards/Objectives: Students will learn and apply geometric concepts. Objectives: Recognize the hypothesis.

(Finite) Mathematical Induction In our first lesson on sequences and series, you were told that How can we be certain that this will be true for all counting.

The Literary Essay Pay Attention well... For this is the format you must follow for your Essay & your Exam...

Lesson 2 – 5 Postulates and Paragraph Proofs

Holt Geometry 2-1 Using Inductive Reasoning to Make Conjectures Welcome to our Unit on Logic. Over the next three days, you will be learning the basics.

Graphing Linear Equations From the beginning. What is a Linear Equation? A linear equation is an equation whose graph is a LINE. Linear Not Linear.

GIVING A PRESENTATION. ORAL PRESENTATION The Big Rule Tell them what you're going to tell them. Tell them. Tell them what you told them.

2.3 Methods of Proof.

1 CMSC 341 Math Review. 2 Exponents Identities (X A ) B = X AB X A * X B = X A+B X A / X B = X A-B X A + X B  X A+B.

Copyright © Cengage Learning. All rights reserved. Sequences and Series.

The content of this lesson will be on number (not shape). Writing proofs can be very difficult, especially for those people who rush maths (lazy people)

Introduction to Proofs

Writing Tips Pre AP Social Studies. Organize your thoughts!!! Even the greatest writers plan. Take a minute to plan your answer… outline it, make a mind.

Strategies for Essay Tests. Preparing for the test Know what is expected of you. What content will be covered? How many questions will be on the test?

CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2012 CSE

1 Formal Proofs. 2 Deductive Proofs From the given statement(s) to a conclusion statement (what we want to prove) Logical progression by direct implications.

More Proofs. REVIEW The Rule of Assumption: A Assumption is the easiest rule to learn. It says at any stage in the derivation, we may write down any.

Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)

CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.

Analyze Conditional Statements Objectives: 1.To write a conditional statement in if-then form 2.To write the negation, converse, inverse, and contrapositive.

Chapter 2, Section 1 Conditional Statements. Conditional Statement Also know as an “If-then” statement. If it’s Monday, then I will go to school. Hypothesis:

INDUCTION David Kauchak CS52 – Spring to-1 multiplexer control control_negate and_out1 input0 input1 and_out2 output.

Solve Absolute Value Inequalities © 2011 The Enlightened Elephant.

Mathematical Induction. The Principle of Mathematical Induction Let S n be a statement involving the positive integer n. If 1.S 1 is true, and 2.the truth.

Proof Techniques CS160/CS122 Rosen: 1.5, 1.6, 1.7.

 Real Madrid.  Contents:  About the team.  Facts.

BaSIC Math Reviews.

Section 2.1 Proof Techniques Introduce proof techniques: o Exhaustive Proof: to prove all possible cases, Only if it is about a.

Reading Master Student Map

MAT 3100 Introduction to Proof

Proof by Induction L.O. All pupils understand proof by induction

Rubric (Four 5-point scale=20 points)

11.4 Mathematical Induction

Presentation transcript:

Question: Why is it so difficult for a student to write a coherent argument?

I try to address two issues with my students: – Understanding Language – Parsing Logic

Rules for Beginners 1.Always phrase the thing you are proving as an “If…then” sentence. When you cannot, be content with one that starts, “There…exists.” 2.Always start a proof with the word “Assume” and then copy the hypothesis. Start with a new “Assume” every time you hit an “and.” 3.To prove, “There exists x such that…” Write down “x = “ even if you cannot finish the thought.

Facts about Beginners They will never do any of this.

The Concept of the “Minitheorem.” After every assumption you make, you have reduced your objective to a minitheorem. Ask yourself, “What do I need to prove now?” Revert back to the rules for beginners.

Example: Prove that if x and y are real numbers with x<y, then for all natural numbers n, there are real numbers z 1, z 2, z 3,… z n so that for all j=1,2,…n x < z 1 < z 2 < z 3 <… < z n <y

Assume x and y are real numbers. Assume x<y. Minitheorem: For all natural numbers n, there are real numbers z 1, z 2, z 3,… z n so that for all j=1,2,…n x < z 1 < z 2 < z 3 <… < z n <y

Assume x and y are real numbers. Assume x<y. Proof by Induction: Minitheorem: There are real numbers z 1, z 2, z 3,… z n so that for all j=1,2,…n x < z 1 < z 2 < z 3 <… < z n <y

Assume x and y are real numbers. Assume x<y. Proof by Induction: Base Step: For n=1, there are real numbers z 1, z 2, z 3,… z n, so that x < z 1 < z 2 < z 3 <… < z n <y. Inductive Step: If for n, there are real numbers z 1, z 2, z 3,… z n so that x < z 1 < z 2 < z 3 <… < z n <y, then for n+1, there are real numbers z 1, z 2, z 3,… z n+1 so that x < z 1 < z 2 < z 3 <… < z n+1 <y.

Assume x and y are real numbers. Assume x<y. Proof by Induction: Base Step: For n=1, there is a real numbers z 1 so that x < z 1 <y. Proof: Let z 1 =……..

Assume x and y are real numbers. Assume x<y. Inductive Step: If for n, there are real numbers z 1, z 2, z 3,… z n so that x < z 1 < z 2 < z 3 <… < z n <y, then for n+1, there are real numbers z 1, z 2, z 3,… z n+1 so that x < z 1 < z 2 < z 3 <… < z n+1 <y.

Assume x and y are real numbers. Assume x<y. Proof by Induction: Base Step Inductive step: Minitheorem: If there are real numbers z 1, z 2, z 3,… z n so that x < z 1 < z 2 < z 3 <… < z n <y, then for there are real numbers z 1, z 2, z 3,… z n+1 so that x < z 1 < z 2 < z 3 <… < z n+1 <y. Proof: Assume there are real numbers z 1, z 2, z 3,… z n so that x < z 1 < z 2 < z 3 <… < z n <y. Let z n+1 =