In Class Problem Set #15

Size: px
Start display at page:

Download "In Class Problem Set #15"

Transcription

1 In Class Problem Set #15 CSE 1400 and MTH 2051 Fall 2012 Relations Definitions A relation is a set of ordered pairs (x, y) where x is related to y. Let denote a relational symbol. Write x y to express the predicate x is related to y. Reflexive: A relation is reflexive if for all x, x x. A relation is if for all x and y, x y implies y x. A relation is anti if for all x and y, x y and y x implies x = y. A relation is if for all x, y and z, x y and y z implies x z. ( x)(x x) Symmetric: ( x, y)((x y) (y x)) Anti: ( x, y)(((x y) (y x)) (x = y)) Transitive: ( x, y, z)(((x y) (y z)) (x z)) Problems 1. Use Boolean algebra to show that (x y) (y x) is equivalent to (y x) (x y). (x y) (y x) (x y) (y x) (y x) (x y) Note that (x y) (y x) and (y x) (x y) are two equivalent ways to state is a relation. 2. Use Boolean algebra to show that ((x y) (y x)) (x = y) is equivalent to (x = y) ((x y) (y x)).

2 in class problem set #15 2 (x y) (y x) x = y (x y) (y x) x = y x = y (x y) (y x) Note that ((x y) (y x)) (x = y) and (x = y) ((x y) (y x)) are two equivalent ways to state is an anti relation. 3. Use Boolean algebra to show that ((x y) (y z)) (x z) equivalent to (x z) ((x y) (y z)) (x y) (y z) (x z) (x y) (y z) (x z) (x z) (x y) (y z) Note that ((x y) (y z)) (x z) and (x z) ((x y) (y z)) are two equivalent ways to state is a relation. 4. For each relation (on the set R of real numbers), identify if it is reflexive,, anti, or. (a) Equality: x = y x = x is True, so equality is reflexive If x = y, then y = x is True, so equality is If x = y and y = x, then x = y is True, so equality is anti If x = y and y = z, then x = z is True, so equality is (b) Not equal: x = y x = x is False, so not equal is not reflexive

3 in class problem set #15 3 If x = y, then y = x is True, so not equal is If x = y and y = x, then x = y is False, so equal is not anti If x = y and y = z, then x = z is False, so not equality is not (c) Less than: x < y x < x is False, so less than is not reflexive If x < y, then y < x is False, so less than is not If (x < y and y < x), then x = y is True, so less than is anti (The conditional is True because the premise (x < y and y < x) is False) If x < y and y < z, then x < z is True, so less than is (d) Greater than or equal: x y x x is True, so greater than or equal is reflexive If x y, then y x is False, so greater than or equal is not If (x y and y x), then x = y is True, so greater than or equal is anti If x y and y z, then x z is True, so greater than or equal is (e) Equal magnitude: x = y x = x is True, so equal magnitude is reflexive If x = y, then y = x is True, so equal magnitude is If ( x = y and y = x ), then x = y is False, so equal magnitude is not anti If x = y and y = z, then x = z is True, so equal magnitude is (f) Approximately equal (within ɛ > 0): x y ɛ x = x is True, so equal magnitude is reflexive If x = y, then y = x is True, so equal magnitude is If ( x = y and y = x ), then x = y is False, so equal magnitude is not anti

4 in class problem set #15 4 If x = y and y = z, then x = z is True, so equal magnitude is 5. For each relation (on the set of geometric figures), identify if it is reflexive,, anti, or. (a) Parallel lines: L 0 L 1 L 0 L 0 is True, so parallel lines is reflexive If L 0 L 1, then L 1 L 0 is True, so parallel lines is If (L 0 L 1 and L 1 L 0 ), then L 0 = L 1 is False, so parallel lines is not anti If L 0 L 1 and L 1 L 2, then L 0 L 2 is True, so parallel lines is (b) Perpendicular lines: L 0 L 1 L 0 L 0 is False, so perpendicular lines is not reflexive If L 0 L 1, then L 1 L 0 is True, so perpendicular lines is If (L 0 L 1 and L 1 L 0 ), then L 0 = L 1 is False, so perpendicular lines is not anti If L 0 L 1 and L 1 L 2, then L 0 L 2 is False, so perpendicular lines is not (c) Similar triangles: T 0 T 1 (every angle in T 0 is equal to a corresponding angle in T 1 ) T 0 T 0 is True, so similar triangles is reflexive If T 0 T 1, then T 1 T 0 is True, so similar triangles is If (T 0 T 1 and T 1 T 0 ), then T 0 = T 1 is False, so similar triangles is not anti If T 0 T 1 and T 1 T 2, then T 0 T 2 is True, so similar triangles is (d) Congruent triangles: T 0 = T1 (every angle and side in T 0 is equal to a corresponding angle and side in T 1 ) T 0 = T0 is True, so congruent triangles is reflexive If T 0 = T1, then T 1 = T0 is True, so congruent triangles is If (T 0 = T1 and T 1 = T0 ), then T 0 = T 1 is False, so congruent triangles is not anti

