Rules of the game  You will work with your Unit 3 group  We will have 4 rounds of 6 questions each. Most are multiple choice; some are fill in the blank.

Slides:



Advertisements
Similar presentations
Lecture 7 Surreal Numbers. Lecture 7 Surreal Numbers.
Advertisements

Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
1 Diagonalization Fact: Many books exist. Fact: Some books contain the titles of other books within them. Fact: Some books contain their own titles within.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 10 Cardinality Uncountability of the real numbers.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
7 INVERSE FUNCTIONS.
1 Numerical geometry of non-rigid shapes Mathematical background Mathematical background Tutorial 1 © Maks Ovsjanikov, Alex & Michael Bronstein tosca.cs.technion.ac.il/book.
Sequence A list of objects arranged in a particular order.
Chapter 5 Integrals 5.2 The Definite Integral In this handout: Riemann sum Definition of a definite integral Properties of the definite integral.
Cardinality of a Set “The number of elements in a set.” Let A be a set. a.If A =  (the empty set), then the cardinality of A is 0. b. If A has exactly.
Vocabulary word (put this word on the back of the card.) THIS WILL BE THE DEFINITION – FILL IN THE BLANKS ON THE VOCABULARY CARDS PROVIDED.
Sequences and Summations
Mathematics. Session Functions, Limits and Continuity-1.
9.1 Sequences. A sequence is a list of numbers written in an explicit order. n th term Any real-valued function with domain a subset of the positive integers.
Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.
Foundations of Discrete Mathematics Chapter 3 By Dr. Dalia M. Gil, Ph.D.
February 12, 2015Applied Discrete Mathematics Week 2: Functions and Sequences 1Exercises Question 1: Given a set A = {x, y, z} and a set B = {1, 2, 3,
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Appendix A. Mathematical Background EE692 Parallel and Distribution Computation.
Basic Concepts of Discrete Probability (Theory of Sets: Continuation) 1.
Random Variables A random variable is simply a real-valued function defined on the sample space of an experiment. Example. Three fair coins are flipped.
APPLICATIONS OF DIFFERENTIATION Indeterminate Forms and L’Hospital’s Rule APPLICATIONS OF DIFFERENTIATION In this section, we will learn: How to.
Section 4.4 Indeterminate Forms and L’Hospital’s Rule Applications of Differentiation.
INDETERMINATE FORMS AND IMPROPER INTEGRALS
Week 7 - Friday.  What did we talk about last time?  Set disproofs  Russell’s paradox  Function basics.
Chapter 3 L p -space. Preliminaries on measure and integration.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Sets --- A set is a collection of objects. Sets are denoted by A, B, C, … --- The objects in the set are called the elements of the set. The elements are.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Natural, Integer and Rational numbers The natural numbers are best given by the axioms of Giuseppe Peano ( ) given in There is a natural.
Functions1 Elementary Discrete Mathematics Jim Skon.
Example Prove that: “IF 3n + 2 is odd, then n is odd” Proof by Contradiction: -p = 3n + 2 is odd, q = n is odd. -Assume that ~(p  q) is true OR -(p 
Relations, Functions, and Countability
Thinking Mathematically Number Theory and the Real Number System 5.5 Real Numbers and Their Properties.
Discrete Mathematics R. Johnsonbaugh
11 DISCRETE STRUCTURES DISCRETE STRUCTURES UNIT 5 SSK3003 DR. ALI MAMAT 1.
11 DISCRETE STRUCTURES DISCRETE STRUCTURES UNIT 5 SSK3003 DR. ALI MAMAT 1.
NUMBER SYSTEMS TWSSP Wednesday. Wednesday Agenda Finish our work with decimal expansions Define irrational numbers Prove the existence of irrationals.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Power Series Section 9.1a.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Properties for Real Numbers Rules that real numbers follow.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
Math 51/COEN 19. Sequences and Summations - vocab An arithmetic progression is a sequence of the form a, a+d, a+2d, …, a+nd, … with fixed a, d in R and.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
CS 285- Discrete Mathematics
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Department of Statistics University of Rajshahi, Bangladesh
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 11/11/2008.
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
Week 8 - Monday.  What did we talk about last time?  Properties of functions  One-to-one  Onto  Inverses  Cardinality.
Discrete Mathematics Lecture # 17 Function. Relations and Functions  A function F from a set X to a set Y is a relation from X to Y that satisfies the.
Infinite sets We say that a set A is infinite if a proper subset B exists of A such that there is a bijection It is easy to see that no set with a finite.
Sequences Lecture 11. L62 Sequences Sequences are a way of ordering lists of objects. Java arrays are a type of sequence of finite size. Usually, mathematical.
One of Cantor's basic concepts was the notion of the size or cardinality of a set M, denoted by |M|  M - finite sets M is an n-set or has size n, if.
The Relation Induced by a Partition
Existence of Non-measurable Set
Discrete Mathematics CS 2610
Chapter 3 The Real Numbers.
Chapter 3 The Real Numbers.
Chapter 3 The Real Numbers.
Introduction to Real Analysis
Existence of Non-measurable Set
Complex Variables. Complex Variables Open Disks or Neighborhoods Definition. The set of all points z which satisfy the inequality |z – z0|
Some Review Problems for Math 141 Final
Finite and Infinite Sets
Chapter 3 The Real Numbers.
Countable or Uncountable…That is the question!
Chapter 5 Limits and Continuity.
Presentation transcript:

Rules of the game  You will work with your Unit 3 group  We will have 4 rounds of 6 questions each. Most are multiple choice; some are fill in the blank.  Point values per question:  Rounds 1 and 2: 1pt;  Rounds 3 and 4: 2pts.  You will be required to write down one answer per round (i.e., to choose one answer you are particularly confident about)  If you get it right, you get points for that question  If you get it wrong, you lose points! We will play this game on the HONOR system with each team keeping track of its own points. In the end, the team with the highest score will win a prize!

Each question is worth 1 point.

Suppose f : R → R is continuous and define the zero set of f by Z(f)= { x: f(x) = 0} How would you prove that Z(f) is a closed set?

Suppose f,g: R → R are continuous functions such that f(r) = g(r) for all r in Q. That is to say, f and g are equal on the rational numbers. Prove that f(x) = g(x) for all x in R.

Find a continuous function f:(0,1) → R and a Cauchy sequence (x n ) such that f(x n ) is not a Cauchy sequence. Find a continuous function f:[0,1] → R and a Cauchy sequence (x n ) such that f(x n ) is not a Cauchy sequence.

Let A denote a closed subset of R. Prove that for all B ⊆ A, if B has a supremum, then sup(B) ∈ A.

Let (a n ) be a sequence real numbers which satisfies the property that |a n+1 − a n | ≤ ½ |a n −a n−1 | for all n>1. Prove that (a n ) is a Cauchy sequence?

Let (a n ) be a sequence real numbers and assume that (a 2n ) and (a 2n+1 ) converge to the same limit. Does (a n ) converge? Prove your answer.

Let E=(0,1]. For n≥1, let O n =(0,1+1/n). Is {O n :n≥1} an open cover of E? Is E compact?

 Give an example of a nonempty finite set which is neither open nor closed?

Prove that [0,1) is not open. Prove that [0,1) is not closed.

Find an open cover of Q with no finite subcover. Find a open cover of Q with a finite subcover.

Find an example of two monotone sequences (a n ) and (b n ) where their sum (a n + b n ) is not monotome. Prove that if both (a n ) and (b n ) are increasing, then (a n + b n ) is increasing.

Let A and B be two countably infinite sets. Prove that there is a bijection f:A  B.

 Prove that the set of all ordered pairs of rational numbers is countable.  Prove that the natural numbers N can be expressed as a countable union of disjoint countably infinite sets.

Prove that if (x n ) is a sequence of positive real numbers that diverges to infinity, then the sequence (1/ x n ) converges to 0.

Let (x n ) be a sequence of positive real numbers that converges to L. Let p be a fixed positive integer. Prove that the sequence (x n+p ) also converges to L.

Prove that |a| - |b| ≤ |a-b|

Prove that any interval (a,b) in the real numbers contains an uncountable number of real numbers. [ You can use the fact that (0,1) is uncountable].

 Find 1/5 in base 3.

How far apart are the points a=(1,3) and b = (4,7) In the taxicab metric? In the max metric? In the Washington DC metric?

Find a continuous function f: R → R and an open set U such that F(U) is not open. Find a continuous function f: R → R and a closed set C with f(C) not closed?

Give a sequence of functions f n :[0,1]  R that is pointwise convergent but not uniformly convergent.