# Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.

Save this PDF as:

Size: px
Start display at page:

Download "Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p."

## Transcription

1 Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b = c = d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p. (i) Suppose that p a. We will show that the prime factorization of a contains p. Let a = q 1 q 2... q t be the prime factorization of a (where it may be the case that q i = q j for some 1 i, j t). Then p (q1 q 2... q t ), so p = q i for some q i t by Lemma Thus, the prime factorization of a contains p. (ii) Suppose that the prime factorization of a contains p. We will show that p a. Since the prime factorization of a contains p, we can write a = pb where b contains the rest of the prime factorization of a. Clearly p pb, so p a. Page 332, 38.6 Prove Lemma 38.3 by induction (or Well-Ordering Principle) using Lemma We will proceed by induction on the number of factors, t. The basis case t = 1 is clear since p and q 1 are both primes and a prime has no factors except for 1 and itself. The basis case t = 2 follows from Lemma 38.2 since p, q 1, and q 2 are all primes. Suppose that the result holds for t = k for some k 2. We will prove the result for t = k +1. Let b = q 1 q 2... q k. Then q 1 q 2... q k+1 = bq k+1. Suppose p bq k+1. Then by Lemma 38.2, either p b or p qk+1. If p b, then p = qi for some 1 i k by the induction hypothesis. If p qk+1, then p = q k+1 since both p and q k+1 are primes. Page 332, 38.8 Let a and b be integers. A common multiple of a and b is an integer n for which a n and b n. We call an integer m the least common multiple of n provided (1) m is positive, (2) m is a common multiple of a and b, and (3) if n is any other positive common multiple of a and b, then n m. The notation for the least common multiple of a and b is lcm(a, b). Please do the following: a. Develop a formula for the least common multiple of two positive integers in terms of their prime factorizations; your formula should be similar to the one in Theorem b. Use your formula to show that if a and b are positive integers, then ab = gcd(a, b) lcm(a, b). 1

2 a. Let a = 2 e2 3 e3 5 e5 7 e7... and b = 2 f2 3 f3 5 f5 7 f7.... Define m = 2 max{e2,f2} 3 max{e3,f3} 5 max{e5,f5} 7 max{e7,f7}.... We claim that lcm(a, b) = m. To verify this, we will check that m satisfies the three conditions in the definition of least common multiple. (1) m is a product of positive integers, so m is positive. (2) Note max{e 2, f 2 } e 2 and max{e 2, f 2 } f 2. Thus, 2 e2 2 max{e2,f2} and 2 f2 2 max{e2,f2}. Similarly, for each prime p, p ep p max{ep,fp} and p fp p max{ep,fp}. Thus, the prime factorization of m contains the prime factorization of a and so a m. Similarly, the prime factorization of m contains the prime factorization of b and so b m. Thus, m is a common multiple of a and b. (3) Suppose that n is any other positive common multiple of a and b. We want to show that n m. Since a n, we know that 2 e2 n. Since b n, we know that 2 f2 n. Thus, the prime factorization of n must contain the factor 2 to at least the power max{e 2, f 2 }. Similarly the factorization of n must contain each prime p to at least the power max{e p, f p }. That is, m n and so n m. Thus, we have proven our claim that lcm(a, b) = m. b. Note that min{e p, f p } + max{e p, f p } = e p + f p for every prime p. Thus, gcd(a, b) lcm(a, b) = (2 min{e2,f2} 3 min{e3,f3} 5 min{e5,f5} 7 min{e7,f7}... )(2 max{e2,f2} 3 max{e3,f3} 5 max{e5,f5} 7 max{e7,f7}... ) = 2 min{e2,f2}+max{e2,f2} 3 min{e3,f3}+max{e3,f3} 5 min{e5,f5}+max{e5,f5} 7 min{e7,f7}+max{e7,f7}... = 2 e2+f2 3 e3+f3 5 e5+f5 7 e7+f7... = (2 e2 3 e3 5 e5 7 e7... )(2 f2 3 f3 5 f5 7 f7... ) = ab. Page 454, 53.1 Let P be the poset in the figure. For each pair of elements x, y listed below, determine whether x < y, y < x, or x and y are incomparable. a. a and b are incomparable. b. a < c. c. c and g are incomparable. d. b < h. e. c < i. f. h > d. Page 454, 53.2 For the previous problem, please find the following: a. The height of the poset and a chain of largest size. 2

