Wollongong College Australia

Size: px
Start display at page:

Download "Wollongong College Australia"

Transcription

1 Wollongong College Australia University of Wollongong Diploma in Information Technology WUCT121 Discrete Mathematics Mid-Term Test #2 Autumn Session 2008 SOLUTIONS Time Allowed: 50 minutes DIRECTIONS TO CANDIDATES Total No. of Questions: 4 All questions are to be attempted. You may answer the questions in any sequence. Questions are NOT of equal value. All Notation is as used in lectures. Working ( including all necessary reasoning ) is to be shown for all solutions. No examination aids or materials are allowed. Programmable Calculators are permitted. Electronic dictionaries are NOT permitted. This exam represents 10% of the total subject marks. ITC Education Ltd trading as Wollongong College Australia CRICOS 02723D ABN

2 Question 1 (a) Define or otherwise explain the following terms in relation to the set of integers Ÿ: (i) Law of Trichotomy. "x, y Œ Ÿ (x = y, x > y or x < y) Law of Trichotomy Distributivity. "x, y, z Œ Ÿ (x (y + z) = x y + x z) Distributive Law (iii) Commutativity under ordinary multiplication. "x, y Œ Ÿ ( x y = y x ) Commutative Law for Multiplication (iv) Associativity under ordinary addition. "x, y, z Œ Ÿ ( x + ( y + z ) = ( x + y ) + z ) Associative Law for Addition (b) Explain whether the set of integers Ÿ is well-ordered. For a set S to be well-ordered, any non-empty subset of S must have a least element. In the case of the set of integers Ÿ, the set E of even integers i.e. {, -4, -2, 0, 2, 4, } is a non-empty subset of Ÿ, but E has no least member. Consequently, the set of integers Ÿ is not well-ordered. (c) Consider the set B = {-1, 0, 1}. (i) Determine, giving reasons, which of ordinary addition, ordinary subtraction, ordinary multiplication, and ordinary division is a closed operation on B. Under ordinary addition = 2, but 2 œ B. Hence, B is not closed under ordinary addition. Under ordinary subtraction -1-1 = -2, but -2 œ B. Hence, B is not closed under ordinary subtraction. Under ordinary multiplication -1-1 = 1, and 1 Œ B; -1 0 = 0 and 0 Œ B; -1 1 = -1 and -1 Œ B; 0 0 = 0 and 0 Œ B; 0 1 = 0 and 0 Œ B; 1 1 = 1 and 1 Œ B. Hence, B is closed under ordinary multiplication. Under ordinary division (which excludes division by 0) -1-1 = 1, and 1 Œ B; -1 1 = -1 and -1 Œ B; 0-1 = 0 and 0 Œ B; 0 1 = 0 and 0 Œ B; 1 1 = 1 and 1 Œ B. Hence, B is closed under ordinary division. Determine, giving reasons, the Identity elements under the operations of addition and multiplication in B. "x Œ B ( 0 + x = x + 0 = x ), so 0 is the Identity for Addition in set B. "x Œ B ( 1 x = x 1 = x ), so 1 is the Identity for Multiplication in set B. WCA-WUCT121-EXMST2 1