5 If T 0 = T1 and T 1 = T2, then T 0 = T2 is True, so congruent triangles is in class problem set #15 5

Disproving Conjectures with Counterexamples

Disproving Conjectures with Counterexamples Disproving Conjectures with Counterexamples Consider the simple conjecture given below. If two lines are both intersected by a transversal, then they are parallel. This conjecture is false: two lines do

More information

' Liberty and Umou Ono and Inseparablo "

' Liberty and Umou Ono and Inseparablo 3 5? #< q 8 2 / / ) 9 ) 2 ) > < _ / ] > ) 2 ) ) 5 > x > [ < > < ) > _ ] ]? <

More information

Logic, Set Theory and Computability [M. Coppenbarger]

Logic, Set Theory and Computability [M. Coppenbarger] 7 Relations (Handout) Definition 7-1: A set r is a relation from X to Y if r X Y. If X = Y, then r is a relation on X. Definition 7-2: Let r be a relation from X to Y. The domain of r, denoted dom r, is

More information

Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST

Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and

More information

If two sides of a triangle are congruent, then it is an isosceles triangle.

If two sides of a triangle are congruent, then it is an isosceles triangle. 1. What is the hypothesis of the conditional statement If two sides of a triangle are congruent, then it is an isosceles triangle. two sides of a triangle are congruent it is an isosceles triangle If two

More information

Bob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 Linear, Compound, and Absolute Value Inequalities

Bob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 Linear, Compound, and Absolute Value Inequalities Bob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 What is the following symbol? < The inequality symbols < > are used to compare two real numbers. The meaning of anyone of

More information

Q SON,' (ESTABLISHED 1879L

Q SON,' (ESTABLISHED 1879L ( < 5(? Q 5 9 7 00 9 0 < 6 z 97 ( # ) $ x 6 < ( ) ( ( 6( ( ) ( $ z 0 z z 0 ) { ( % 69% ( ) x 7 97 z ) 7 ) ( ) 6 0 0 97 )( 0 x 7 97 5 6 ( ) 0 6 ) 5 ) 0 ) 9%5 z» 0 97 «6 6» 96? 0 96 5 0 ( ) ( ) 0 x 6 0

More information

Name: Class: Date: B. The twentieth term is A. D. There is not enough information.

Name: Class: Date: B. The twentieth term is A. D. There is not enough information. Class: Date: Chapter 2 Review 1. Based on the pattern, what are the next two terms of the sequence? 9, 15, 21, 27,... A. 33, 972 B. 39, 45 C. 162, 972 D. 33, 39 2. What conjecture can you make about the

More information

Name Geometry Common Core Regents Review Packet - 3. Topic 1 : Equation of a circle

Name Geometry Common Core Regents Review Packet - 3. Topic 1 : Equation of a circle Name Geometry Common Core Regents Review Packet - 3 Topic 1 : Equation of a circle Equation with center (0,0) and radius r Equation with center (h,k) and radius r ( ) ( ) 1. The endpoints of a diameter

More information

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra. Section 2.2 Set Operations Propositional calculus and set theory are both instances of an algebraic system called a Boolean Algebra. The operators in set theory are defined in terms of the corresponding

More information

Chapter 2 Practice Test

Chapter 2 Practice Test Name: Class: Date: ID: A Chapter 2 Practice Test 1. What is a counterexample for the conjecture? Conjecture: Any number that is divisible by 4 is also divisible by 8. 2. What is the conclusion of the following

More information

Instructional Goal Terminal Objective Assessment Item Students will generate twocolumn