3 b. The width of the poset and an antichain of largest size. c. A chain containing three elements that cannot be extended to a larger chain. d. A chain containing two elements that cannot be extended to a larger chain. e. An antichain containing three elements that cannot be extended to a larger antichain. a. A chain of largest size is {a, c, f, h}, so the height of the poset is 4. b. An antichain of largest size is {c, d, e, g}, so the width of the poset is 4. c. The only chain with this property is {a, e, h}. d. The only chain with this property is {g, j}. e. One antichain with this property is {h, i, j}. Page 455, 53.9 Which of the various properties of relations does is comparable to exhibit? That is, determine (with proof) whether or not it is always reflexive, irreflexive, symmetric, antisymmetric, and/or transitive. Let P = (X, ). Let x, y X. 1. By Definition 53.1, we always have x x, so x is comparable to x for every x X. Thus, is comparable to is reflexive and so not irreflexive. 2. If x is comparable to y, then we cannot write both x y and y x. Thus, we cannot write both y x and x y and so y is comparable to x. Thus, is comparable to is symmetric. 3. is comparable to need not be antisymmetric, since for example 1 is comparable to 2 and 2 is comparable to 1 in the poset (N, ), yet is comparable to need not be transitive. For example, consider the poset ({a, b, c}, {(a, a), (a, b), (a, c), (b, b), (c, c)}). Here, b is comparable to a and a is comparable to c, yet b is not comparable to c. Page 455, Which of the various properties of relations does is incomparable to exhibit? That is, determine (with proof) whether or not it is always reflexive, irreflexive, symmetric, antisymmetric, and/or transitive. Let P = (X, ). Let x, y X. 1. By Definition 53.1, we always have x x, so x is comparable to x for every x X. Thus, is incomparable to is irreflexive and so not reflexive. 2. If x is incomparable to y, then we can write both x y and y x. Thus, we can write both y x and x y and so y is incomparable to x. Thus, is incomparable to is symmetric. 3. is incomparable to need not be antisymmetric, since for example a is incomparable to b and b is incomparable to a in the poset ({a, b}, {(a, a), (b, b)}), yet a b. 3

4 4. is comparable to need not be transitive. For example, consider the poset ({a, b, c}, {(a, a), (a, c), (b, b), (c, c)}). Here, a is incomparable to b and b is incomparable to c, yet a is not incomparable to c. Page 457, 54.2 For each of the following partially ordered sets, determine which elements are maximum, maximal, minimum, and minimal. b. The integers {1, 2, 3, 4, 5} ordered by divisibility,. d. Let X = {n Z: n 2}. Let P = (X, ); that is, P is the poset of all integers that are greater than 1, ordered by divisibility. b. The elements 2 and 3 and 5 are incomparable, 1 lies below 2, and 2 lies below 4, so there is no maximum element. The elements 3, 4, and 5 are maximal. The element 1 is the only minimum element. The element 1 is the only minimal element. d. For any element x, the element 2x lies above x, so there is no maximum element. For the same reason, there is no maximal element. The primes are incomparable and every other element lies above some prime, so there is no minimum element. No element lies below any prime, so the primes are the minimal elements (and since every composite lies above some prime, no composite is minimal). Page 457, 54.3 Find a poset that has neither a maximum nor a minimum element. The most natural example of this is the poset (Z, ). For any x Z, x is neither maximum nor minimum since x + 1 lies above it and x 1 lies below it. A finite example is the poset ({a, b}, {(a, a), (b, b)}). If there were an element that were a maximum or a minimum, it would have to be comparable with every other element of the poset. But the element b is comparable only with itself and so no such element exists. Page 457, 54.4 Prove or disprove each of the following statements. a. If a poset has a maximum element, then it must be unique. b. It is possible for a poset to have an element that is both maximum and minimum. c. It is possible for a poset to have an element that is both maximal and minimal but is neither maximum nor minimum. d. If a poset has exactly one maximal element, then it must be a maximum. e. If x is a minimal element in a poset and y is a maximal element in a poset, then x y. f. If x and y are incomparable, then neither is a minimum. g. Distinct (i.e., unequal) maximal elements must be incomparable. a. True. Suppose that a and b were both maximum elements of the poset (X, ). Then a b since b is a maximum and b a since a is a maximum. Then, since is antisymmetric, we have a = b. So, there can only be one maximum element. 4

