Midterm Examination 1 with Solutions - Math 574, Frank Thorne Thursday, February 9, 2012

Similar documents
def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Handout #1: Mathematical Reasoning

Math 3000 Section 003 Intro to Abstract Math Homework 2

3. Mathematical Induction

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.

DISCRETE MATH: LECTURE 3

3. Logical Reasoning in Mathematics

Logic Appendix. Section 1 Truth Tables CONJUNCTION EXAMPLE 1

Lecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved

P1. All of the students will understand validity P2. You are one of the students C. You will understand validity

The last three chapters introduced three major proof techniques: direct,

SECTION 10-2 Mathematical Induction

p: I am elected q: I will lower the taxes

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

Chapter 1. Use the following to answer questions 1-5: In the questions below determine whether the proposition is TRUE or FALSE

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Invalidity in Predicate Logic

Rules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05

CHAPTER 2: METHODS OF PROOF

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014

1 if 1 x 0 1 if 0 x 1

Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system

Answer Key for California State Standards: Algebra I

Lecture 16 : Relations and Functions DRAFT

x a x 2 (1 + x 2 ) n.

LAKE ELSINORE UNIFIED SCHOOL DISTRICT

This chapter is all about cardinality of sets. At first this looks like a

Tom wants to find two real numbers, a and b, that have a sum of 10 and have a product of 10. He makes this table.

Solutions to Math 51 First Exam January 29, 2015

Arithmetic and Algebra of Matrices

( ) which must be a vector

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Practice with Proofs

Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.

MTH124: Honors Algebra I

Predicate Logic. For example, consider the following argument:

Likewise, we have contradictions: formulas that can only be false, e.g. (p p).

4.5 Linear Dependence and Linear Independence

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

Accentuate the Negative: Homework Examples from ACE

1. Prove that the empty set is a subset of every set.

PYTHAGOREAN TRIPLES KEITH CONRAD

MATH10040 Chapter 2: Prime and relatively prime numbers

Basic Proof Techniques

Lecture 17 : Equivalence and Order Relations DRAFT

Examination paper for MA0301 Elementær diskret matematikk

Mathematical Induction

CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 103X: Discrete Structures Homework Assignment 3 Solutions

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

The Relation between Two Present Value Formulae

Solutions Manual for How to Read and Do Proofs

Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering

Quotient Rings and Field Extensions

Properties of Real Numbers

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

INTRODUCTORY SET THEORY

Differentiation and Integration

How To Understand The Theory Of Hyperreals

Session 7 Fractions and Decimals

Binary Adders: Half Adders and Full Adders

Lesson Plan. N.RN.3: Use properties of rational and irrational numbers.

Logic is a systematic way of thinking that allows us to deduce new information

No Solution Equations Let s look at the following equation: 2 +3=2 +7

6.080/6.089 GITCS Feb 12, Lecture 3

Solutions for Practice problems on proofs

2.4 Real Zeros of Polynomial Functions

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Math 319 Problem Set #3 Solution 21 February 2002

The program also provides supplemental modules on topics in geometry and probability and statistics.

