MAA PREP Workshop Valparaiso University June 4, 2003 Thoughts on Teaching Discrete Mathematics Susanna S. Epp DePaul University

Slides:



Advertisements
Similar presentations
Geometry Chapter 2 Terms.
Advertisements

Useful tricks in studying reading papers doing research writing papers publishing papers English e-manuscripts.
P.M van Hiele Mathematics Learning Theorist Rebecca Bonk Math 610 Fall 2009.
Elementary Number Theory and Methods of Proof
What’s wrong with this proof? If you figure it out, don’t call it out loud – let others ponder it as well. 1. Let a and b be non-zero such thata = b 2.
Proof Points Key ideas when proving mathematical ideas.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
1 The Role of Logic and Proof in Teaching Discrete Mathematics Summer Workshop on Discrete Mathematics Messiah College June 2006 Susanna S. Epp.
Copyright © Cengage Learning. All rights reserved.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
1 Nifty Examples in Discrete Mathematics: Introduction SIGCSE 2005 St. Louis, MO February 23, 2005 Susanna S. Epp.
Test Preparation Strategies
Copyright © Cengage Learning. All rights reserved.
Adapted from Discrete Math
Proof Methods.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Mathematical Problem Solving Math 6320 Summer 2006.
What is Gestalt? Wiki: Gestalt refers to a structure, configuration, or pattern of physical, biological, or psychological phenomena so integrated as to.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Fall 2010 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Discrete Mathematics, Part II CSE 2353 Fall 2007 Margaret H. Dunham Department of Computer Science and Engineering Southern Methodist University Some slides.
CSci 2011 Textbook ^Discrete Mathematics and Its Applications,  Rosen  6th Edition  McGraw Hill  2006.
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Overall, the article talked about the basic requirements a person who is interested in becoming an architect would need to meet, such as: – Math – Science.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Discrete Structures for Computing
Formal Models in AGI Research Pei Wang Temple University Philadelphia, USA.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
1.1 Introduction to Inductive and Deductive Reasoning
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
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.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
Chapter 2 Section 2-1: Conditional Statements
Lesson 1.7/1.8 Deductive Structure and Statements of Logic Objective: Recognize that geometry is based on deductive structure, identify undefined terms,
THE IMPORTANCE OF DISCRETE MATHEMATICS IN COMPUTER TECHNOLOGY.
Foundations of Discrete Mathematics Chapters 5 By Dr. Dalia M. Gil, Ph.D.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
What Place Does Philosophy Have in Teaching Mathematics? Preliminary report. Martin E Flashman Department of Mathematics Humboldt State University Arcata,
Introduction to Proofs. The use of Reasoning and Logic in proofs Inductive Reasoning- “reasoning from detailed facts to general principles” – Specific.
Discrete mathematics Kwon, Tae-kyoung
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
5 Lecture in math Predicates Induction Combinatorics.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Chapter 1 Logic and Proof.
Logic.
Chapter 7. Propositional and Predicate Logic
Introduction to Deductive Proofs
3. The Logic of Quantified Statements Summary
COMP 283 Discrete Structures
Direct Proof and Counterexample III: Divisibility
CSNB 143 Discrete Mathematical Structures
CHAPTER 1: LOGICS AND PROOF
Discrete Math (2) Haiming Chen Associate Professor, PhD
A Brief Summary for Exam 1
(1.4) An Introduction to Logic
Applied Discrete Mathematics Week 9: Integer Properties
Elementary Number Theory & Proofs
MAT 3100 Introduction to Proof
Copyright © Cengage Learning. All rights reserved.
CPSC 121: Models of Computation
Copyright © Cengage Learning. All rights reserved.
Foundations of Discrete Mathematics
CPSC 121: Models of Computation
Copyright © Cengage Learning. All rights reserved.
Presentation transcript:

MAA PREP Workshop Valparaiso University June 4, 2003 Thoughts on Teaching Discrete Mathematics Susanna S. Epp DePaul University

Plan of Talk Theme of a Discrete Math Course Syllabus Issues A Few Details

The mathematics profession as a whole has seriously underestimated the difficulty of teaching mathematics. Ramesh Gangolli MER Workshop May 31, 1991

Theme of a Discrete Math Course Message to the Math Thinking Group (January 2001) "Very few of my students had an intuitive feel for the equivalence between a statement and its contrapositive or realized that a statement can be true and its converse false. Most students did not understand what it means for an if-then statement to be false, and many also were inconsistent about taking negations of and and or statements. Large numbers used the words "neither-nor" incorrectly, and hardly any interpreted the phrases "only if" or "necessary" and "sufficient" according to their definitions in logic.

All aspects of the use of quantifiers were poorly understood, especially the negation of quantified statements and the interpretation of multiply quantified statements. Students neither were able to apply universal statements in abstract settings to draw conclusions about particular elements nor did they know what processes must be followed to establish the truth of universally (or even existentially) quantified statements. Specifically, the technique of showing that something is true in general by showing that it is true in a particular but arbitrarily chosen instance did not come naturally to most of my students.

Nor did many students understand that to show the existence of an object with a certain property, one should try to find the object." Thesis: the primary value of a discrete math course that is specifically addressed to freshman and sophomore students is that it can be structured so as to address students' fundamental misconceptions and difficulties with logical reasoning and improve their general analytical abilities. However: It is not easy to change students' deeply embedded mental habits.

For the human soul is hospitable, and will entertain conflicting sentiments and contradictory opinions with much impartiality. George Eliot Proem to Romola

My Philosophy in a Nutshell Teach logical reasoning, not just logic as a subject Be conscious of the tension between covering topics and developing students' understanding Don't rush to present topics from an advanced perspective Be aware that most students today are not very good at algebra Summary: Much miscommunication occurs because of unjustified assumptions

Role of Logic in Proof article Use of Logic in Proof draft

Syllabus Issues DePaul Discrete Mathematics I Review Guide for DM I DePaul Discrete Mathematics II Review Guide for DM II Syllabi from other institutions ReferenceReference1 ReferenceReference2

A Few Details Discrete Math Applets on the Web Unifying topics and moments –Logic, proof, and number theoryLogic, proof, and number theory –Euclidean algorithm and proof of correctness –Number of edges of K n recursive approach and confirmation with induction theorem on the total degree of a graph “n choose 2” –Analyzing an algorithm counting iterations recursive thinking to obtain a recurrence relation solving a recurrence relation O-notation