Instructional Goal Terminal Objective Assessment Item Students will generate twocolumn eport Two Objectives Instructional Goal Terminal Objective ssessment Item Students will generate twocolumn geometric proofs. PS Given a statement to be proven, a diagram, and a given statement student

More information

Algebra 1 (cp) Midterm Review Name: Date: Period:

Algebra 1 (cp) Midterm Review Name: Date: Period: Algebra 1 (cp) Midterm Review Name: Date: Period: Chapter 1 1. Evaluate the variable expression when j 4. j 44 [1] 2. Evaluate the variable expression when j 4. 24 j [2] 3. Find the perimeter of the rectangle.

More information

Part I Directions: MULTIPLE CHOICE Place your answer to each question on the space provided. 1. Which is equivalent to the equation y? 4.

Part I Directions: MULTIPLE CHOICE Place your answer to each question on the space provided. 1. Which is equivalent to the equation y? 4. Name: Date: Block: Algebra I Practice Midterm Exam Part I Directions: MULTIPLE CHOICE Place your answer to each question on the space provided. 3x z. Which is equivalent to the equation y? 4 3x z (a) x

More information

CHAPTER 3 BOOLEAN ALGEBRA

CHAPTER 3 BOOLEAN ALGEBRA CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus

More information

right angle an angle whose measure is exactly 90ᴼ

right angle an angle whose measure is exactly 90ᴼ right angle an angle whose measure is exactly 90ᴼ m B = 90ᴼ B two angles that share a common ray A D C B Vertical Angles A D C B E two angles that are opposite of each other and share a common vertex two

More information

Algebra 1. Predicting Patterns & Examining Experiments. Unit 5: Changing on a Plane Section 4: Try Without Angles

Algebra 1. Predicting Patterns & Examining Experiments. Unit 5: Changing on a Plane Section 4: Try Without Angles Section 4 Examines triangles in the coordinate plane, we will mention slope, but not angles (we will visit angles in Unit 6). Students will need to know the definition of collinear, isosceles, and congruent...

More information

2.5 Justify a Number Trick

2.5 Justify a Number Trick Investigating g Geometry ACTIVITY Use before Lesson 2.5 2.5 Justify a Number Trick MATERIALS paper pencil QUESTION How can you use algebra to justify a number trick? Number tricks can allow you to guess

More information

Neatest and Promptest Manner. E d i t u r ami rul)lihher. FOIt THE CIIILDIIES'. Trifles.

Neatest and Promptest Manner. E d i t u r ami rul)lihher. FOIt THE CIIILDIIES'. Trifles. » ~ $ ) 7 x X ) / ( 8 2 X 39 ««x» ««! «! / x? \» «({? «» q «(? (?? x! «? 8? ( z x x q? ) «q q q ) x z x 69 7( X X ( 3»«! ( ~«x ««x ) (» «8 4 X «4 «4 «8 X «x «(» X) ()»» «X «97 X X X 4 ( 86) x) ( ) z z

More information

Introduction to Kleene Algebras

Introduction to Kleene Algebras Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)

More information

CSE 1400 Applied Discrete Mathematics Definitions

CSE 1400 Applied Discrete Mathematics Definitions CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine

More information

10.4 The Cross Product

10.4 The Cross Product Math 172 Chapter 10B notes Page 1 of 9 10.4 The Cross Product The cross product, or vector product, is defined in 3 dimensions only. Let aa = aa 1, aa 2, aa 3 bb = bb 1, bb 2, bb 3 then aa bb = aa 2 bb

More information

Unit 3 Factors & Products

Unit 3 Factors & Products 1 Unit 3 Factors & Products General Outcome: Develop algebraic reasoning and number sense. Specific Outcomes: 3.1 Demonstrate an understanding of factors of whole number by determining the: o prime factors

More information

2-6 Geometric Proof. Warm Up Lesson Presentation Lesson Quiz. Holt Geometry

2-6 Geometric Proof. Warm Up Lesson Presentation Lesson Quiz. Holt Geometry 2-6 Geometric Proof Warm Up Lesson Presentation Lesson Quiz Warm Up Determine whether each statement is true or false. If false, give a counterexample. 1. It two angles are complementary, then they are

More information

CHAPTER 2 BOOLEAN ALGEBRA