3 (iii) Determine the additive inverses and the multiplicative inverses of those elements of B that have multiplicative inverse elements. "x Œ B, if $ y Œ B ( x + y = y + x = 0 ) then y is termed the additive inverse of x and vice versa. From ordinary addition = 0, so 1 and 1 are additive inverses of each other. Since = 0, 0 is its own additive inverse. "x Œ B, if $ y Œ B ( x y = y x = 1 ) then y is termed the multiplicative inverse of x and vice versa. From Q1(c) for ordinary multiplication -1-1 = 1 so -1 is its own multiplicative inverse and 1. Also, as 1 1 = 1, 1 is its own multiplicative inverse. 0 does not have a multiplicative inverse. Marks: (a) (i) (iv) 2 each; (b) 4; (c) (i) 2, 2, 4, 4; 2, 2; (iii) 3,3. Total marks = 34. Question 2 (a) (i) What is the smallest number m Œ Õ for which m! > 4 m? 8! = 40,320 < 4 8 = 65,536, but 9! = 362,880 > 4 9 = 262,144. So, m = 9. Use the Generalised Principle of mathematical induction to prove that n! > 4 n for all natural numbers n m. Let Claim (n) be n! > 4 n for all natural numbers n 9. Claim (9) is 9! > 4 9 Since LHS = and RHS = , LHS > RHS, and so Claim (9) is true. Assume that Claim (k) is true for some k 9 i.e. k! > 4 k Try to prove that Claim (k + 1) is also true, i.e. (k+1)! > 4 (k+1) LHS = (k + 1).k! > (k+1).4 k using Claim(k) > (4).4 k since k 9 > 4 (k+1) = RHS Therefore, given Claim (k) is true, Claim (k + 1) is also true, and so by the Generalised Principle of Mathematical Induction, Claim(n) must be true for all integers n 1. End of Proof. (b) Prove by mathematical induction that for all n Œ Õ, 15 n 7 n is divisible by 8. Let Claim (n) be 15 n 7 n is divisible by 8 for all natural numbers n Œ Õ. Claim (1) is Since = 15 7 = 8 and 8 8 Claim (1) is true. Assume that Claim (k) is true for some k 8 15 k 7 k i.e. $ l Œ Ÿ such that 8l = 15 k 7 k Try to prove that Claim (k + 1) is also true, i.e k+1 7 k+1 WCA-WUCT121-EXMST2 2

4 Now 15 k+1 7 k+1 = (8 + 7) 15 k 7 7 k = 8 15 k + 7 (15 k 7 k ) = 8 15 k + 7 (8l) using Claim (k) = 8 (15 k + 7l) i.e k+1 7 k+1, so Claim (k + 1) is also true. Therefore, by the Principle of Mathematical Induction, Claim (n) is true for all natural numbers n. (c) Given that u n+2 = 3u n+1-2u n for all n Œ Õ, u 1 = 5 and u 2 = 3, (i) Prove or disprove the statement that u n 0 for all natural numbers. u 1 0, u 2 0, but u 3 = 3 u 2 2 u 1 = = -1 < 0, therefore the statement that u n 0 for all natural numbers is false. Use the Strong Principle of Induction to prove that u n is odd for all n Œ Õ. Let Claim (n) be u n is odd for all n Œ Õ. Claim (1) is true as u 1 = 5 is odd. Claim (2) is true as u 2 = 3 is odd. Assume that Claim (k) and Claim (k - 1),, Claim (1) are true for some arbitrary natural number k 2, that is, u k is odd $ p Œ Õ (u k = 2p - 1) u k-1 is odd $ q Œ Õ (u k-1 = 2q - 1) Try to prove that Claim (k + 1) is also true, that is, u k+1 is odd i.e. $ r Œ Õ (u k+1 = 2r - 1) Now u k+1 = 3u k - 2u k-1 using recursive definition of u k+1 = 3(2p - 1) - 2(2q - 1) using Claim (k), Claim (k - 1) = 6p - 3-4q - 2 = 6p - 4q - 5 = 6p - 4q = 2(3p - 2q - 2) - 1 = 2r - 1, where r = (3p - 2q - 2) Œ Õ So u k+1 is odd if Claim (k) and Claim (k - 1) are true. Therefore, by the Strong Principle of Mathematical Induction, Claim (n) is true for all natural numbers n. Marks: (a)(i) 4; 10; (b) 10; (c)(i) 3; 14. Total marks 41. Question 3 (a) Define or otherwise explain the following logical rules: WCA-WUCT121-EXMST2 3

5 (i) Modus Ponens. If p and q are logical predicates then (p Ÿ (p fi q)) fi q Law of Syllogism. If p, q and r are logical predicates then ((p fi q) Ÿ (q fi r)) fi (p fi r) (b) Consider the following statement: If a product of two positive real numbers is greater than 100, then at least one of the numbers is greater than 10. Prove this statement using proof by contradiction. This statement is of the form P fi Q. To prove it by contradiction, consider the statement ~Q i.e. both of two real positive numbers are less than 10. Clearly, the product of two such numbers, each less than 10, must be less than 100. Consequently, ~Q fi ~P so that P fi Q is proven. (c) Show by a direct proof that 9y y - 1. " y Œ, 9y y - 1 9y 2-12y (3y 2) 2 0, but " x Œ, x 2 0 and " y Œ, 3y 2 Œ, so (3y 2) 2 0 is a true statement. Hence, the logically equivalent statement 9y y 1 is also true. (d) Consider the following statements: If 5 is greater than 8, then 29 is not a prime number. However, 5 is not greater than 8. Therefore, 29 is a prime number. Translate these statements into symbolic notation and, using a truth table, show whether or not they form a valid argument. Let p be the statement: 5 is greater than 8. Let q be the statement: 29 is a prime number. Let r be the compound statement: pfi ~q Let s be the statement: ~p The given argument then takes the form rÿ sfi q and is a valid argument iff rÿ sfi q is a tautology. This is tested in the truth table below. p q p fi ~q ~p (p fi ~q) ~p ((p fi ~q) ~p) fi q T T F F F T T F T F F T F T T T T T F F T T T F WCA-WUCT121-EXMST2 4

