David M. Bressoud Macalester College, St. Paul, MN Project NExT-WI, October 6, 2006.

Slides:



Advertisements
Similar presentations
Week 6 - Wednesday CS322.
Advertisements

Computer Science 20 Discrete Mathematics for Computer Science All the Math you need for your Computer Science courses that you won’t learn in your Math.
Polya Mathematics Lab A Cognitive Approach Design Proposal By Deepak Kumar Adam Royalty.
3.5 Paradox  1.Russell’s paradox  A  A, A  A 。  Russell’s paradox: Let S={A|A  A}. The question is, does S  S?  i.e. S  S or S  S?  If S  S,
Department of Mathematical Sciences The University of Texas at El Paso 1 Program Assessment Presentation May 15, 2009 Joe Guthrie Helmut Knaust.
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.
Induction and recursion
Complexity 26-1 Complexity Andrei Bulatov Interactive Proofs.
Welcome to MATH 302A Please find the index card with your name on it and sit there. On the other side of the index card, write: Name as you wish to be.
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
1 CS233601: Discrete Mathematics Department of Computer Science National Tsing Hua University.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
The Art of Counting David M. Bressoud Macalester College St. Paul, MN BAMA, April 12, 2006 This Power Point presentation can be downloaded from
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Review Lecture Tuesday, 12/10/02.
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
The Design and Analysis of Algorithms
Math 302A section 5 Spring, 2009 Instructor: Laurie Varecka.
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
Test Preparation Strategies
CSE 1111 Week 1 CSE 1111 Introduction to Computer Science and Engineering.
September1999 CMSC 203 / 0201 Fall 2002 Week #11 – 4/6/8 November 2002 Prof. Marie desJardins.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
CSNB143 – Discrete Structure
Discrete Mathematics I 暨南大学 信息科学技术学院 计算机科学系 黄 战 副教授 离散数学 I (全英)
Problem Solving Strategies
CS 103 Discrete Structures Lecture 01 Introduction to the Course
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Discrete Mathematics Transparency No. 0-1 Discrete Mathematics Cheng-Chia Chen September 2009.
Wednesday, March 21, 2012 Paul Perskin CFN 204 Mathematics Network Meeting.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
--Laurie Wern Overmann August 25, “Students learn math by doing math not by watching someone else do math” Students listen to the instructor while.
Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida.
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
9.4 Mathematical Induction
CPSC 121: Models of Computation Unit 0 Introduction George Tsiknis Based on slides by Patrice Belleville and Steve Wolfman.
CS 173, Lecture B August 25, 2015 Professor Tandy Warnow.
Welcome to …. Agenda Hand Shake Problem Standards for Mathematical Practice 2 Standards for Mathematical Practice 3 Standards for Mathematical Practice.
Data Structures and Algorithm Analysis Introduction Lecturer: Ligang Dong, egan Tel: , Office: SIEE Building.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.
MATH 1020: Chapter 0: Introduction MATH 1020: Mathematics For Non-science Chapter 0: An Introduction 1 Instructor: Prof. Ken Tsang Room E409-R9
David M. Bressoud Macalester College, St. Paul, Minnesota MathFest, Albuquerque, NM August 5, 2005.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
CompSci 102 Discrete Math for Computer Science March 13, 2012 Prof. Rodger Slides modified from Rosen.
1 CSC 281 Discrete Mathematics for Computer Science Dr.Yuan Tian Syllabus.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Complexity 24-1 Complexity Andrei Bulatov Interactive Proofs.
CS 225 Discrete Structures in Computer Science Winter, 2014: 157 Spring, 2014: 151 Summer, 2014: Two sections 97 and 53.
Graduate Instruction Methods Fall 2008 Being a successful TA Cesar D. Guerrero Department of Computer Science and Engineering October.
Discrete mathematics Kwon, Tae-kyoung
CS/APMA 202 Spring 2005 Aaron Bloomfield. Sequences in Nature
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
CIT 592 Discrete Math Lecture 1. By way of introduction … Arvind Bhusnurmath There are no bonus points for pronouncing my last name correctly Please call.
5 Lecture in math Predicates Induction Combinatorics.
CSE 311: Foundations of Computing Fall 2013 Lecture 1: Propositional logic.
Computer Science 20 Discrete Mathematics for Computer Science 1 All the Math you need for your Computer Science courses that you won’t learn in your Math.
Week 9 - Friday.  What did we talk about last time?  Permutations  Counting elements in sets  Brief introduction to combinations.
Welcome to CMSC 203 – Discrete Structures Spring 2003
Discrete Mathematics for Computer Science
Discrete Structures for Computer Science
Jeremy Bolton, PhD Assistant Teaching Professor
Induction and recursion
CS 281: Discrete Mathematics for Computer Science
Design and Analysis of Algorithms
COMP 122 – Design and Analysis of Algorithms
MTH 221 All Discussions The Latest Version // uopcourse.com
MTH 221MTH221 mth 221 mth221 All Discussions The Latest Version // uopstudy.com
Presentation transcript:

David M. Bressoud Macalester College, St. Paul, MN Project NExT-WI, October 6, 2006

Do something that is new to you in every course.