5 b. True. For example, the element x is both a maximum and a minimum in the poset ({x}, {(x, x)}). c. True. For example, the element x is both maximal and minimal in the poset ({x, y}, {(x, x), (y, y)}), yet it is neither a maximum nor a minimum since y lies neither below it nor above it. d. False. Consider the poset (Z {x}, {(a, b): a, b Z and a b, or (a, b) = (x, x)}); that is, the poset (Z, ) with the added element x that is comparable only to itself. In this poset an integer n Z is not maximal since n + 1 lies above n. So, the only maximal element is x. However, x is not a maximum since x does not lie above 0, for example. e. False. Note that the element x is maximal and y is minimal in the poset ({x, y}, {(x, x), (y, y)}), yet x and y are not even comparable. f. True. If x were a minimum, then y would be above x, which it is not since x and y are not comparable. Similarly, if y were a minimum, then x would be above y, which it is not since x and y are not comparable. g. True. Suppose that x and y are distinct maximal elements. Assume for the sake of contradiction that x and y are not incomparable. Then either x < y or y < x (we know that x y since they are distinct). If x < y, then x is not maximal. If y < x, then y is not maximal. This contradicts the fact that x and y are both maximal. Thus, x and y are incomparable. 5

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### Today s Topics. Primes & Greatest Common Divisors

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

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

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

### Chapter 6. Number Theory. 6.1 The Division Algorithm

Chapter 6 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### Mathematical Induction

Mathematical S 0 S 1 S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! Mathematical S 0 S 1 S 2 S 3 S4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! S 4 Mathematical S 0 S 1 S 2 S 3 S5 S 6 S 7 S 8 S 9 S 10

### GREATEST COMMON DIVISOR

DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction.

Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction. February 21, 2006 1 Proof by Induction Definition 1.1. A subset S of the natural numbers is said to be inductive if n S we have

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### Algebra for Digital Communication

EPFL - Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain

### GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!

GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!!! Challenge Problem 2 (Mastermind) due Fri. 9/26 Find a fourth guess whose scoring will allow you to determine the secret code (repetitions are

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

### Discrete Mathematics, Chapter 5: Induction and Recursion

Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Well-founded

### Section 4.2: The Division Algorithm and Greatest Common Divisors

Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

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

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

### Solutions to In-Class Problems Week 4, Mon.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### Induction and Recursion

Induction and Recursion Winter 2010 Mathematical Induction Mathematical Induction Principle (of Mathematical Induction) Suppose you want to prove that a statement about an integer n is true for every positive

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

### This section demonstrates some different techniques of proving some general statements.

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### Fundamentele Informatica II

Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

### RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

### Handout NUMBER THEORY

Handout of NUMBER THEORY by Kus Prihantoso Krisnawan MATHEMATICS DEPARTMENT FACULTY OF MATHEMATICS AND NATURAL SCIENCES YOGYAKARTA STATE UNIVERSITY 2012 Contents Contents i 1 Some Preliminary Considerations

### 2 The Euclidean algorithm

2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In

### Mathematical Induction

Mathematical Induction Victor Adamchik Fall of 2005 Lecture 2 (out of three) Plan 1. Strong Induction 2. Faulty Inductions 3. Induction and the Least Element Principal Strong Induction Fibonacci Numbers

### Problem Set I: Preferences, W.A.R.P., consumer choice

Problem Set I: Preferences, W.A.R.P., consumer choice Paolo Crosetto paolo.crosetto@unimi.it Exercises solved in class on 18th January 2009 Recap:,, Definition 1. The strict preference relation is x y

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### Review for Final Exam

Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters

### COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative

### Math 330A Class Drills All content copyright October 2010 by Mark Barsamian

Math 330A Class Drills All content copyright October 2010 by Mark Barsamian When viewing the PDF version of this document, click on a title to go to the Class Drill. Drill for Section 1.3.1: Theorems about

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### Solutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2)

Solutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2) Problems from 21 211 Prove that a b (mod n) if and only if a and b leave the same remainder when divided by n Proof Suppose a

### 8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### 4. Number Theory (Part 2)

4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.

### Basic Proof Techniques

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

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

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### PERIMETERS OF PRIMITIVE PYTHAGOREAN TRIANGLES. 1. Introduction

PERIMETERS OF PRIMITIVE PYTHAGOREAN TRIANGLES LINDSEY WITCOSKY ADVISOR: DR. RUSS GORDON Abstract. This paper examines two methods of determining whether a positive integer can correspond to the semiperimeter

### MATH 22. THE FUNDAMENTAL THEOREM of ARITHMETIC. Lecture R: 10/30/2003