6 The final column of this table indicates that rÿ sfi q is a contingent statement and not a tautology. Consequently the argument is false. (e) (i) Prove or disprove the following statement: $x Œ, y Œ, xy = 0. This statement claims that there is a pair of real numbers that have a zero product. This can be shown to be true by providing an example of such a pair of real numbers. One example of such a pair is 0 and 0, since 0 x 0 = 0. Hence, the statement is proven to be true. Is the statement in 3(e)(i) an existential statement or a universal statement. Explain briefly. The statement in 3(e)(i) is an existential statement because it claims only that there are some real numbers that satisfy the claim. It doesn't claim that it is true for all real numbers (as would a corresponding universal statement) although this possibility is not excluded. (f) (i) Complete the tautology (P fi R) Ÿ (Q fi R) ï (..fi ) ((P fi R) Ÿ (Q fi R)) ï ((P Q) fi R) By considering all cases, prove or disprove the following statement: For any integer z Œ Ÿ, (2z) 2 is an even positive integer. By the Quotient Remainder Theorem for any z Œ Ÿ, $ q Œ Ÿ and r Œ Õ such that z = 2q + r where 0 r < 2, i.e. z = 2q or 2q +1. In words, z is either even or odd. Case 1: z is even i.e. $ q Œ Ÿ such that z =2q so (2z) 2 = (2 2q) 2 = 2(8q 2 ). Hence, (2z) 2 is an even positive integer. Case 2: z is odd i.e. $ q Œ Ÿ such that z =2q + 1 so (2z) 2 = (2 (2q + 1)) 2 = 2 (2 (2q + 1) 2 ). Hence, (2z) 2 is an even positive integer if z is an odd integer. Consequently, by the tautology in Q3(f) (i), for any integer z, (2z) 2 is an even positive integer. Note : the counter example z = 0 gives (2z) 2 =0 which is neither positive nor negative and hence the statement is disproved. Full marks have been awarded for either proof by cases or the disproof noted, as the distinction for zero being neutral has not been fully noted in lectures. Marks (a)(i) 2; 2; (b) 4; (c)6; (d) 8; (e)(i) 3; 2; (f) (i) 3; 8. Total marks = 38. Question 4 (a) Define or otherwise explain the Fundamental Theorem of Arithmetic. If a Œ Ÿ and a > 1, then a can be factorized in a unique way in the form a a = p 1 a 1 p 2 a 2 p 3 a k 3 p k where p 1, p 2,, p k are each prime numbers and a i Œ Õ for each i = 1, 2,, k. (b) (i) Write down a composite integer, m, such that m and 7 are not relatively prime. WCA-WUCT121-EXMST2 5

7 m = 14. The gcd(14, 7) = 7, so 14 and 7 are not relatively prime. What is the value of gcd(m, 7)? Briefly explain your answer. gcd(m, 7) = 7 because 7 has no factors other than 7 and 1, m must be a multiple of 7. (iii) What is value of lcm(m, 7)? Briefly explain your answer. The lcm(m, 7) = m since m is a multiple of 7 and m is the smallest multiple of m. (c) (i) Use the Sieve of Eratosthenes to find all the prime numbers between 1 and 80. Step 1: Write down all of the integers between 1 and 80 inclusive. Step 2: Eliminate all multiples of prime numbers less than or equal to 80. a) Eliminating multiples of b) Eliminating multiples of c) Eliminating multiples of d) Eliminating multiples of WCA-WUCT121-EXMST2 6

8 So the set of prime numbers between 1 and 80 is {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79} Write down all the sets of twin primes that lie between 1 and 80. The sets of twin primes are: (3, 5),(5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71,73) (iii) Write down each set of twin primes that lie between 1 and 80 whose sum is a perfect square. There are two such pairs of twin primes: (17, 19), where = 36 = 6 2, and (71, 73), where = 144 = (d) (i) Use the Euclidean Algorithm to find the greatest common divisor of 76 and gcd( 1657, 76) = gcd(1657, 76) 1657 = = = gcd(1657, 76)= gcd(76, 61) = gcd(61, 15) = gcd(15, 1) = gcd(1, 0) = 1 15 = Find integers m and n such that gcd( 1657, 76) = m( 1657) + n(76). From (i) 61 = = = Hence, 1 = 61 4 ( ) 1 = = 5 ( ) = = ( 5) ( 1657) + ( 109) 76 so that m = 5 and n = 109. (e) A school administrator wants to assign 80 students to 13 classes so that no class has more than 12 students. Show that there must be at least 3 classes with 6 or more. If two classes each have the maximum number of students enrolled, that leaves 56 students to be allocated to 11 classes with no class having more than 12 students. Since 56 > 5 11 but < 6 11, it follows from the Generalised Pigeonhole Principle that WCA-WUCT121-EXMST2 7

9 there must be at one class of the 11 that has at least = 6 students. Hence there must be at least = 3 classes with 6 or more students. (f) (i) Define or otherwise explain the Quotient-Remainder Theorem. For any integers n and d, where d > 0, there exist integers q and r such that n = q d +r, where 0 r < d. For example, if n = 34 and d = 3 then 34 = Using the Quotient-Remainder Theorem, or otherwise, show that for any odd natural number n Œ Õ, 8 n 2 1. [Hint: By the Quotient-Remainder Theorem, any natural number can be written as 4k, 4k +1, 4k +2 or 4k +3.] Since n is an odd natural number it must take the form of 4k + 1 or 4k + 3, as 4k and 4k +2 are even numbers. Hence there are two cases to consider. Case 1: If n = 4k + 1, then n 2 1= 16k 2 + 8k = 8(2k 2 + k). Case 2: If n = 4k + 3, then n 2 1= 16k k = 8(2k 2 +3 k +1). Consequently, by the tautology in Q3(g) (i), when n is an odd natural number 8 n 2 1. (g) (i) Prove or disprove the following statement: The sum of any 5 consecutive natural numbers is always divisible by 5. Let the five consecutive numbers be k, k+1, k + 2, k + 3, k +4. The sum of these numbers is 5k + 10, and 5 (5k + 10). Consequently, the statement that, The sum of any 5 consecutive natural numbers is always divisible by 5, is true. Prove or disprove the following statement: The sum of any n consecutive natural numbers is always divisible by n. Let the four consecutive numbers be k, k+1, k + 2, k + 3. The sum of these numbers is 4k + 6, but 4 F (4k + 6). Consequently, the statement that, The sum of any n consecutive natural numbers is always divisible by n, is false. Marks (a) 3; (b) (i) 2; 2; (iii) 2; (c) (i) 10; 4; (iii) 4; (d) (i) 4; 6; (e) 6; (f) (i) 2; 6; (g) (i) 3; 3. Total marks = 57. Total marks for whole paper = = 170. WCA-WUCT121-EXMST2 1

Wollongong College Australia

Wollongong College Australia Wollongong College Australia A College of the University of Wollongong Diploma in Information Technology Mid-Session Test #1 WUCT121 Discrete Mathematics Autumn Session 2008 SOLUTIONS Time Allowed: 50

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

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction. Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent

More information

WUCT121. Discrete Mathematics. Numbers

WUCT121. Discrete Mathematics. Numbers WUCT121 Discrete Mathematics Numbers 1. Natural Numbers 2. Integers and Real Numbers 3. The Principle of Mathematical Induction 4. Elementary Number Theory 5. Congruence Arithmetic WUCT121 Numbers 1 Section

More information

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The

More information

Math 13, Spring 2013, Lecture B: Midterm

Math 13, Spring 2013, Lecture B: Midterm Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.

More information

Logic, Sets, and Proofs

Logic, Sets, and Proofs Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

More information

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

More information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

2 Elementary number theory

2 Elementary number theory 2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},

More information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

CSE 1400 Applied Discrete Mathematics Proofs

CSE 1400 Applied Discrete Mathematics Proofs CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively 6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise

More information

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright

More information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs. Applied Discrete Mathematics Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

More information

MATH 215 Final. M4. For all a, b in Z, a b = b a.

MATH 215 Final. M4. For all a, b in Z, a b = b a. MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on

More information

Introduction to Decision Sciences Lecture 2

Introduction to Decision Sciences Lecture 2 Introduction to Decision Sciences Lecture 2 Andrew Nobel August 24, 2017 Compound Proposition A compound proposition is a combination of propositions using the basic operations. For example (p q) ( p)

More information

Writing Assignment 2 Student Sample Questions

Writing Assignment 2 Student Sample Questions Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.

More information

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference

More information

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers: WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs

More information

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

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

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional) Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

Chapter 5: The Integers

Chapter 5: The Integers c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition

More information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 6. Prime Numbers. Definition and Fundamental Results CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n

More information

*EXAM 1 Answer key* EECS 203 Spring 2016

*EXAM 1 Answer key* EECS 203 Spring 2016 *EXAM 1 Answer key* EECS 203 Spring 2016 Name (Print): Key uniqname (Print): Key Instructions. You have 110 minutes to complete this exam. You may have one page of notes (8.5x11.5 two-sided) but may not

More information

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24 Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using

More information

Discrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013

Discrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013 . Print your name on your scantron in the space labeled NAME. 2. Print CMSC 223 in the space labeled SUBJECT. 3. Print the date 2-2-203, in the space labeled DATE. 4. Print your CRN, 786, in the space

More information

A. Propositional Logic

A. Propositional Logic CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs

More information

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b

More information

Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:

Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z: Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1

More information

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4 Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement

More information

Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University

Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents

More information

REVIEW Chapter 1 The Real Number System

REVIEW Chapter 1 The Real Number System REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }

More information

Logic Overview, I. and T T T T F F F T F F F F

Logic Overview, I. and T T T T F F F T F F F F Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical

More information

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93. Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)

More information

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

MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018 MAT246H1S - Concepts In Abstract Mathematics Solutions to Term Test 1 - February 1, 2018 Time allotted: 110 minutes. Aids permitted: None. Comments: Statements of Definitions, Principles or Theorems should

More information

Finals: Solutions. ECS 20 (Fall 2009) Patrice Koehl May 20, 2016

Finals: Solutions. ECS 20 (Fall 2009) Patrice Koehl May 20, 2016 Finals: Solutions ECS 20 (Fall 2009) Patrice Koehl koehl@cs.ucdavis.edu May 20, 2016 Part I: Logic Exercise 1 On a distant island, every inhabitant is either a Knight or Knave. Knights only tell the truth.

More information

Math 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS

Math 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS 4-1Divisibility Divisibility Divisibility Rules Divisibility An integer is if it has a remainder of 0 when divided by 2; it is otherwise. We say that 3 divides 18, written, because the remainder is 0 when

More information

Topics in Logic and Proofs

Topics in Logic and Proofs Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2

More information

MTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1

MTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1 MTH 310, Section 001 Abstract Algebra I and Number Theory Sample Midterm 1 Instructions: You have 50 minutes to complete the exam. There are five problems, worth a total of fifty points. You may not use

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

Formal Proof Methodology

Formal Proof Methodology Formal Proof Methodology Jason Filippou CMSC250 @ UMCP 06-09-2016 ason Filippou (CMSC250 @ UMCP) Formal Proof Methodology 06-09-2016 1 / 45 Today s agenda We will talk about how to formally prove mathematical

More information

CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati

CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during

More information

Lecture 7: Polynomial rings

Lecture 7: Polynomial rings Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules

More information

Do not start until you are given the green signal

Do not start until you are given the green signal SOLUTIONS CSE 311 Winter 2011: Midterm Exam (closed book, closed notes except for 1-page summary) Total: 100 points, 5 questions. Time: 50 minutes Instructions: 1. Write your name and student ID on the

More information

Announcements. Exam 1 Review

Announcements. Exam 1 Review Announcements Quiz today Exam Monday! You are allowed one 8.5 x 11 in cheat sheet of handwritten notes for the exam (front and back of 8.5 x 11 in paper) Handwritten means you must write them by hand,

More information

Mathematical Reasoning (Part I) 1

Mathematical Reasoning (Part I) 1 c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither

More information