List the elements of the given set that are natural numbers, integers, rational numbers, and irrational numbers. (Enter your answers as commaseparated

CHAPTER 7 GENERAL PROOF SYSTEMS

Notes on Factoring. MA 206 Kurt Bryan

Cartesian Products and Relations

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Vocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.

Homework # 3 Solutions

1.2 Forms and Validity

Quine on truth by convention

To: GMATScore GMAT Course Registrants From: GMATScore Course Administrator Date: January 2006 Ref: SKU ; GMAT Test Format & Subject Areas

You know from calculus that functions play a fundamental role in mathematics.

Deductive reasoning is the application of a general statement to a specific instance.

FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS

Logic and Reasoning Practice Final Exam Spring Section Number

A Few Basics of Probability

8 Primes and Modular Arithmetic

LS.6 Solution Matrices

Lesson 9: Radicals and Conjugates

Algebra II End of Course Exam Answer Key Segment I. Scientific Calculator Only

YOU CAN COUNT ON NUMBER LINES

(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.

Mathematical Induction

Beyond Propositional Logic Lukasiewicz s System

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Transcription:

Midterm Examination 1 with Solutions - Math 574, Frank Thorne (thorne@math.sc.edu) Thursday, February 9, 2012 1. (3 points each) For each sentence below, say whether it is logically equivalent to the sentence If it s snowing, the temperature must be at or below freezing. (No explanation for your answers is required.) (a) If the temperature is above freezing, then it is not snowing. Logically equivalent; this is the contrapositive. (b) It only snows if the temperature is at or below freezing. Logically equivalent. If p then q means the same thing as p only if q (i.e., p q) (c) If it is not snowing, then the temperate must be above freezing. Not equivalent. This is the inverse. (d) If the temperature is at or below freezing, then it is snowing. Not equivalent. This is the converse. 2. (3 points each) For each sentence below, say whether it is logically equivalent to the sentence For all animals A, if A has claws then A is dangerous. (No explanation for your answers is required.) (a) Any animal that is dangerous has claws. Not equivalent; this is the converse. (b) Among all the animals which have claws, some are dangerous. Not equivalent. The original statement describes all animals with claws. This describes only some animals with claws. (c) Every animal with claws is dangerous. Equivalent. This is basically a rewording. (d) Some of all the dangerous animals have claws. Not equivalent. This doesn t describe all animals with claws. 3. (3 points each) (For this question, no explanation for your answers is required. Recall that means is an element of and means is a subset of. Be careful!)

(a) Is {y} {x, y, z}? No. The elements of {x, y, z} are x, y, and z; {y} is not among these. (b) Is {y} {x, {y}, {{z}}}? Yes, it is one of the three elements on the right. (c) Is {42, 1119, {{ }}}? Yes, the empty set is a subset of any set. (d) How many elements are in the set {a, {b, c}}? Two, a and {b, c}. 4. (4 points each) Formally rewrite each of the following statements using appropriate truth variables, predicates, and quantifiers. Specify the domain for all your variables. For example, an answer may look like x Z ( P (x) Q(x) ) where you should say what P and Q are. (a) If it walks like a duck and it quacks like a duck, then it is a duck. Let D be the domain of all animals (or of all things, or any other reasonable set which includes ducks.) P (x): x walks like a duck. Q(x): x quacks like a duck. R(x): x is a duck. The statement is x D (P (x) Q(x) R(x)). (b) The sum of any two even integers is even. Let Z be the domain of all integers. P (x): x is even. The statement is x Z y Z (P (x) P (y) P (x + y)). There are other formulations which don t involve any arithmetic in the statement. example, let Q(x, y) be the statement x + y is even, and then you have For x Z y Z (P (x) P (y) Q(x, y)). 5. (5 points each) (For this question, no explanation for your answers is required.) Write negations of the following statements. (a) If Tom is Ann s father, then Jim is her uncle and Sue is her aunt. Negation: Tom is Ann s father, but either Jim is not her uncle or Sue is not her aunt. (You can use also the word and in place of but.)

(b) There is a computer program that gives the correct answer to every question that is posed to it. (Your answer should include the phrase does not give the correct answer.) Negation: For every computer program, there exists some question that can be posed to it for which it does not give the correct answer. 6. (10 points) Determine (with proof) whether the following statement forms are logically equivalent. p (q r), (p q) r. The statements are not logically equivalent. A truth table proof can be given: p q r q r p q p (q r) (p q) r T T T T T T T T T F F T F F T F T T F T T T F F T F T T F T T T T T T F T F F T T F F F T T T T T F F F T T T F We see that the last two columns are not the same, and so the statements are not equivalent. (In particular, when p is false, q is true, and r is false, we check that the first statement above is true, and the second is false.) 7. (6 points each) Formalize the arguments below using symbols, and identify whether each is valid or invalid. Explain your answer. You may explain using truth tables, informally in English, or by citing the logical rule of inference used by name. For at least one argument, please explain using truth tables. (a) If Frank studied hard for the test, then he got a good score. Frank did not get a good score. Therefore, Frank did not study hard for the test. Valid. Write p: Frank studied hard for the test. q: Frank got a good score. The argument is p q q p. This is modus tollens, a valid form of inference. This can be proved by the following truth table:

p q p q q p T T T F F T F F T F F T T F T F F T T T We must check that whenever both premises (the third and fourth columns) are true, the conclusion (the last) column is true. Thus, we only need to check the last row. (b) If there are as many rational numbers as there are irrational numbers, then the set of all irrational numbers is infinite. The set of all irrational numbers is infinite. Therefore, there are as many rational numbers as there are irrational numbers. Invalid. Write p: There are as many rational numbers as there are irrational numbers. q The set of all irrational numbers is infinite. The form of the argument is p q q p. This is the converse error which is an invalid method of inference. This can be proved by truth tables: p q p q q p T T T T T T F F F T F T T T F F F T F F We must check that whenever both premises (the third and fourth columns) are true, the conclusion (the last) column is true. Thus, we need to check the first and third rows, and the third row fails this test. 8. (6 points each) Indicate which of these statements are true and which are false. Explain your answers. (Z + indicates the positive integers.) (a) x Z +, y Z + such that x = y + 6. False. To show this is false, it is enough to find some counterexample. Let x be 3. Then if x = y + 6 then y must be 3, and 3 is not an element of Z +. (b) x R such that y R, x = y + 2. False. Suppose that there exists some x such that x = y + 2 for every y. However, the equation y = x 2 determines y uniquely (in terms of x). Therefore, this cannot be true for all values of y. 9. (6 points) Give an example (with explanation) of an argument which is valid but not sound. Naturally, answers will vary. Here is one example: If I am good at math, then I am a rock star.

I am good at math. Therefore, I am a rock star. The premises imply the conclusion and so the argument is valid. However, the first premise is not true (regrettably) and so the argument implies a false conclusion, making it unsound. 10. (6 points) What does it mean to say that sin(x) lim x 0 x 0? This means that for there exists some ɛ > 0 such that for every δ > 0, there exists x for which 0 < x 0 < δ but sin(x) 0 ɛ. x Equivalently, ( ) ( sin(x) ) ɛ > 0 δ < 0 x 0 < x 0 < δ 0 ɛ. x (Either of the above formulations is a good answer.)