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.

Slides:



Advertisements
Similar presentations
Make sure you know the day and time of the final exam for this section of Math 110: Day: ______ Date:______ Time: ______ to _______ All Math 110.
Advertisements

Introduction to CS Theory Lecture 2 – Discrete Math Revision Piotr Faliszewski
Department of Mathematical Sciences The University of Texas at El Paso 1 Program Assessment Presentation May 15, 2009 Joe Guthrie Helmut Knaust.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
5/19/2015CS 2011 CS 201 – Data Structures and Discrete Mathematics I Syllabus Spring 2014.
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
Welcome to Econ 1, Winter 2009 Instructor: John Hartman Teaching Assistant: Rosemarie Lavaty.
1 Section 3.3 Mathematical Induction. 2 Technique used extensively to prove results about large variety of discrete objects Can only be used to prove.
Mathematical Induction Readings on induction. (a) Weiss, Sec. 7.2, page 233 (b) Course slides for lecture and notes recitation. Every criticism from a.
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
WEEK 1 CS 361: ADVANCED DATA STRUCTURES AND ALGORITHMS Dong Si Dept. of Computer Science 1.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
APMA/CS 202 Discrete Math I Section 01 Spring 2003.
Introduction to CS Theory Lecture 1 – Introduction Piotr Faliszewski
Course Information and Introductions Intro to Computer Science CS1510 Dr. Sarah Diesburg University of Northern Iowa 1.
About the Course Lecture 0: Sep 10 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
Math 125 Statistics. About me  Nedjla Ougouag, PhD  Office: Room 702H  Ph: (312)   Homepage:
1-1/10/2000AME 150L Spring /10/2000AME 150L Introduction to Computational Methods in Aerospace & Mechanical Engineering (4 units, Spring semester)
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Fall 2010 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
Daily Announcements CS/APMA 202 Spring 2005 Aaron Bloomfield.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Mathematics in Computer Science at Loras College Steve Mosiman.
CSNB143 – Discrete Structure Topic 5 – Induction Part I.
MATH 224 – Discrete Mathematics
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit.
CS 101 Today’s class will start 5 minutes late. CS 101 Introduction to Computer Science Aaron Bloomfield University of Virginia Spring 2007.
CSC Discrete Mathematical Structures Dr. Karl Ricanek Jr.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Discrete Structures for Computing
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Spring 2011 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
CS 101 Today’s class will start 5 minutes late (and we’ll be talking about lab scheduling problems then)
Lecture Section 001 Spring 2008 Mike O’Dell CSE 1301 Computer Literacy.
Introduction COMP283 – Discrete Structures. JOOHWI LEE Dr. Lee or Mr. Lee ABD Student working with Dr. Styner
Matter and Interactions 1 Fall 2006 Matter & Interactions I Physics Professor & Lecturer: Dr. Reinhard Schumacher Teaching Assistants: Ms. Elisa.
1 Daily Announcements CS 202, Spring 2007 Aaron Bloomfield.
Thinking Mathematically Problem Solving and Critical Thinking.
Welcome to PHY2049 Physics for Engineers and Scientists II Dr. Bindell SPRING 2009 Dr. J. B. Bindell.
Welcome to PHY2049 Physics for Engineers and Scientists II Dr. Bindell.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
CS 123 Computational Lab IIl Spring 2008 Department of Computer Science Drexel University Copyright by the authors. Permission is given for students and.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
1 CSC 281 Discrete Mathematics for Computer Science Dr.Yuan Tian Syllabus.
I think therefore I am - Rene Descartes. REASON (logic) It has been said that man is a rational animal. All my life I have been searching for evidence.
Introduction to Structures CSLU 1100.Lo3 Fall 2007 Cameron McInally Fordham University.
CS 225 Discrete Structures in Computer Science Winter, 2014: 157 Spring, 2014: 151 Summer, 2014: Two sections 97 and 53.
Discrete mathematics Kwon, Tae-kyoung
CS/APMA 202 Spring 2005 Aaron Bloomfield. Sequences in Nature
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.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Computer Science I ISMAIL ABUMUHFOUZ | CS 180. CS 180 Description BRIEF SUMMARY: This course covers a study of the algorithmic approach and the object.
Cs3102: Theory of Computation (aka cs302: Discrete Mathematics II) Spring 2010 University of Virginia David Evans.
CPSC 121: Models of Computation REVIEW. Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss,
COMP 283 Discrete Structures
Discrete Structures for Computer Science
The Foundations: Logic and Proofs
Syllabus Grade 7 Includes all 7th grade Common Core Standards, 8 Mathematical Practices, and other general information for the start of class.
Jeremy Bolton, PhD Assistant Teaching Professor
CS 281: Discrete Mathematics for Computer Science
CS Problem Solving and Object Oriented Programming Spring 2019
Presentation transcript:

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. Multiply both sides by aa 2 = ab 3. Subtract b 2 a 2 -b 2 = ab-b 2 4. Factor both sides(a-b)(a+b) = b(a-b) 5. Divide by (a-b)a+b = b 6. Since a = b, we replace b with ab+b = b 7. Combine terms2b = b 8. As b is non-zero, divide it out2 = 1 Q.E.D. (Latin for “which was to be proven”)

CS 202: Discrete Math Spring 2007 Aaron Bloomfield

So…. What is it? Discrete mathematics … is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity (wikipedia) In other words, dealing with integer things (sets, logic, proofs, etc.) and not continuous things (calculus, functions, etc.)

Why discrete math? It forms the basis for computer science: –Sequences –Digital logic (how computers compute) –Algorithms –Assuring computer correctness –Probability and gambling (really!) –Etc. Like how “regular” math forms the basis for science

Sequences in Nature

Proofs How do you know something is correct? How do you know when something is not correct? –Such as showing that 2=1? How do you think logically? How do you think to solve problems?

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. Multiply both sides by aa 2 = ab 3. Subtract b 2 a 2 -b 2 = ab-b 2 4. Factor both sides(a-b)(a+b) = b(a-b) 5. Divide by (a-b)a+b = b 6. Since a = b, we replace b with ab+b = b 7. Combine terms2b = b 8. As b is non-zero, divide it out2 = 1 Q.E.D. (Latin for “which was to be demonstrated”)

Why am I here?

Course objectives Logic: Introduce a formal system (propositional and predicate logic) which mathematical reasoning is based on Proofs: Develop an understanding of how to read and construct valid mathematical arguments (proofs) and understand mathematical statements (theorems), including inductive proofs. Also, introduce and work with various problem solving strategies and techniques Counting: Introduce the basics of integer theory, combinatorics, and counting principles, including a brief introduction to discrete probability Structures: Introduce and work with important discrete data structures such as sets, relations, sequences, and discrete functions Applications: Gain an understanding of some application areas of the material covered in the course

Who am I? Aaron Bloomfield –Office: Olsson 228D –Office hours: M/W 4:00-5:30 –

Who are they? We will have a number of teaching assistants –Who will be holding office hours This will be posted on the website in a few days Office hours start next week

Going over the syllabus…

Textbook (Required) Susanna Epp Discrete Mathematics with Applications, 3rd edition –ISBN Sorry about the price!

Other Issues Privacy Keeping the class interesting –Most of you know that I like humor –But most of you have seen my humor… –So we’ll be seeing puzzles and brain teasers this semester –And you get to contribute!

Where did the money go? Three people check into a hotel. They pay $30 to the manager and go to their room. The manager suddenly remembers that the room rate is $25 and gives $5 to the bellboy to return to the people. On the way to the room the bellboy reasons that $5 would be difficult to share among three people so he pockets $2 and gives $1 to each person. Now each person paid $10 and got back $1. So they paid $9 each, totaling $27. The bellboy has $2, totaling $29. Where is the missing $1?

Feedback It’s a very good thing! Feel free to leave us feedback –Can be done anonymously, if you wish Via the Toolkit or the CS dept website It’s hard for the instructors to know what the students think of the course…

The Study How does one make a discrete math class more interesting? By adding: –“Nifty” problems –Application examples –Physical demonstrations –Interactive demonstrations –Brain teasers This is one reason why there are labs recitation sections.

Scheduling Issues This room has 94 seats One of the lab sections (11 a.m.) has 42 seats I will course action people in starting next Monday –I am planning on taking a survey of who wants to get into which section For now, come to the 1:00 recitation if you can

The survey This will help me with the recitation scheduling, background material coverage, etc.