CHAPTER 2 BOOLEAN ALGEBRA CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,

More information

Logic and Modelling. Introduction to Predicate Logic. Jörg Endrullis. VU University Amsterdam

Logic and Modelling. Introduction to Predicate Logic. Jörg Endrullis. VU University Amsterdam Logic and Modelling Introduction to Predicate Logic Jörg Endrullis VU University Amsterdam Predicate Logic In propositional logic there are: propositional variables p, q, r,... that can be T or F In predicate

More information

CSC Discrete Math I, Spring Relations

CSC Discrete Math I, Spring Relations CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:

More information

Answer: A. Answer: C. 3. If (G,.) is a group such that a2 = e, a G, then G is A. abelian group B. non-abelian group C. semi group D.

Answer: A. Answer: C. 3. If (G,.) is a group such that a2 = e, a G, then G is A. abelian group B. non-abelian group C. semi group D. 1. The set of all real numbers under the usual multiplication operation is not a group since A. zero has no inverse B. identity element does not exist C. multiplication is not associative D. multiplication

More information

D I S C R E T E M AT H E M AT I C S H O M E W O R K

D I S C R E T E M AT H E M AT I C S H O M E W O R K D E PA R T M E N T O F C O M P U T E R S C I E N C E S C O L L E G E O F E N G I N E E R I N G F L O R I D A T E C H D I S C R E T E M AT H E M AT I C S H O M E W O R K W I L L I A M S H O A F F S P R

More information

Homework 1/Solutions. Graded Exercises

Homework 1/Solutions. Graded Exercises MTH 310-3 Abstract Algebra I and Number Theory S18 Homework 1/Solutions Graded Exercises Exercise 1. Below are parts of the addition table and parts of the multiplication table of a ring. Complete both

More information

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)

More information

Geometry Note Cards EXAMPLE:

Geometry Note Cards EXAMPLE: Geometry Note Cards EXAMPLE: Lined Side Word and Explanation Blank Side Picture with Statements Sections 12-4 through 12-5 1) Theorem 12-3 (p. 790) 2) Theorem 12-14 (p. 790) 3) Theorem 12-15 (p. 793) 4)

More information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 2 Boolean Algebra and Logic Gates Chapter 2 Boolean Algebra and Logic Gates Huntington Postulates 1. (a) Closure w.r.t. +. (b) Closure w.r.t.. 2. (a) Identity element 0 w.r.t. +. x + 0 = 0 + x = x. (b) Identity element 1 w.r.t.. x 1 =

More information

Sec 3 Express E-Math & A-Math Syllabus (For Class 301 to 305)

Sec 3 Express E-Math & A-Math Syllabus (For Class 301 to 305) Sec 3 Express E-Math & A-Math Syllabus (For Class 301 to 305) Chapter 1 (EM) Quadratic Equations and Chapter 4 (EM) Coordinate Geometry Chapter 6 (EM) Further Trigonometry Chapter 2 (EM) Linear Inequalities

More information

Lesson 3-7: Absolute Value Equations Name:

Lesson 3-7: Absolute Value Equations Name: Lesson 3-7: Absolute Value Equations Name: In this activity, we will learn to solve absolute value equations. An absolute value equation is any equation that contains an absolute value symbol. To start,

More information

Homework 5 Solutions

Homework 5 Solutions Homework 5 Solutions ECS 0 (Fall 17) Patrice Koehl koehl@cs.ucdavis.edu February 8, 019 Exercise 1 a) Show that the following statement is true: If there exist two integers n and m such that n + n + 1

More information

In this episode of The Verification Corner, Rustan Leino talks about Loop Invariants. He gives a brief summary of the theoretical foundations and

In this episode of The Verification Corner, Rustan Leino talks about Loop Invariants. He gives a brief summary of the theoretical foundations and In this episode of The Verification Corner, Rustan Leino talks about Loop Invariants. He gives a brief summary of the theoretical foundations and shows how a program can sometimes be systematically constructed

More information

Predicates and Quantifiers

Predicates and Quantifiers Predicates and Quantifiers Lecture 9 Section 3.1 Robb T. Koether Hampden-Sydney College Wed, Jan 29, 2014 Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 1 / 32 1

More information

14 Equivalence Relations