MATH 22 Lecture R: 10/30/2003 THE FUNDAMENTAL THEOREM of ARITHMETIC You must remember this, A kiss is still a kiss, A sigh is just a sigh; The fundamental things apply, As time goes by. Herman Hupfeld

### Logic and Incidence Geometry

Logic and Incidence Geometry February 27, 2013 1 Informal Logic Logic Rule 0. No unstated assumption may be used in a proof. 2 Theorems and Proofs If [hypothesis] then [conclusion]. LOGIC RULE 1. The following

### It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

### Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

### S(A) X α for all α Λ. Consequently, S(A) X, by the definition of intersection. Therefore, X is inductive.

MA 274: Exam 2 Study Guide (1) Know the precise definitions of the terms requested for your journal. (2) Review proofs by induction. (3) Be able to prove that something is or isn t an equivalence relation.

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

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

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

### Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

### Direct Proofs. CS 19: Discrete Mathematics. Direct Proof: Example. Indirect Proof: Example. Proofs by Contradiction and by Mathematical Induction

Direct Proofs CS 19: Discrete Mathematics Amit Chakrabarti Proofs by Contradiction and by Mathematical Induction At this point, we have seen a few examples of mathematical proofs. These have the following

### 1.4 Factors and Prime Factorization

1.4 Factors and Prime Factorization Recall from Section 1.2 that the word factor refers to a number which divides into another number. For example, 3 and 6 are factors of 18 since 3 6 = 18. Note also that

### 2.2 Inverses and GCDs

2.2. INVERSES AND GCDS 49 2.2 Inverses and GCDs Solutions to Equations and Inverses mod n In the last section we explored multiplication in Z n.wesaw in the special case with n =12and a =4that if we used

### Equivalence Relations

Equivalence Relations Definition An equivalence relation on a set S, is a relation on S which is reflexive, symmetric and transitive. Examples: Let S = Z and define R = {(x,y) x and y have the same parity}

### Section 3 Sequences and Limits, Continued.

Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular

### CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

### TREES IN SET THEORY SPENCER UNGER

TREES IN SET THEORY SPENCER UNGER 1. Introduction Although I was unaware of it while writing the first two talks, my talks in the graduate student seminar have formed a coherent series. This talk can be

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### Further linear algebra. Chapter I. Integers.

Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides

### Mathematical induction. Niloufar Shafiei

Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of

### Mathematical Induction. Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition)

Mathematical Induction Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition) Mathmatical Induction Mathmatical induction can be used to prove statements that assert that P(n) is true for all positive

### LESSON 1 PRIME NUMBERS AND FACTORISATION

LESSON 1 PRIME NUMBERS AND FACTORISATION 1.1 FACTORS: The natural numbers are the numbers 1,, 3, 4,. The integers are the naturals numbers together with 0 and the negative integers. That is the integers

### Geometry - Chapter 2 Review

Name: Class: Date: Geometry - Chapter 2 Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Determine if the conjecture is valid by the Law of Syllogism.

### Congruences. Robert Friedman

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

### Solutions to Practice Problems

Solutions to Practice Problems March 205. Given n = pq and φ(n = (p (q, we find p and q as the roots of the quadratic equation (x p(x q = x 2 (n φ(n + x + n = 0. The roots are p, q = 2[ n φ(n+ ± (n φ(n+2

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### Foundations of Geometry 1: Points, Lines, Segments, Angles

Chapter 3 Foundations of Geometry 1: Points, Lines, Segments, Angles 3.1 An Introduction to Proof Syllogism: The abstract form is: 1. All A is B. 2. X is A 3. X is B Example: Let s think about an example.

### 3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### More Mathematical Induction. October 27, 2016

More Mathematical Induction October 7, 016 In these slides... Review of ordinary induction. Remark about exponential and polynomial growth. Example a second proof that P(A) = A. Strong induction. Least

### arxiv:1301.6807v1 [math.nt] 29 Jan 2013

arxiv:1301.6807v1 [math.nt] 9 Jan 013 Modified Stern-Brocot Sequences Dhroova Aiylam Mass Academy of Math and Science January 30, 013 Abstract We discuss and prove several of the properties of the Stern-Brocot

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### 17 Greatest Common Factors and Least Common Multiples

17 Greatest Common Factors and Least Common Multiples Consider the following concrete problem: An architect is designing an elegant display room for art museum. One wall is to be covered with large square

### 12 Greatest Common Divisors. The Euclidean Algorithm

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to

### 8.7 Mathematical Induction

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture