Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013...

43
Why am I taking this course? Foundation for other courses Mathematical Maturity What is Discrete Math? What kinds of problems will I be able to solve? Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction

Transcript of Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013...

Page 1: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Lecture 0: Introduction

Matthew Fricke

June 3, 2013

Matthew Fricke Lecture 0: Introduction

Page 2: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

This Lecture

1 Why am I taking this course?

2 Foundation for other courses

3 Mathematical Maturity

4 What is Discrete Math?

5 What kinds of problems will I be able to solve?

Matthew Fricke Lecture 0: Introduction

Page 3: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Foundation for other courses

Solve important Computer Science problems

Develop ”Mathematical Maturity”

Matthew Fricke Lecture 0: Introduction

Page 4: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Foundation for other courses

Solve important Computer Science problems

Develop ”Mathematical Maturity”

Matthew Fricke Lecture 0: Introduction

Page 5: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Foundation for other courses

Solve important Computer Science problems

Develop ”Mathematical Maturity”

Matthew Fricke Lecture 0: Introduction

Page 6: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 7: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 8: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 9: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 10: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 11: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 12: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 13: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 14: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 15: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 16: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 17: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Algorithms and Datastructures I/II (CS361/2)

Proofs, Graphs, Trees, Recurrence, Sums, Sequences

Artificial Intelligence (CS427)

Propositional Logic, Predicate Calculus, Recursion

Software Engineering (CS460)

Boolean Algebra, Graphs, Finite State Automata

Functional Languages (CS327)

Cartesian Products, Recursion, Functions, Sets, Induction

Compilers

Cartesian Products, Recursion, Functions, Sets, Induction

Graphics and Game Design

Cartesian Products, Recursion, Functions, Sets, Induction

Matthew Fricke Lecture 0: Introduction

Page 18: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 19: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 20: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 21: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 22: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 23: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 24: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 25: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 26: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 27: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 28: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Imperative Languages (CS351)

Graphs, Trees, Recurrence, Binary and Boolean Logic, etc

Theory of Computation

Sets, Functions, Graphs, Propositional and Predicate Calculi,Sums, Finite State Automata, Languages

Operating Systems

Computer Security

Number Theory, Proofs

Complex Systems

Number Theory, Proofs

... and every other math and computer science course you willever take!

Logic, Sets, Functions, Relations, Proofs, ...

Matthew Fricke Lecture 0: Introduction

Page 29: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Introduction to many areas of math

Logic

Sets

Combinatorics

Number Theory

Discrete Probability

Theory of Computation

Matthew Fricke Lecture 0: Introduction

Page 30: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Introduction to many areas of math

Logic

Sets

Combinatorics

Number Theory

Discrete Probability

Theory of Computation

Matthew Fricke Lecture 0: Introduction

Page 31: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Introduction to many areas of math

Logic

Sets

Combinatorics

Number Theory

Discrete Probability

Theory of Computation

Matthew Fricke Lecture 0: Introduction

Page 32: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Introduction to many areas of math

Logic

Sets

Combinatorics

Number Theory

Discrete Probability

Theory of Computation

Matthew Fricke Lecture 0: Introduction

Page 33: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Introduction to many areas of math

Logic

Sets

Combinatorics

Number Theory

Discrete Probability

Theory of Computation

Matthew Fricke Lecture 0: Introduction

Page 34: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Introduction to many areas of math

Logic

Sets

Combinatorics

Number Theory

Discrete Probability

Theory of Computation

Matthew Fricke Lecture 0: Introduction

Page 35: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Introduction to many areas of math

Logic

Sets

Combinatorics

Number Theory

Discrete Probability

Theory of Computation

Matthew Fricke Lecture 0: Introduction

Page 36: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Not Real numbers - Mathematics of the Finite (mostly)

Discrete mathematical objects (binary, integers, sets, graphs)

Mathematics of Computers

Matthew Fricke Lecture 0: Introduction

Page 37: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Not Real numbers - Mathematics of the Finite (mostly)

Discrete mathematical objects (binary, integers, sets, graphs)

Mathematics of Computers

Matthew Fricke Lecture 0: Introduction

Page 38: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

Not Real numbers - Mathematics of the Finite (mostly)

Discrete mathematical objects (binary, integers, sets, graphs)

Mathematics of Computers

Matthew Fricke Lecture 0: Introduction

Page 39: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

How many valid Internet Addresses are there?

How can I encrypt a message between two computers?

How can I build a circuit that adds two numbers?

How can I find the shortest path between two computers, orvisit all cities in the shortest time?

Calculate the probability of winning a lottery.

Matthew Fricke Lecture 0: Introduction

Page 40: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

How many valid Internet Addresses are there?

How can I encrypt a message between two computers?

How can I build a circuit that adds two numbers?

How can I find the shortest path between two computers, orvisit all cities in the shortest time?

Calculate the probability of winning a lottery.

Matthew Fricke Lecture 0: Introduction

Page 41: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

How many valid Internet Addresses are there?

How can I encrypt a message between two computers?

How can I build a circuit that adds two numbers?

How can I find the shortest path between two computers, orvisit all cities in the shortest time?

Calculate the probability of winning a lottery.

Matthew Fricke Lecture 0: Introduction

Page 42: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

How many valid Internet Addresses are there?

How can I encrypt a message between two computers?

How can I build a circuit that adds two numbers?

How can I find the shortest path between two computers, orvisit all cities in the shortest time?

Calculate the probability of winning a lottery.

Matthew Fricke Lecture 0: Introduction

Page 43: Lecture 0: Introduction - fricke.co.uk · Lecture 0: Introduction Matthew Fricke June 3, 2013 Matthew Fricke Lecture 0: Introduction. Why am I taking this course? Foundation for other

Why am I taking this course?Foundation for other courses

Mathematical MaturityWhat is Discrete Math?

What kinds of problems will I be able to solve?

Why am I taking this course?

How many valid Internet Addresses are there?

How can I encrypt a message between two computers?

How can I build a circuit that adds two numbers?

How can I find the shortest path between two computers, orvisit all cities in the shortest time?

Calculate the probability of winning a lottery.

Matthew Fricke Lecture 0: Introduction