Math 3000 Section 003 Intro to Abstract Math Midterm 1

Similar documents
Math 3000 Section 003 Intro to Abstract Math Final Exam

Math 13, Spring 2013, Lecture B: Midterm

Math 3000 Section 003 Intro to Abstract Math Homework 6

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

Section 3.1: Direct Proof and Counterexample 1

Disproof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Disproof Fall / 16

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.

MATH CSE20 Homework 5 Due Monday November 4

MATH 2200 Final LC Review

Homework assignment 1: Solutions

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

Math Real Analysis

Introducing Proof 1. hsn.uk.net. Contents

Proofs. Joe Patten August 10, 2018

Chapter 2: The Logic of Quantified Statements. January 22, 2010

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Ch 3.2: Direct proofs

MATH 2200 Final Review

ASSIGNMENT 1 SOLUTIONS

Midterm Exam Solution

Preparing for the CS 173 (A) Fall 2018 Midterm 1

Midterm Preparation Problems

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

1 Implication and induction

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Section 1.3. Let I be a set. When I is used in the following context,

STRATEGIES OF PROBLEM SOLVING

MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.

Sums of Squares. Bianca Homberg and Minna Liu

Algebra Exam. Solutions and Grading Guide

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

Chapter 1: The Logic of Compound Statements. January 7, 2008

All numbered readings are from Beck and Geoghegan s The art of proof.

CS 124 Math Review Section January 29, 2018

PROBLEM SET 3: PROOF TECHNIQUES

LECTURE 1. Logic and Proofs

Basic Proof Examples

MA103 STATEMENTS, PROOF, LOGIC

COT 2104 Homework Assignment 1 (Answers)

9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.

Math 230 Final Exam, Spring 2009

3 The language of proof

(3,1) Methods of Proof

Contradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730

CHMC: Finite Fields 9/23/17

Assignment 3 Logic and Reasoning KEY

Recitation 4: Quantifiers and basic proofs

CHAPTER 0. Introduction

1. Prove that the number cannot be represented as a 2 +3b 2 for any integers a and b. (Hint: Consider the remainder mod 3).

Adam Blank Spring 2017 CSE 311. Foundations of Computing I. * All slides are a combined effort between previous instructors of the course

1.1 Statements and Compound Statements

One sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:

8. Reductio ad absurdum

Proof worksheet solutions

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

More examples of mathematical. Lecture 4 ICOM 4075

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

CSE 20 DISCRETE MATH. Winter

Chapter 1 Review of Equations and Inequalities

Discrete Mathematics Exam File Spring Exam #1

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

MATH 13 FINAL EXAM SOLUTIONS

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Note 2

MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics

Homework 3 Solutions, Math 55

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction

Solutions to Problem Set 1

What can you prove by induction?

PGSS Discrete Math Solutions to Problem Set #4. Note: signifies the end of a problem, and signifies the end of a proof.

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Discrete Mathematics and Probability Theory Summer 2015 Chung-Wei Lin Midterm 1

Example 1: Identifying the Parts of a Conditional Statement

The Basics COPYRIGHTED MATERIAL. chapter. Algebra is a very logical way to solve

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

Winter Camp 2009 Number Theory Tips and Tricks

We have seen that the symbols,,, and can guide the logical

REVIEW PROBLEMS FOR SECOND 3200 MIDTERM

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

An Introduction to Mathematical Reasoning

Direct Proof and Counterexample I:Introduction

Math 109 September 1, 2016

CS280, Spring 2004: Final

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.

CSE 20 DISCRETE MATH. Fall

FILE NAME: PYTHAGOREAN_TRIPLES_012-( WED).DOCX AUTHOR: DOUG JONES

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Discrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 2

Logic. Facts (with proofs) CHAPTER 1. Definitions

Geometry Unit 2 Notes Logic, Reasoning and Proof

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Chapter 2. Reasoning and Proof

MATH10040: Numbers and Functions Homework 1: Solutions

2. Find all combinations of truth values for p, q and r for which the statement p (q (p r)) is true.

THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE. by Miles Mathis

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS

Homework 1 2/7/2018 SOLUTIONS Exercise 1. (a) Graph the following sets (i) C = {x R x in Z} Answer:

EECS 1028 M: Discrete Mathematics for Engineers

Math Precalculus I University of Hawai i at Mānoa Spring

Foundations of Discrete Mathematics

MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018

Transcription:

Math 3000 Section 003 Intro to Abstract Math Midterm 1 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Name: Points: Read all problems carefully and write your solutions essay-style using full sentences. In addition, please remember to always state whether you are giving a proof or a counterexample, and what type of proof (direct proof, proof by contrapositive, contradiction, or cases) you are using. 1. The following table gives several possibilities to begin a proof of the statement that P Q. For each beginning, check whether the opening sentence is a correct beginning and identify the type of proof that is being used; otherwise indicate that a mistake must have been made. First step to prove that P Q direct contrapositive contradiction mistake Assume that P is true. Assume that P is false. Assume that Q is true. Assume that Q is false. Assume that P is true and Q is true. Assume that P is true and Q is false. Assume that P is false and Q is true. Assume that P is false and Q is false. Assume that P Q is true. Assume that P Q is false. 2. Let a and b be integers and define the following concepts. Use correct mathematical notation. (a) a divides b (b) a and b have the same parity 3. Let S be a set and define the following concepts. Use correct mathematical notation if needed. (a) a partition of S (b) the power set P(S)