HANDOUT AND SET THEORY. Ariyadi Wijaya

HANDOUT AND SET THEORY. Ariyadi Wijaya HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics

More information

PRACTICE PROBLEMS: SET 1

PRACTICE PROBLEMS: SET 1 PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if

More information

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations

More information

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

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

More information

Mathematical Reasoning & Proofs

Mathematical Reasoning & Proofs Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0

More information

Midterm Exam Solution

Midterm Exam Solution Midterm Exam Solution Name PID Honor Code Pledge: I certify that I am aware of the Honor Code in effect in this course and observed the Honor Code in the completion of this exam. Signature Notes: 1. This

More information

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element

More information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

Name: Mathematics 1C03

Name: Mathematics 1C03 Name: Student ID Number: Mathematics 1C03 Day Class Instructor: M. Harada Duration: 2.5 hours April 2018 McMaster University PRACTICE Final Examination This is a PRACTICE final exam. The actual final exam

More information

Fall 2017 Test II review problems

Fall 2017 Test II review problems Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and

More information

NOTES ON INTEGERS. 1. Integers

NOTES ON INTEGERS. 1. Integers NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

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

Lecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8

Lecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8 Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness

More information

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1

More information

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division

More information

Four Basic Sets. Divisors

Four Basic Sets. Divisors Four Basic Sets Z = the integers Q = the rationals R = the real numbers C = the complex numbers Divisors Definition. Suppose a 0 and b = ax, where a, b, and x are integers. Then we say a divides b (or

More information

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! Logic and Proof On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA 341 001 2 Requirements for Proof 1. Mutual understanding

More information

5.1. Primes, Composites, and Tests for Divisibility

5.1. Primes, Composites, and Tests for Divisibility CHAPTER 5 Number Theory 5.1. Primes, Composites, and Tests for Divisibility Definition. A counting number with exactly two di erent factors is called a prime number or a prime. A counting number with more

More information

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION 011-1 DISCRETE MATHEMATICS (EOE 038) 1. UNIT I (SET, RELATION,

More information

MAT2345 Discrete Math

MAT2345 Discrete Math Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview

More information

MATH FINAL EXAM REVIEW HINTS

MATH FINAL EXAM REVIEW HINTS MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

More information

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA Logic and Proof On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA 341 001 2 Requirements for Proof 1. Mutual understanding

More information

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP) Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement

More information

Foundations of Discrete Mathematics

Foundations of Discrete Mathematics Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true

More information

Logic and Proofs. (A brief summary)

Logic and Proofs. (A brief summary) Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

More information

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

Disproof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Disproof Fall / 16 Disproof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Disproof Fall 2014 1 / 16 Outline 1 s 2 Disproving Universal Statements: Counterexamples 3 Disproving Existence

More information

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime. PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice

More information

The set of integers will be denoted by Z = {, -3, -2, -1, 0, 1, 2, 3, 4, }

The set of integers will be denoted by Z = {, -3, -2, -1, 0, 1, 2, 3, 4, } Integers and Division 1 The Integers and Division This area of discrete mathematics belongs to the area of Number Theory. Some applications of the concepts in this section include generating pseudorandom

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

Ch 4.2 Divisibility Properties

Ch 4.2 Divisibility Properties Ch 4.2 Divisibility Properties - Prime numbers and composite numbers - Procedure for determining whether or not a positive integer is a prime - GCF: procedure for finding gcf (Euclidean Algorithm) - Definition:

More information

Section L.1- Introduction to Logic

Section L.1- Introduction to Logic Section L.1- Introduction to Logic Definition: A statement, or proposition, is a declarative sentence that can be classified as either true or false, but not both. Example 1: Which of the following are

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Define and use the congruence modulo m equivalence relation Perform computations using modular arithmetic

More information

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1

More information

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...} WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not

More information

COMP 2600: Formal Methods for Software Engineeing

COMP 2600: Formal Methods for Software Engineeing COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Q 1 Find the square root of 729. 6. Squares and Square Roots Q 2 Fill in the blank using the given pattern. 7 2 = 49 67 2 = 4489 667 2 = 444889 6667 2 = Q 3 Without adding find the sum of 1 + 3 + 5 + 7

More information

Notation Index. gcd(a, b) (greatest common divisor) NT-16

Notation Index. gcd(a, b) (greatest common divisor) NT-16 Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9

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