Try to avoid doing everything new in any course.

Do something that is new to you in every course. Try to avoid doing everything new in any course. What you grade is what counts for your students.

Do something that is new to you in every course. Try to avoid doing everything new in any course. What you grade is what counts for your students. Reading mathematics, working through complex problems, communicating mathematics, using terminology correctly, constructing proofs, going back over material that has not been understood

Do something that is new to you in every course. Try to avoid doing everything new in any course. What you grade is what counts for your students. Reading mathematics, working through complex problems, communicating mathematics, using terminology correctly, constructing proofs, going back over material that has not been understood

Do something that is new to you in every course. Try to avoid doing everything new in any course. What you grade is what counts for your students. Reading mathematics, working through complex problems, communicating mathematics, using terminology correctly, constructing proofs, going back over material that has not been understood

Do something that is new to you in every course. Try to avoid doing everything new in any course. What you grade is what counts for your students. Reading mathematics, working through complex problems, communicating mathematics, using terminology correctly, constructing proofs, going back over material that has not been understood

What you grade is what counts for your students. Homework 20% Reading Reactions 5% 3 Projects 10% each 2 mid-terms + final, 15% each If you hold students to high standards and give them ample opportunity to show what they’ve learned, then you can safely ignore cries about grade inflation.

MATH 136 DISCRETE MATHEMATICS An introduction to the basic techniques and methods used in combinatorial problem-solving. Includes basic counting principles, induction, logic, recurrence relations, and graph theory. Every semester. Required for a major or minor in Mathematics and in Computer Science. I teach it as a project-driven course in combinatorics & number theory. Taught to 74 students, 3 sections, in 2004–05. More than 1 in 6 Macalester students take this course.

“ Let us teach guessing ” MAA video, George Pólya, 1965 Points: Difference between wild and educated guesses Importance of testing guesses Role of simpler problems Illustration of how instructive it can be to discover that you have made an incorrect guess

“ Let us teach guessing ” MAA video, George Pólya, 1965 Points: Difference between wild and educated guesses Importance of testing guesses Role of simpler problems Illustration of how instructive it can be to discover that you have made an incorrect guess Preparation: Some familiarity with proof by induction Review of binomial coefficients

Problem: How many regions are formed by 5 planes in space? Start with wild guesses: 10, 25, 32, …

Problem: How many regions are formed by 5 planes in space? Start with wild guesses: 10, 25, 32, … random

Simpler problem: 0 planes: 1 region 1 plane: 2 regions 2 planes: 4 regions 3 planes: 8 regions 4 planes: ??? Problem: How many regions are formed by 5 planes in space? Start with wild guesses: 10, 25, 32, … random

Problem: How many regions are formed by 5 planes in space? Simpler problem: 0 planes: 1 region 1 plane: 2 regions 2 planes: 4 regions 3 planes: 8 regions 4 planes: ??? Start with wild guesses: 10, 25, 32, … Educated guess for 4 planes: 16 regions random

TEST YOUR GUESS Work with simpler problem: regions formed by lines on a plane: 0 lines: 1 region 1 line: 2 regions 2 lines: 4 regions 3 lines: ???

TEST YOUR GUESS Work with simpler problem: regions formed by lines on a plane: 0 lines: 1 region 1 line: 2 regions 2 lines: 4 regions 3 lines: ???

START WITH SIMPLEST CASE USE INDUCTIVE REASONING TO BUILD n Space cut by n planes Plane cut by n lines Line cut by n points

START WITH SIMPLEST CASE USE INDUCTIVE REASONING TO BUILD n Space cut by n planes Plane cut by n lines Line cut by n points Test your guess

START WITH SIMPLEST CASE USE INDUCTIVE REASONING TO BUILD n Space cut by n planes Plane cut by n lines Line cut by n points Test your guess

GUESS A FORMULA n points on a line lines on a plane planes in space

GUESS A FORMULA n points on a line lines on a plane planes in space

GUESS A FORMULA n k–1-dimensional hyperplanes in k-dimensional space cut it into:

GUESS A FORMULA Now prove it! n k–1-dimensional hyperplanes in k-dimensional space cut it into:

GUESS A FORMULA Now prove it! n k–1-dimensional hyperplanes in k-dimensional space cut it into:

Stamp Problem: What is the largest postage amount that cannot be made using an unlimited supply of 5¢ stamps and 8¢ stamps?

X X X X X X X

X X X X X X X X X X X X X

X X X X X X X X X X X X X X X X X X X X X

X X X X X X X X X X X X X X X X X X X X X

Stamp Problem: What is the largest postage amount that cannot be made using an unlimited supply of 5¢ stamps and 8¢ stamps? 4¢ and 9¢? 4¢ and 6¢? a¢ and b¢?

How many perfect shuffles are needed to return a deck to its original order? In-shuffles versus out-shuffles In-shuffles in a deck of 2n cards is the order of 2 modulo 2n+1. Out-shuffles is the order of 2 modulo 2n-1.

Tips on group work: I assign who is in each group, and I mix up the membership of the groups. No more than 4 to a group, then split into writing teams of 2 each. Have at least one project in which each person submits their own report. Each team decides how to split up the grade.