14 Equivalence Relations 14 Equivalence Relations Tom Lewis Fall Term 2010 Tom Lewis () 14 Equivalence Relations Fall Term 2010 1 / 10 Outline 1 The definition 2 Congruence modulo n 3 Has-the-same-size-as 4 Equivalence classes

More information

Undecidability of the validity problem

Undecidability of the validity problem Undecidability of the validity problem We prove the undecidability of the validity problem for formulas of predicate logic with equality. Recall: there is an algorithm that given a formula of predicate

More information

Questions. Exercise (1)

Questions. Exercise (1) Questions Exercise (1) (1) hoose the correct answer: 1) The acute angle supplements. angle. a) acute b) obtuse c) right d) reflex 2) The right angle complements angle whose measure is. a) 0 b) 45 c) 90

More information

Chapter 2: Switching Algebra and Logic Circuits

Chapter 2: Switching Algebra and Logic Circuits Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used

More information

Informal Statement Calculus

Informal Statement Calculus FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example

More information

Unit 1: Introduction to Proof

Unit 1: Introduction to Proof Unit 1: Introduction to Proof Prove geometric theorems both formally and informally using a variety of methods. G.CO.9 Prove and apply theorems about lines and angles. Theorems include but are not restricted

More information

CLASSICAL EXTENSIONAL MEREOLOGY. Mereology

CLASSICAL EXTENSIONAL MEREOLOGY. Mereology 1 Mereology Core axioms and concepts parthood sum Higher order properties: cumulativity divisivity (aka divisiveness) atomicity 2 Mereology is the theory of parthood derived from the Greek µέρος (meros)

More information

CSE 311: Foundations of Computing. Lecture 10: Set Operations & Representation, Modular Arithmetic

CSE 311: Foundations of Computing. Lecture 10: Set Operations & Representation, Modular Arithmetic CSE 311: Foundations of Computing Lecture 10: Set Operations & Representation, Modular Arithmetic Definitions A and B are equalif they have the same elements A = B x(x A x B) A is a subsetof B if every

More information

The following statements are conditional: Underline each hypothesis and circle each conclusion.

The following statements are conditional: Underline each hypothesis and circle each conclusion. Geometry Unit 2 Reasoning and Proof 2-1 Conditional Statements Conditional Statement a statement which has a hypothesis and conclusion, often called an if-then statement. Conditional statements are contain

More information

Alg. Exercise (1) Department : Math Form : 1 st prep. Sheet. [1] Complete : 1) Rational number is 2) The set of integer is.. 3) If. is rational if x.

Alg. Exercise (1) Department : Math Form : 1 st prep. Sheet. [1] Complete : 1) Rational number is 2) The set of integer is.. 3) If. is rational if x. airo Governorate Nozha irectorate of Education Nozha Language Schools Ismailia Road epartment : Math Form : 1 st prep. Sheet [1] omplete : lg. Exercise (1) 1) Rational number is ) The set of integer is..

More information

Chapter 2-Reasoning and Proof

Chapter 2-Reasoning and Proof Chapter 2-Reasoning and Proof Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Identify the hypothesis and conclusion of this conditional statement: If

More information

Math 75 Mini-Mod Due Dates Spring 2016

Math 75 Mini-Mod Due Dates Spring 2016 Mini-Mod 1 Whole Numbers Due: 4/3 1.1 Whole Numbers 1.2 Rounding 1.3 Adding Whole Numbers; Estimation 1.4 Subtracting Whole Numbers 1.5 Basic Problem Solving 1.6 Multiplying Whole Numbers 1.7 Dividing

More information

ALGEBRA I: State Standards, MPS Objectives and Essential Learnings

ALGEBRA I: State Standards, MPS Objectives and Essential Learnings ALGEBRA I: s, s and s MA 12.1 Students will communicate number sense concepts using multiple representations to reason, solve problems, and make connections within mathematics and across disciplines. MA

More information

B C. You try: What is the definition of an angle bisector?

B C. You try: What is the definition of an angle bisector? US Geometry 1 What is the definition of a midpoint? The midpoint of a line segment is the point that divides the segment into two congruent segments. That is, M is the midpoint of if M is on and M M. 1

More information

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas.

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas. SETS: set is a well-defined collection of objects. SET THEORY The objects in a set are called elements or members of the set. If x is an object of set, we write x and is read as x is an element of set

More information

