Integers and Mathematical Induction
|
|
- Philippa Barker
- 5 years ago
- Views:
Transcription
1 IT Program, NTUT, Fall 07 Integers and Mathematical Induction Chuan-Ming Liu Computer Science and Information Engineering National Taipei University of Technology TAIWAN 1 Learning Objectives Learn about the basic properties of integers Become aware how integers are represented in computer memory Explore how addition and subtraction operations are performed on binary numbers Learn how the principle of mathematical induction is used to solve problems Learn about loop invariants and how they are used to prove the correctness of loops Explore various properties of prime numbers Learn about linear Diophantine equations and how to solve them Outline Integers Representation of Integers in Computer Mathematical Induction Prime Numbers Linear Diophantine Equations 3 1
2 Integers Recall that N : The set of all natural numbers (i.e., all positive integers) Z : The set of all integers Z*: The set of all nonzero integers 4 Properties of Integer Set (1) Let a, b, c Z. Closure: a + b Z a b Z Commutative laws: a+b = b+a a b= b a Associative laws: a+(b+c) = (a+b)+ c a (b c) = (a b) c Identity elements: additive identity: 0 multiplicative identity: 1 5 Properties of Integer Set () Additive inverse: For each integer a, there exists an integer b such that a+b=0=b+a. This integer b is called the additive inverse of a and is denoted by a. Distributive laws: a (b+c) = a b+ a c (b+c) a = b a+ c a Cancellation laws: Suppose that a 0. Then a b = a c implies that b=c; and b a= c aimplies that b=c. 6
3 Theorem Comparisons Definition: (greater than) Let a and b be integers. Then a is said to be greater than b, written a>b, if a-b is a positive integer. If a>b, then sometimes we also write b>a. 8 Theorem.1.3 Let a and b be integers such that a>b. Then 1) a+c > b+c for any integer c, and ) ad > bd for any positive integer d. 3) ad < bd for any negative integer d. 9 3
4 Well-Ordering Principle Axiom: Any nonempty subset of nonnegative integers has a least (i.e., smallest) element. That is, if S is a nonempty subset of the set of nonnegative integers, then there exists n S such that n m for all m S. 10 Theorem.1.5 Let a and b be two positive integers. Then, there exists a positive integer n such that b<na. (p.s. The proof is made by contradiction using the well-ordering principle) 11 Division Algorithm Theorem.1.6: (division algorithm) Let a and b ( 1) be integers. Then there exist unique integers q and r such that a=bq+r The quotient on dividing a by b. The remainder on dividing a by b. where 0 r < b. Corollary: If a and b are two integers with b 0, then there exist unique integers q and r such that a=qb+r, where 0 r < b. 1 4
5 Example Problem: Any integer is one of the forms 3k, 3k+1, or 3k+, and the square of any integer is one of the forms 3k or 3k+1, where k is an integer. 13 div and mod Operators div a div b = the quotient of a and b on dividing a by b. Examples: 8 div 5 = 1 13 div 3 = 4 mod a mod b = the remainder of a and b on dividing a by b. Example 8 mod 5 = 3 13 mod 3 = 1 14 Divisibility Definition: (divisibility) Let a and b be two integers such that a 0. If there exists an integer c such that b=ac, then a is said to divide b or a is said to be a divisor of b and we write a b. Note: 1. The notation a b means that a does not divide b.. For any integer a, we have a=1a and so 1 a. 3. For an integer b 0, we have b 0 and b b. 15 5
6 Theorem.1.14 Let a, b, and c be integers. 1) Suppose a 0 and c 0. If a b, then ca cb and ac bc. ) Suppose a 0 and b 0. If a b and b c, then a c. 3) Suppose a 0. If a b and a c, then a (bx+cy) for any integers x and y. 4) Suppose a 0. If a b and a (b+c), then a c. 5) Suppose a 0 and b 0, if a b and b a, then a=±b. 16 Common Divisors Definition: (common divisors) A nonzero integer d is said to be a common divisor of integers a and b if d a and d b. Definition: (greatest common divisors, gcd) A nonzero integer d is said to be a greatest common divisor (gcd) of integers a and b 1. if d is a common divisor of a and b; and. if c is a common divisor of a and b, then c b. 17 gcd(a, b) Let d 1 and d be two greatest common divisor of integers a and b. Then d 1 d and d d 1 according to the definition and d 1 = ± d. Two different gcd s differ in their sign only. The positive one is denoted by gcd(a, b). Example: Consider 8 and 14. ± are the gcd s gcd(8, 14) = 18 6
7 Theorem.1.19 Let a and b be two integers such that not both are zero. Then gcd(a, b) exists. Moreover, if d=gcd(a, b), then there exist integers s and t such that d=sa+tb. Lemma.1.0: If a and b are positive integers such that a=qb+r, 0 r < b, then gcd(a, b) = gcd(b, r), 19 Euclidean Algorithm (1) According to Lemma.1.0 Given two positive integers, one can obtain the followings recursively: a=q 1 b+r 1, 0 r 1 <b. If r 1 0, b=q r 1 +r, 0 r <r 1. If r 0, r 1 =q 3 r +r 3, 0 r 3 <r. M The remainders r 1, r, r 3,, form a decreasing sequence of nonnegative integers 0 Euclidean Algorithm () Note that: since b is a fixed positive integer, one must encounter the remainder 0 after a finite number of steps. Suppose after (k+1) steps the process terminates, i.e. r k-1 =q k+1 r k +0. Then, gcd(a, b)=gcd(b, r 1 ) =gcd(r 1, r ) M =gcd(r k-1, r k ) = r k, because r k-1 =q k+1 r k. 1 7
8 Example Let x=13 and y=108. Find the gcd(x, y). Relatively Prime Integers Definition: (relatively prime integer) Two integers a and b are said to be relatively prime if gcd(a, b)=1. Theorem.1.5 Let a and b be two integers not both zero. Then a and b are relatively prime if and only if 1=ra+tb for some integers r and t. 3 Least Common Multiples (lcm) Definition: (lease common multiple, lcm) A nonzero integer m is said to be a least common mulitple (lcm) of integers a and b, lcm[a,b], 1.if m is a common multiple of a and b; and.if c is a common multiple of a and b, then c is a multiple of m. Theorem.1.7 Let a and b be two integers not both zero. Then gcd(a, b) lcm[a, b]= ab. 4 8
9 Outline Integers Representation of Integers in Computer Mathematical Induction Prime Numbers Linear Diophantine Equations 5 Two Types of Signals Electrical signals are used inside the computer to process information Two types of signals Analog Continuous wave forms used to represent such things as sound Examples: audio tapes, older television signals, etc. Digital Represent information with a sequence of 0s and 1s Examples: compact discs, newer digital HDTV signals 6 Digital Signals 0s and 1s : 0s represent low voltage, 1s high voltage Digital signals are more reliable carriers of information than analog signals Can be copied from one device to another with exact precision Machine language is a sequence of 0s and 1s The digit 0 or 1 is called a binary digit, or bit A sequence of 0s and 1s is sometimes referred to as binary code 7 9
10 Number Systems Decimal (Base-10) System The digits that are used to represent numbers in base 10 are 0,1,,3,4,5,6,7,8, and 9. Binary (Base-) System Computer memory stores numbers in machine language, i.e., as a sequence of 0s and 1s Octal (Base-8) System Digits that are used to represent numbers in base 8 are 0,1,,3,4,5,6, and 7 Hexadecimal (Base-16) System Digits and letters that are used to represent numbers in base 16 are 0,1,,3,4,5,6,7,8,9,A,B,C,D,E, and F 8 Positional Number Systems Example: 9 Unique Representation The unique representation of N in the previous slide is called the representation of N in base β (or base β representation of N), and we write the representation as N=(a m a m-1 a m- La 1 a 0 ) β 30 10
11 Positional Number Systems Example: Decimal system: (0.413) 10 numbers represented real-world number set 31 Conversion between Number Systems (1) Conversion between number systems Example 1: binary to decimal Example : decimal to binary 3 Decimal to Binary Method
12 Decimal to Binary Method The whole process is the reverse of the Horner s rule 34 Conversion between Number Systems () Not all decimal fractions are exactly represented in the binary system. Example 1: (decimal to binary) 35 Conversion between Number Systems (3) Example : (binary to decimal) 36 1
13 Ways to Represent Integers (1) In computer memory, integers are represented as binary numbers in fixed-length bit strings. Suppose integers are represented as fixedlength strings of 8 bits One way to distinguish between negative and positive integers is to reserve the leftmost bit as the sign bit, i.e. the Most Significant Bit (MSB). Leftmost bit (MSB) = 0, number is positive Leftmost bit (MSB) = 1, number is negative The remaining 7 bits represent a nonnegative number 37 Ways to Represent Integers () The drawbacks when using the previous approach Leading to complicated methods of addition and subtraction The representation of 0 is not unique A convenient way is to use two s complement to represent negative numbers 38 Two s Complement Definition: (two s complement) Let n be a fixed positive integer and let x be a positive integer that can be represented as an n-bit binary number. The binary representation of n -x is called the two s complement of x with respect to n. Example: Let n=8 and x=45. Then 8-45=56-45=11. Now = is the binary representation of the two s complement if 45 as an 8-bit string
14 One s Complements Definition: (one s complement) Let s be an n-bit string, where n 1. The one s complement of s is the n-bit binary string obtained from s by changing 1 s to 0 s and 0 s to 1 s. Example: Let n=8 and s=11= Then the one s complement of s is Finding the Two s Complements Steps for finding the n-bit binary representation of the two s complement of a number x: Find the n-bit binary representation of x Find the one s complement of x Add 1 Example: Let n=8 and x= Solution to the Example 4 14
15 Theorem..4 Let x be a positive integer that can be expressed as an n-bit binary number, say (x n-1 x n- Lx 1 x 0 ). Let (y n-1 y n- Ly 1 y 0 ) be such that y i =1-x i for all i=0, 1, L n-1. Then, the binary representation of the two s complement of x is the number whose binary representation is given by (y n-1 y n- Ly 1 y 0 ) +(0 01) where (0 01) is the n-bit representation of Example Let x= and n=16. Please determine the 16-bit binary representation of the two s complement of x. 44 Remarks Let n 1 be an integer and x be an integer that can be represented as an n-bit binary string. Then the two s complement of the two s complement of x is x. The n-bit binary representation of the two s complement of 0 10 is
16 Leading Bit Definition: (leading bit) Let n 1 be an integer and x be a nonnegative integer that can be expressed as an n-bit binary number. The first digit, i.e., first bit, of the n- bit binary string representing x is called the leading bit of x. Example: Let n=8. The leading bit of is 0 and the leading bit of is Theorem..30 Let n=8, x an integer with 1 x 17, and y an integer with 18 y 55. The following assertions hold 1. x and y can be expressed as 8-bit binary strings.. the leading bits of x and y are 0 and 1 respectively. 3. the leading bits of the two s complements of x and y are 1 and 0 respectively. 47 Theorem..31 Let n 1 be an integer and x be a nonnegative integer that can be expressed as an n-bit binary number. 1. If x= n-1 (resp. x=0), then the leading bit of x and the leading bit of the two s complement of x is 1 (resp. 0).. If 1 x < n-1, the leading bits of x is 0 and the leading bit of the two s complement of x is If n-1 < x n -1, the leading bits of x is 1 and the leading bit of the two s complement of x is
17 Represent Integers Using 8-bit binary strings as example If 1 x 17, then the leading bit of x is 0. Consider y such that -17 y -1. Then, y is a negative number and 1 y 17. The leading bit of y is 0 and the leading bit of the two s complement of y is 1. We can make negative numbers represented as the two s complement of their absolute number 8 bits can be used to represents integers in the range -18 to Remarks It can be shown that n bits are sufficient to represent any integer x such that - n-1 x n-1-1 as an n-bit string. 50 Examples Operations Let n=8. x=67 and y=38. Add x and y. x=67 and y=-38. Add x and y. x=-67 and y=38. Add x and y. x=-67 and -y=38. Add x and y
18 Outline Integers Representation of Integers in Computer Mathematical Induction Prime Numbers Linear Diophantine Equations 5 A Way to Prove Consider the following well-known formula n n( n+ 1) P( n) = i= 1+ + L+ n=, for all integers n 1. i= 1 How to prove this formula is correct for all integer n? Proving it pair by pair Using Mathematical Induction 53 First Principle of Mathematical Induction Let P(n) be a sentence containing nonnegative integer n, and let n 0 be a fixed nonnegative integer. 1. Suppose P(n 0 ) is true (i.e., P(n) is true for n= n 0 ).. Whenever k is an integer such that k n 0 and P(k) is true, then P(k+1) is true. Then P(n) is true for all integers n n
19 Example Recall our previous example n n( n+ 1) P( n) = i= 1+ + L+ n=, for all integers n 1. i= 1 1. Start by verifying that P(n) is true when n=1. 1(1+ 1) P(1) = 1=. Assume that P(k) is true when k 1. i. e., P( k) k = i= 1 k( k+ 1) i= 1+ + L+ k =, for some integer k Example 3. Need to verify P(k+1) is still true. k 1 ( + 1)( + ).., ( + 1) = + k k i e P k i= 1+ + L+ k+ ( k+ 1) = i= 1 P( k+ 1) = 1+ + L+ k+ ( k+ 1) = P( k) + ( k+ 1) Because P(k) k( k+ 1) = + ( k+ 1) is true. k = ( k+ 1)( + 1) ( k+ 1)( k+ ) = 56 Three Steps Proof of a mathematical statement by the principle of mathematical induction consists of three steps: 1. Basic Step: To show that P(n 0 ) is true. Inductive Hypothesis: Let k be an integer such that k n 0 and P(k) is true 3. Inductive Step: To show that P(k+1) is true
20 Example Please show that 7 n +5 is divisible by 3 for all integers n Remarks The basic step is usually simple but important During the inductive step, one can not use the properties which hold for n k+1 to prove. 59 Example Consider the following statement 5 divides 5n+3 for all positive integers n. Suppose we skip the basic step and directly use an inductive hypothesis to proceed with the inductive step. What will go wrong? 60 0
21 Second Principle of Mathematical Induction Let P(n) be a sentence containing nonnegative integer n, and let n 0 be a fixed nonnegative integer. 1. Suppose P(n 0 ) is true. If for any integer k n 0, P(n 0 ), P(n 0 +1) P(n 0 +),, P(k) are true imply that P(k+1) is true, then P(n) is true for all integers n n Example Problem: Any postage charges of n cents can be made by using 3- and 5-cent stamps, where n 8. 6 Program Correctness Proving that a program is correct is a major issue in software industry. One way to verify the correctness is to run the program through a set of test cases. Mathematical tools are available to prove the correctness Verify the correctness of each statement in the program Easy for assignment statement and selection statement Using mathematical induction on showing the correctness of loops 63 1
22 Preconditions and Postconditions User of algorithm need not be concerned with how the algorithm is implemented He or she must know how to use the algorithm and what the algorithm does Precondition: Assertion (set of statements) that remains true before algorithm executes Postcondition: Assertion that is true after algorithm executes 64 Loop Invariant Set of statements that remains true each time the loop body is executed Example: the syntax of a while loop is: while booleanexpression do loopbody The booleanexpression is evaluated. If the booleanexpression evaluates to true,the loopbody executes. After executing the loopbody, the booleanexpression is evaluated again. Then the loopbody continues to execute as long as the booleanexpression evaluates to true. 65 Loop Invariant (cont.) ThebooleanExpression is either true or false. (It is a statement.) Let q denote the booleanexpression We can associate a predicate P(n) with a loop 66
23 Predicate P(n) 1. P(0) is true before the loop executes. When the loop terminates, q is false and ~q is true. Hence, if the loop executes N times, then P(N) ~q is true after the loop terminates. 3. If P(k) q is true before the (k+1)st iteration of the loop and k<n, then P(k +1) q is true after the (k+1)st iteration and (k+1) n. The predicate P(n) is called the loop invariant for the loop 67 Outline Integers Representation of Integers in Computer Mathematical Induction Prime Numbers Linear Diophantine Equations 68 Prime Numbers Definition: (Prime Numbers) An integer p>1 is called a prime number, or prime, if the only positive divisors of p are 1 and p. Definition: (Composite Numbers) An integer q>1 that is not prime is called composite. 69 3
24 Trivial Positive Divisors Definition: (Trivial Positive Divisors) For any positive integer n>1, the integers 1 and n are called the trivial positive divisors of n. Remarks: An integer n is prime if and only n has only trivial positive divisors. An integer n is composite if and only if n has a nontrivial positive divisor. 70 Theorem Theorem: An integer p>1 is prime if and only if for all integers a and b, p divides ab implies either p divides a or p divides b. Example: consider 1. 1 divides 10=30 4 but 1 30 and 1 4. Hence, 1 is not prime. Corollary: If a prime number p divides a 1 a a n, n>1, then p divides one of the integers a 1, a,, a n. 71 Theorem: Theorems Every integer n has a prime factor. Theorem: There are infinitely many primes. Theorem: if n is a composite integer, then n has a prime factor not exceeding n 7 4
25 Determining a Prime Number 1. If n is, then n is prime and return.. If divides n, n is not a prime and return. 3. Find all odd primes p n. If there is no such odd prime, then n is prime and return. 4. Check whether p divides n, where p is a prime obtained in step 3. If p divides n, then n is not prime; otherwise, n is a prime. 73 Example Consider the integer 131. Observe that does not divide 131. We now find all odd primes p such that p 131. These primes are 3, 5, 7, and 11. Now none of 3, 5, 7, and 11 divides 131. Hence, 131 is a prime. 74 Fundamental Theorem of Arithmetic Fundamental Theorem of Arithmetic Every integer n can be expressed uniquely as a product of (one or more) primes, up to the order of the factor. More precisely, any integer n can be expressed as n=p 1 p p r where p 1, p,, p r are primes. Moreover, if n=p 1 p p r and n=q 1 q q s are two factorizations of n as a product of primes, then r=s and the q j can be relabeled so that p i =q j for all i=1,,,r. 75 5
26 Factoring a Positive Integer The standard factorization of n is r r r n= p k 1 1 p L pk where r i >0, i=1,,,k, each p i is a prime integer, and p i p j for i j. 76 Fermat s Factoring Method Consider to factor a number n such that n=ab for some integers a and b. Fermat s Factoring Method: 1. If n is even, one can express n= r m, where m is odd. If n is odd, we can have two integers x and y such that n=x -y =(x+y)(x-y) and x and y can be determined as a. Find the smallest integer k, such that k n. b. Continuously look the numbers k -n, (k+1) -n until x n to find the one which makes x -n a square. 77 Outline Integers Representation of Integers in Computer Mathematical Induction Prime Numbers Linear Diophantine Equations 78 6
27 Diophantine Equation Definition: (Diophantine Equation) A Diophantine Equation is an algebraic equation in one or more unknowns with integer coefficients for which integer solutions are sought. Example: 3x+5y=80 Such an equation may have no solution, a finite number of solutions, or an infinite number of solutions The famous equation x n +y n = z n of Fermat s Last Theorem is also a Diophantine equation 79 Linear Diophantine Equations Definition: A linear equation of the form ax+by=c, where a, b, c are integers and x, y are variables such that the solutions are restricted to integers, is called a linear Diophantine equation in two variables. Note: if (x 0, y 0 ) is a pair of integers such that a ax 0 +by 0 =c, then (x 0, y 0 ) is said to be an integral solution of this equation. 80 Theorem 81 7
Math Introduction to Advanced Mathematics
Math 215 - Introduction to Advanced Mathematics Number Theory Fall 2017 The following introductory guide to number theory is borrowed from Drew Shulman and is used in a couple of other Math 215 classes.
More information1 Elementary number theory
Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},
More informationDiscrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
More information4&5 Binary Operations and Relations. The Integers. (part I)
c Oksana Shatalov, Spring 2016 1 4&5 Binary Operations and Relations. The Integers. (part I) 4.1: Binary Operations DEFINITION 1. A binary operation on a nonempty set A is a function from A A to A. Addition,
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.5 Application: Correctness of Algorithms Copyright Cengage Learning. All rights reserved.
More information1 Elementary number theory
1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...}, along with their most basic arithmetical and ordering properties.
More informationNumber System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value
1 Number System Introduction In this chapter, we will study about the number system and number line. We will also learn about the four fundamental operations on whole numbers and their properties. Natural
More informationMath 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)
Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Numbers & Number Systems
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics Numbers & Number Systems Introduction Numbers and Their Properties Multiples and Factors The Division Algorithm Prime and Composite Numbers Prime Factors
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Wednesday, September 22, 2010. The syllabus will be sections 1.1 and 1.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/ SECTION 5.5 Application: Correctness of Algorithms Copyright Cengage Learning. All
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationTopic 10 Part 2 [474 marks]
Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationMathematical Induction
Mathematical Induction Victor Adamchik Fall of 2005 Lecture 3 (out of three) Plan 1. Recursive Definitions 2. Recursively Defined Sets 3. Program Correctness Recursive Definitions Sometimes it is easier
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.8 Application: Algorithms Copyright Cengage Learning. All rights reserved. Application:
More informationChapter 1: Number and Operations
Chapter 1: Number and Operations 1.1 Order of operations When simplifying algebraic expressions we use the following order: 1. Perform operations within a parenthesis. 2. Evaluate exponents. 3. Multiply
More informationLemma (x, y, z) is a Pythagorean triple iff (y, x, z) is a Pythagorean triple.
Chapter Pythagorean Triples.1 Introduction. The Pythagorean triples have been known since the time of Euclid and can be found in the third century work Arithmetica by Diophantus [9]. An ancient Babylonian
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationSolutions to the Second Midterm Exam
CS/Math 240: Intro to Discrete Math 3/27/2011 Instructor: Dieter van Melkebeek Solutions to the Second Midterm Exam Problem 1 This question deals with the following implementation of binary search. Function
More informationLecture Notes, CSE 232, Fall 2014 Semester
Lecture Notes, CSE 232, Fall 2014 Semester Dr. Brett Olsen Week 11 - Number Theory Number theory is the study of the integers. The most basic concept in number theory is divisibility. We say that b divides
More informationPower Set of a set and Relations
Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}
More informationSECTION 5.1. Sequences
SECTION 5.1 Sequences Sequences Problem: count number of ancestors one has 2 parents, 4 grandparents, 8 greatgrandparents,, written in a row as 2, 4, 8, 16, 32, 64, 128, To look for pattern of the numbers,
More informationChapter 4. Number Theory. 4.1 Factors and multiples
Chapter 4 Number Theory We ve now covered most of the basic techniques for writing proofs. So we re going to start applying them to specific topics in mathematics, starting with number theory. Number theory
More informationSection 1.2 Fractions
Objectives Section 1.2 Fractions Factor and prime factor natural numbers Recognize special fraction forms Multiply and divide fractions Build equivalent fractions Simplify fractions Add and subtract fractions
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationChapter Summary. Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms
Chapter Summary Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms Section 5.1 Sec.on Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken
More informationUCT Algorithm Circle: Number Theory
UCT Algorithm Circle: 7 April 2011 Outline Primes and Prime Factorisation 1 Primes and Prime Factorisation 2 3 4 Some revision (hopefully) What is a prime number? An integer greater than 1 whose only factors
More information9 abcd = dcba b + 90c = c + 10b b = 10c.
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationAssertions & Verification & Example Loop Invariants Example Exam Questions
2014 November 27 1. Assertions & Verification & Example Loop Invariants Example Exam Questions 2. A B C Give a general template for refining an operation into a sequence and state what questions a designer
More informationAlgebra 1 Review. Properties of Real Numbers. Algebraic Expressions
Algebra 1 Review Properties of Real Numbers Algebraic Expressions Real Numbers Natural Numbers: 1, 2, 3, 4,.. Numbers used for counting Whole Numbers: 0, 1, 2, 3, 4,.. Natural Numbers and 0 Integers:,
More informationCourse Learning Outcomes for Unit I. Reading Assignment. Unit Lesson. UNIT I STUDY GUIDE Number Theory and the Real Number System
UNIT I STUDY GUIDE Number Theory and the Real Number System Course Learning Outcomes for Unit I Upon completion of this unit, students should be able to: 2. Relate number theory, integer computation, and
More informationAssertions & Verification Example Exam Questions
2009 November 23 Assertions & Verification Example Exam Questions 1. 2. A B C Give a general template for refining an operation into a sequence and state what questions a designer must answer to verify
More informationCOP 4516: Math for Programming Contest Notes
COP 4516: Math for Programming Contest Notes Euclid's Algorithm Euclid's Algorithm is the efficient way to determine the greatest common divisor between two integers. Given two positive integers a and
More information9 abcd = dcba b + 90c = c + 10b b = 10c.
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
More informationA.1 Numbers, Sets and Arithmetic
522 APPENDIX A. MATHEMATICS FOUNDATIONS A.1 Numbers, Sets and Arithmetic Numbers started as a conceptual way to quantify count objects. Later, numbers were used to measure quantities that were extensive,
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationThe set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;
Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Explain the steps in a proof by (strong) mathematical induction Use (strong) mathematical induction
More informationComputable Euclidean Domains
Computable Euclidean Domains Asher M. Kach (Joint Work with Rod Downey and with Paul Ellis and Reed Solomon) Southern Wisconsin Logic Colloquium 9 October 2012 Asher M. Kach Computable Euclidean Domains
More informationPositional notation Ch Conversions between Decimal and Binary. /continued. Binary to Decimal
Positional notation Ch.. /continued Conversions between Decimal and Binary Binary to Decimal - use the definition of a number in a positional number system with base - evaluate the definition formula using
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationOdd-Numbered Answers to Exercise Set 1.1: Numbers
Odd-Numbered Answers to Exercise Set.: Numbers. (a) Composite;,,, Prime Neither (d) Neither (e) Composite;,,,,,. (a) 0. 0. 0. (d) 0. (e) 0. (f) 0. (g) 0. (h) 0. (i) 0.9 = (j). (since = ) 9 9 (k). (since
More informationCGF Lecture 2 Numbers
CGF Lecture 2 Numbers Numbers A number is an abstract entity used originally to describe quantity. i.e. 80 Students etc The most familiar numbers are the natural numbers {0, 1, 2,...} or {1, 2, 3,...},
More informationQuadratic Equations over Matrices over the Quaternions. By Diana Oliff Mentor: Professor Robert Wilson
Quadratic Equations over Matrices over the Quaternions By Diana Oliff Mentor: Professor Robert Wilson Fields A field consists of a set of objects S and two operations on this set. We will call these operations
More informationMathematical preliminaries and error analysis
Mathematical preliminaries and error analysis Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan August 28, 2011 Outline 1 Round-off errors and computer arithmetic IEEE
More informationEuclid's Algorithm. MA/CSSE 473 Day 06. Student Questions Odd Pie Fight Euclid's algorithm (if there is time) extended Euclid's algorithm
MA/CSSE 473 Day 06 Euclid's Algorithm MA/CSSE 473 Day 06 Student Questions Odd Pie Fight Euclid's algorithm (if there is time) extended Euclid's algorithm 1 Quick look at review topics in textbook REVIEW
More informationMathematics. Jaehyun Park. CS 97SI Stanford University. June 29, 2015
Mathematics Jaehyun Park CS 97SI Stanford University June 29, 2015 Outline Algebra Number Theory Combinatorics Geometry Algebra 2 Sum of Powers n k=1 k 3 k 2 = 1 n(n + 1)(2n + 1) 6 = ( k ) 2 = ( 1 2 n(n
More informationEE292: Fundamentals of ECE
EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 22 121115 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Binary Number Representation Binary Arithmetic Combinatorial Logic
More informationDIGITAL SYSTEM DESIGN
DIGITAL SYSTEM DESIGN UNIT I: Introduction to Number Systems and Boolean Algebra Digital and Analog Basic Concepts, Some history of Digital Systems-Introduction to number systems, Binary numbers, Number
More informationOne of the most important areas where quantifier logic is used is formal specification of computer programs.
Section 5.2 Formal specification of computer programs One of the most important areas where quantifier logic is used is formal specification of computer programs. Specification takes place on several levels
More informationMAT 243 Test 2 SOLUTIONS, FORM A
MAT 243 Test 2 SOLUTIONS, FORM A 1. [15 points] Calculate the following quantities: a. 17 mod 4 Solution: 17 17 4 = 17 4 4 = 1. 4 b. 17 div 4 17 Solution: = 4. 4 c. (( 1) mod 12) mod (27 div 5) Solution:
More informationDISCRETE MATHEMATICS
DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The
More informationCS321 Introduction To Numerical Methods
CS3 Introduction To Numerical Methods Fuhua (Frank) Cheng Department of Computer Science University of Kentucky Lexington KY 456-46 - - Table of Contents Errors and Number Representations 3 Error Types
More informationExcerpt from "Art of Problem Solving Volume 1: the Basics" 2014 AoPS Inc.
Chapter 5 Using the Integers In spite of their being a rather restricted class of numbers, the integers have a lot of interesting properties and uses. Math which involves the properties of integers is
More informationUNIT-II NUMBER THEORY
UNIT-II NUMBER THEORY An integer n is even if, and only if, n equals twice some integer. i.e. if n is an integer, then n is even an integer k such that n =2k An integer n is odd if, and only if, n equals
More informationProof Techniques Alphabets, Strings, and Languages. Foundations of Computer Science Theory
Proof Techniques Alphabets, Strings, and Languages Foundations of Computer Science Theory Proof By Case Enumeration Sometimes the most straightforward way to prove that a property holds for all elements
More informationInfinity and Uncountability. Countable Countably infinite. Enumeration
Infinity and Uncountability. Countable Countably infinite. Enumeration How big is the set of reals or the set of integers? Infinite! Is one bigger or smaller? Same size? Same number? Make a function f
More informationCS Network Security. Nasir Memon Polytechnic University Module 7 Public Key Cryptography. RSA.
CS 393 - Network Security Nasir Memon Polytechnic University Module 7 Public Key Cryptography. RSA. Course Logistics Homework 2 revised. Due next Tuesday midnight. 2/26,28/02 Module 7 - Pubic Key Crypto
More informationin this web service Cambridge University Press
978-0-51-85748- - Switching and Finite Automata Theory, Third Edition Part 1 Preliminaries 978-0-51-85748- - Switching and Finite Automata Theory, Third Edition CHAPTER 1 Number systems and codes This
More informationIntroduction to Programming in C Department of Computer Science and Engineering\ Lecture No. #02 Introduction: GCD
Introduction to Programming in C Department of Computer Science and Engineering\ Lecture No. #02 Introduction: GCD In this session, we will write another algorithm to solve a mathematical problem. If you
More informationProblem. Prove that the square of any whole number n is a multiple of 4 or one more than a multiple of 4.
CHAPTER 8 Integers Problem. Prove that the square of any whole number n is a multiple of 4 or one more than a multiple of 4. Strategy 13 Use cases. This strategy may be appropriate when A problem can be
More informationChapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
Chapter 8 out of 7 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal 8 Matrices Definitions and Basic Operations Matrix algebra is also known
More informationSection 5.5. Greatest common factors
Section 5.5 Greatest common factors Definition GCF The greatest common factor (GCF) is the largest factor common to both of the specified numbers. Ex. GCF(36,84) List factors 36:1,2,3,4,6,9,12,18,36 84:1,2,3,4,6,7,9,12,14,21,28,42,84
More informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationRational numbers as decimals and as integer fractions
Rational numbers as decimals and as integer fractions Given a rational number expressed as an integer fraction reduced to the lowest terms, the quotient of that fraction will be: an integer, if the denominator
More informationDecimal Binary Conversion Decimal Binary Place Value = 13 (Base 10) becomes = 1101 (Base 2).
DOMAIN I. NUMBER CONCEPTS Competency 00 The teacher understands the structure of number systems, the development of a sense of quantity, and the relationship between quantity and symbolic representations.
More informationEDAA40 At home exercises 1
EDAA40 At home exercises 1 1. Given, with as always the natural numbers starting at 1, let us define the following sets (with iff ): Give the number of elements in these sets as follows: 1. 23 2. 6 3.
More informationFormal Languages and Automata
Mobile Computing and Software Engineering p. 1/3 Formal Languages and Automata Chapter 3 Regular languages and Regular Grammars Chuan-Ming Liu cmliu@csie.ntut.edu.tw Department of Computer Science and
More information2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members
More informationCh 3.4 The Integers and Division
Integers and Division 1 Ch 3.4 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 informationMAT 090 Brian Killough s Instructor Notes Strayer University
MAT 090 Brian Killough s Instructor Notes Strayer University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More informationFinite Math - J-term Homework. Section Inverse of a Square Matrix
Section.5-77, 78, 79, 80 Finite Math - J-term 017 Lecture Notes - 1/19/017 Homework Section.6-9, 1, 1, 15, 17, 18, 1, 6, 9, 3, 37, 39, 1,, 5, 6, 55 Section 5.1-9, 11, 1, 13, 1, 17, 9, 30 Section.5 - Inverse
More informationThis Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.
Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection
More informationChapter Seven: Regular Expressions. Formal Language, chapter 7, slide 1
Chapter Seven: Regular Expressions Formal Language, chapter 7, slide The first time a young student sees the mathematical constant π, it looks like just one more school artifact: one more arbitrary symbol
More informationCUT VERTICES IN ZERO-DIVISOR GRAPHS OF FINITE COMMUTATIVE RINGS
CUT VERTICES IN ZERO-DIVISOR GRAPHS OF FINITE COMMUTATIVE RINGS M. AXTELL, N. BAETH, AND J. STICKLES Abstract. A cut vertex of a connected graph is a vertex whose removal would result in a graph having
More informationTaibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.
More informationIntroduction to Modular Arithmetic
Randolph High School Math League 2014-2015 Page 1 1 Introduction Introduction to Modular Arithmetic Modular arithmetic is a topic residing under Number Theory, which roughly speaking is the study of integers
More informationFinal Test in MAT 410: Introduction to Topology Answers to the Test Questions
Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Stefan Kohl Question 1: Give the definition of a topological space. (3 credits) A topological space (X, τ) is a pair consisting
More information1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula
Homework 1 MTH 4590 Spring 2018 1. Chapter 1, # 1: Prove that for all sets,, C, the formula ( C) = ( ) ( C) is true. Proof : It suffices to show that ( C) ( ) ( C) and ( ) ( C) ( C). ssume that x ( C),
More informationComplexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np
Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be
More informationDefinition. A Taylor series of a function f is said to represent function f, iff the error term converges to 0 for n going to infinity.
Definition A Taylor series of a function f is said to represent function f, iff the error term converges to 0 for n going to infinity. 120202: ESM4A - Numerical Methods 32 f(x) = e x at point c = 0. Taylor
More informationSlide Set 1. for ENEL 339 Fall 2014 Lecture Section 02. Steve Norman, PhD, PEng
Slide Set 1 for ENEL 339 Fall 2014 Lecture Section 02 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2014 ENEL 353 F14 Section
More informationModular Arithmetic. is just the set of remainders we can get when we divide integers by n
20181004 Modular Arithmetic We are accustomed to performing arithmetic on infinite sets of numbers. But sometimes we need to perform arithmetic on a finite set, and we need it to make sense and be consistent
More informationPrepared by Sa diyya Hendrickson. Package Summary
Introduction Prepared by Sa diyya Hendrickson Name: Date: Package Summary Exponent Form and Basic Properties Order of Operations Using Divisibility Rules Finding Factors and Common Factors Primes, Prime
More informationCMSC Honors Discrete Mathematics
CMSC 27130 Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Justin Lubin The University of Chicago, Autumn 2017 1 Contents I Number Theory 4 1 The Euclidean Algorithm 4 2 Mathematical
More informationSection A Arithmetic ( 5) Exercise A
Section A Arithmetic In the non-calculator section of the examination there might be times when you need to work with quite awkward numbers quickly and accurately. In particular you must be very familiar
More informationModule 1: Information Representation I -- Number Systems
Unit 1: Computer Systems, pages 1 of 7 - Department of Computer and Mathematical Sciences CS 1305 Intro to Computer Technology 1 Module 1: Information Representation I -- Number Systems Objectives: Learn
More informationIntroduction to Automata Theory. BİL405 - Automata Theory and Formal Languages 1
Introduction to Automata Theory BİL405 - Automata Theory and Formal Languages 1 Automata, Computability and Complexity Automata, Computability and Complexity are linked by the question: What are the fundamental
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.2 Direct Proof and Counterexample II: Rational Numbers Copyright Cengage Learning. All
More informationLamé s Theorem. Strings. Recursively Defined Sets and Structures. Recursively Defined Sets and Structures
Lamé s Theorem Gabriel Lamé (1795-1870) Recursively Defined Sets and Structures Lamé s Theorem: Let a and b be positive integers with a b Then the number of divisions used by the Euclidian algorithm to
More informationProgramming Techniques in Computer Algebra
Programming Techniques in Computer Algebra Prof. Dr. Wolfram Koepf Universität Kassel http://www.mathematik.uni-kassel.de/~koepf March 18, 2010 Yaounde, Cameroon Abstract Topics of This Talk In this talk
More informationAntisymmetric Relations. Definition A relation R on A is said to be antisymmetric
Antisymmetric Relations Definition A relation R on A is said to be antisymmetric if ( a, b A)(a R b b R a a = b). The picture for this is: Except For Example The relation on R: if a b and b a then a =
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationCS321. Introduction to Numerical Methods
CS31 Introduction to Numerical Methods Lecture 1 Number Representations and Errors Professor Jun Zhang Department of Computer Science University of Kentucky Lexington, KY 40506 0633 August 5, 017 Number
More information