Math 3000 Section 003 Intro to Abstract Math Midterm 1, UC Denver, Spring 2012 2 4. Prove or disprove: If a and b are two even nonnegative integers, then a b is even. 5. Prove or disprove: There exists a largest positive integer that is divisible by 2012.

Math 3000 Section 003 Intro to Abstract Math Midterm 1, UC Denver, Spring 2012 3 6. For every positive real number, there exists a positive integer whose reciprocal is smaller. (a) Express the above statement in symbols. (b) Decide whether the statement is true or false, and supply a proof or counterexample.

Math 3000 Section 003 Intro to Abstract Math Midterm 1, UC Denver, Spring 2012 4 7. Let x = (x 1, x 2 ) R 2 and y = (y 1, y 2 ) R 2 be two elements in the Cartesian product R R (two-dimensional vectors). We say that x dominates y if (and only if) x 1 > y 1 and x 2 > y 2. (a) Which of the following vectors is dominated by x = (3000, 3200)? y = (3000, 3195) y = (2421, 3250) y = (1401, 2411) y = (1010, 8990) (b) Prove or disprove: If x 1 + x 2 > y 1 + y 2, then x dominates y. (c) Formulate the converse of the statement in (b), and prove it. (d) Formulate the inverse of the statement in (b), and prove it.

Math 3000 Section 003 Intro to Abstract Math Midterm 1, UC Denver, Spring 2012 5 8. Let X and Y be two finite sets. (a) Prove the following triangle-type inequality: X Y X + Y. (b) Conjecture a similar relationship between X Y and X Y and prove your assertion. [Hint: Consider the set (X Y ) Y and use the result that you have proven in part (a).]

Math 3000 Section 003 Intro to Abstract Math Midterm 1, UC Denver, Spring 2012 6 9. Prove or disprove: If S and T are two sets, then P(S) P(T ) P(S T ).

Math 3000 Section 003 Intro to Abstract Math Midterm 1, UC Denver, Spring 2012 7 10. Read the following poem If by Rudyard Kipling (1865-1936) and then check all (but only those) of the below statements that are logically equivalent to the related verses in this poem. If you can keep your head when all about you Are losing theirs and blaming it on you; If you can trust yourself when all men doubt you, But make allowance for their doubting too; If you can wait and not be tired by waiting, Or being lied about, don t deal in lies, Or being hated, don t give way to hating, And yet don t look too good, nor talk too wise: If you can dream and not make dreams your master; If you can think and not make thoughts your aim; If you can meet with Triumph and Disaster And treat those two imposters just the same; If you can bear to hear the truth you ve spoken Twisted by knaves to make a trap for fools, Or watch the things you gave your life to, broken, And stoop and build em up with worn-out tools; If you can make one heap of all your winnings And risk it on one turn of pitch-and-toss, And lose, and start again at your beginnings And never breathe a word about your loss; If you can force your heart and nerve and sinew To serve your turn long after they are gone, And so hold on when there is nothing in you Except the Will which says to them: Hold on! If you can talk with crowds and keep your virtue, Or walk with kings nor lose the common touch, If neither foes nor loving friends can hurt you, If all men count with you, but none too much; If you can fill the unforgiving minute With sixty seconds worth of distance run Yours is the Earth and everything that s in it, And which is more you ll be a Man, my son! Yours is the Earth and everything that s in it only if you can keep your head when all about you are losing theirs and blaming it on you. You ll be a Man if you look good and talk wise. The ability to dream and think is necessary to be a Man. Either you can dream and think, or the Earth is not yours. You won t be a Man if you cannot meet with Triumph and Disaster. If yours is the Earth and everything that s in it, then you can make one heap of all your winnings and risk it on one turn of pitch-and-toss, and lose, and start again at your beginnings and never breathe a word about your loss. Either you ll be a Man, or either foes or loving friends can hurt you. Yours being the Earth suffices for your ability to fill the unforgiving minute with sixty seconds worth of distance run.

Math 3000 Section 003 Intro to Abstract Math Midterm 1, UC Denver, Spring 2012 8 11. This is a bonus problem that you should work only if you have completed all other problems. Any pair of two successive odd primes (2k 1, 2k + 1) for some positive integer k is called a twin prime: examples are (3,5), (5,7), (11,13), (17,19), (29,31), (41,43), etc. The twin prime conjecture states that there are infinitely many twin primes - and this is still an open question! Here is an easier problem: Prove that there exists a unique triple of three successive odd primes. [Hint: Find the triple, and then use congruences with respect to a suitable modulus].