Geometry Advanced Fall Semester Exam Review Packet -- CHAPTER 1

Geometry Advanced Fall Semester Exam Review Packet -- CHAPTER 1 Name: Class: Date: Geometry Advanced Fall Semester Exam Review Packet -- CHAPTER 1 Multiple Choice. Identify the choice that best completes the statement or answers the question. 1. Which statement(s)

More information

Hong Kong Institute of Vocational Education (Tsing Yi) Higher Diploma in Civil Engineering Structural Mechanics. Chapter 2 SECTION PROPERTIES

Hong Kong Institute of Vocational Education (Tsing Yi) Higher Diploma in Civil Engineering Structural Mechanics. Chapter 2 SECTION PROPERTIES Section Properties Centroid The centroid of an area is the point about which the area could be balanced if it was supported from that point. The word is derived from the word center, and it can be though

More information

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets

More information

CSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4

CSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4 CSE 20 Lecture 4: Introduction to Boolean algebra Reminder First quiz will be on Friday (17th January) in class. It is a paper quiz. Syllabus is all that has been done till Wednesday. If you want you may

More information

EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS

EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) LIOR SILBERMAN Version 1.0 compiled September 9, 2015. 1.1. List of examples. 1. RELATIONS Equality of real numbers: for some x,y R we have x = y. For other pairs

More information

Using Definitions and Theorems in Proofs

Using Definitions and Theorems in Proofs Using efinitions and Theorems in Proofs midpoint divides a segment into 2 segments midpoint divides a segment in half bisector intersects a segments at its midpoint n angle bisector divides an angle into

More information

Redlands High School

Redlands High School Redlands High School Dear Math I Honors Students, Familiarity with pre high school math topics is essential for success in Integrated Math I Honors class. The majority of the questions in Math I require

More information

HSED Math Course Outcome Summary

HSED Math Course Outcome Summary Wisconsin Technical College System HSED 5.09 - Math Course Outcome Summary Course Information Description Learners will apply math concepts in real-world context including financial literacy consumer applications.

More information

Propositional Logic: Models and Proofs

Propositional Logic: Models and Proofs Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505

More information

CSE 311: Foundations of Computing. Lecture 10: Set Operations & Representation, Modular Arithmetic

CSE 311: Foundations of Computing. Lecture 10: Set Operations & Representation, Modular Arithmetic CSE 311: Foundations of Computing Lecture 10: Set Operations & Representation, Modular Arithmetic Definitions A and B are equalif they have the same elements A = B x(x A x B) A is a subsetof B if every

More information

Binary Logic and Gates. Our objective is to learn how to design digital circuits.

Binary Logic and Gates. Our objective is to learn how to design digital circuits. Binary Logic and Gates Introduction Our objective is to learn how to design digital circuits. These circuits use binary systems. Signals in such binary systems may represent only one of 2 possible values

More information

Integrated Math III. IM3.1.2 Use a graph to find the solution set of a pair of linear inequalities in two variables.

Integrated Math III. IM3.1.2 Use a graph to find the solution set of a pair of linear inequalities in two variables. Standard 1: Algebra and Functions Students solve inequalities, quadratic equations, and systems of equations. They graph polynomial, rational, algebraic, and piece-wise defined functions. They graph and

More information

NAME DATE PERIOD. Inductive Reasoning and Conjecture. Make a conjecture based on the given information. Draw a figure to illustrate your conjecture.

NAME DATE PERIOD. Inductive Reasoning and Conjecture. Make a conjecture based on the given information. Draw a figure to illustrate your conjecture. 2-1 NAME DATE PERIOD Skills Practice Inductive Reasoning and Conjecture Make a conjecture about the next item in each sequence. 1. 2. 4, 1, 2, 5, 8 3. 6, 1 1, 5, 9 2 2,4 4. 2, 4, 8, 16, 32 Make a conjecture

More information

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and

More information

Chapter 5 Vocabulary:

Chapter 5 Vocabulary: Geometry Week 11 ch. 5 review sec. 6.3 ch. 5 review Chapter 5 Vocabulary: biconditional conclusion conditional conjunction connective contrapositive converse deductive reasoning disjunction existential

More information

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B. Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets

More information

1 Fundamental Concepts From Algebra & Precalculus

1 Fundamental Concepts From Algebra & Precalculus Fundamental Concepts From Algebra & Precalculus. Review Exercises.. Simplify eac expression.. 5 7) [ 5)) ]. ) 5) 7) 9 + 8 5. 8 [ 5) 8 6)] [9 + 8 5 ]. 9 + 8 5 ) 8) + 5. 5 + [ )6)] 7) 7 + 6 5 6. 8 5 ) 6

More information

Digital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus.

Digital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus. Chapter 2 Digital Electronics Objectives 1. Understand the operation of basic digital electronic devices. 2. Understand how to describe circuits which can process digital data. 3. Understand how to design

More information

Geometry Chapter 2 Practice Free Response Test

Geometry Chapter 2 Practice Free Response Test Geometry Chapter 2 Practice Free Response Test Directions: Read each question carefully. Show ALL work. No work, No credit. This is a closed note and book test.. Identify Hypothesis and Conclusion of the

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part

More information

Chapter 2. Reasoning and Proof

Chapter 2. Reasoning and Proof Chapter 2 Reasoning and Proof 2.1 Inductive Reasoning 2.2 Analyze Conditional Statements 2.3 Apply Deductive Reasoning 2.4 Use Postulates and Diagrams 2.5 Algebraic Proofs 2.6 Segments and Angles Proofs

More information

Section 1.1 Notes. Real Numbers

Section 1.1 Notes. Real Numbers Section 1.1 Notes Real Numbers 1 Types of Real Numbers The Natural Numbers 1,,, 4, 5, 6,... These are also sometimes called counting numbers. Denoted by the symbol N Integers..., 6, 5, 4,,, 1, 0, 1,,,

More information

5.6 Inequalities in Two Triangles

5.6 Inequalities in Two Triangles 5.6 Inequalities in Two Triangles and Indirect Proof Goal p Use inequalities to make comparisons in two triangles. Your Notes VOULRY Indirect Proof THEOREM 5.13: HINGE THEOREM If two sides of one triangle

More information

Chapter 2: The Logic of Quantified Statements

Chapter 2: The Logic of Quantified Statements Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y

More information

Practice Midterm Exam Solutions

Practice Midterm Exam Solutions CSE 311: Foundations of Computing I Practice Midterm Exam Solutions Name: Sample Solutions ID: TA: Section: INSTRUCTIONS: You have 50 minutes to complete the exam. The exam is closed book. You may not

More information

A. H. Hall, 33, 35 &37, Lendoi

A. H. Hall, 33, 35 &37, Lendoi 7 X x > - z Z - ----»»x - % x x» [> Q - ) < % - - 7»- -Q 9 Q # 5 - z -> Q x > z»- ~» - x " < z Q q»» > X»? Q ~ - - % % < - < - - 7 - x -X - -- 6 97 9

More information

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017 3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,

More information

Lecture 2: Axiomatic semantics

Lecture 2: Axiomatic semantics Chair of Software Engineering Trusted Components Prof. Dr. Bertrand Meyer Lecture 2: Axiomatic semantics Reading assignment for next week Ariane paper and response (see course page) Axiomatic semantics

More information

Diocese of Erie Mathematics Curriculum Eighth Grade August 2012

Diocese of Erie Mathematics Curriculum Eighth Grade August 2012 The Number System 8.NS Know that there are numbers that are not rational, and approximate them by rational numbers 1 1. Know that numbers that are not rational are called irrational. 1 2. Understand informally

More information

MTH202 Discrete Mathematics

MTH202 Discrete Mathematics LATSEST MCQS FROM MIDTERM PAPERS 10 MAY 011 MC10040185 moaaz.pk@gmail.com Moaaz siddiq MTH0 Discrete Mathematics Question No. 1: If p= It is raining q = She will go to college "It is raining and she will

More information

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows. Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is

More information

NAEP Questions, Pre-Algebra, Unit 13: Angle Relationships and Transformations

NAEP Questions, Pre-Algebra, Unit 13: Angle Relationships and Transformations NAEP Questions, Pre-Algebra, Unit 13: Angle Relationships and Transformations SOURCE: U.S. Department of Education, Institute of Education Sciences, National Center for Education Statistics, National Assessment

More information

Kleene Algebra and Arden s Theorem. Anshul Kumar Inzemamul Haque

Kleene Algebra and Arden s Theorem. Anshul Kumar Inzemamul Haque Kleene Algebra and Arden s Theorem Anshul Kumar Inzemamul Haque Motivation Regular Expression is a Kleene Algebra. We can use the properties and theorems of Kleene Algebra to simplify regular expressions

More information

GEOMETRY CHAPTER 2 REVIEW / PRACTICE TEST

GEOMETRY CHAPTER 2 REVIEW / PRACTICE TEST GEOMETRY CHAPTER 2 REVIEW / PRACTICE TEST Name: Date: Hour: SECTION 1: Rewrite the conditional statement in If-Then Form. Then write its Converse, Inverse, and Contrapositive. 1) Adjacent angles share

More information

ECE 238L Boolean Algebra - Part I

ECE 238L Boolean Algebra - Part I ECE 238L Boolean Algebra - Part I August 29, 2008 Typeset by FoilTEX Understand basic Boolean Algebra Boolean Algebra Objectives Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand

More information

Name: Class: IM8 Block:

Name: Class: IM8 Block: Name: Block: Class: IM8 Investigation 1: Mathematical Properties and Order of Operations Mathematical Properties 2 Practice Level 1: Write the name of the property shown in the examples below. 1. 4 + 5

More information

Chapter 8: Right Triangles Topic 5: Mean Proportions & Altitude Rules

Chapter 8: Right Triangles Topic 5: Mean Proportions & Altitude Rules Name: Date: Do Now: Use the diagram to complete all parts: a) Find all three angles in each triangle. Chapter 8: Right Triangles Topic 5: Mean Proportions & Altitude Rules b) Find side ZY c) Are these

More information

Binary Logic and Gates

Binary Logic and Gates 1 COE 202- Digital Logic Binary Logic and Gates Dr. Abdulaziz Y. Barnawi COE Department KFUPM 2 Outline Introduction Boolean Algebra Elements of Boolean Algebra (Binary Logic) Logic Operations & Logic

More information

Indicate the answer choice that best completes the statement or answers the question. Find the volume of the solid.

Indicate the answer choice that best completes the statement or answers the question. Find the volume of the solid. Indicate the answer choice that best completes the statement or answers the question. Find the volume of the solid. A. 252.4 cm 3 B. 126.2 cm 3 C. 492.2 cm 3 D. 703.8 cm 3 F. 576 G. 288 H. 240 I. 336 Powered

More information

NAME DATE PER. 1. ; 1 and ; 6 and ; 10 and 11

NAME DATE PER. 1. ; 1 and ; 6 and ; 10 and 11 SECOND SIX WEEKS REVIEW PG. 1 NME DTE PER SECOND SIX WEEKS REVIEW Using the figure below, identify the special angle pair. Then write C for congruent, S for supplementary, or N for neither. d 1. ; 1 and

More information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

More information

FLORIDA STANDARDS TO BOOK CORRELATION FOR GRADE 7 ADVANCED

FLORIDA STANDARDS TO BOOK CORRELATION FOR GRADE 7 ADVANCED FLORIDA STANDARDS TO BOOK CORRELATION FOR GRADE 7 ADVANCED After a standard is introduced, it is revisited many times in subsequent activities, lessons, and exercises. Domain: The Number System 8.NS.1.1

More information

Int. Geometry Unit 2 Test Review 1

Int. Geometry Unit 2 Test Review 1 Int. Geometry Unit Test Review irections -: Use the diagram to determine if the angles are vertical, adjacent, supplementary, complementary, or a linear pair. Write all that apply.. and. and 6 0. 8 and

More information

Geometry CP - Ch. 4 Review

Geometry CP - Ch. 4 Review Geometry CP - Ch. 4 Review 1. If, which of the following can you NOT conclude as being true? A. B. C. D. 2. A. B. C. D. 3. Given and, find the length of QS and TV. A. 7 B. 25 C. 8 D. 2 4. The two triangles

More information

Integrated Math II. IM2.1.2 Interpret given situations as functions in graphs, formulas, and words.

Integrated Math II. IM2.1.2 Interpret given situations as functions in graphs, formulas, and words. Standard 1: Algebra and Functions Students graph linear inequalities in two variables and quadratics. They model data with linear equations. IM2.1.1 Graph a linear inequality in two variables. IM2.1.2

More information

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS

More information