Solutions to Assignment 1

Size: px
Start display at page:

Download "Solutions to Assignment 1"

Transcription

1 Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive integer n, the only possible remainders when n is divided by 4 are r = 0, 1, 2, 3, so that n has exactly one of the forms 4k, 4k + 1, 4k + 2, 4k + 3 for some integer k. Since 4k and 4k + 2 are even, then every odd integer has the form 4k + 1 or 4k + 3 for some integer k. Question 2. [Exercises 1.1, # 8] (a) Divide 5 2, 7 2, 11 2, 15 2, and 27 2 by 8 and note the remainder in each case. (b) Make a conjecture about the remainder when the square of an odd integer is divided by 8. (c) Prove your conjecture. (a) We have 5 2 = 25 = = = 49 = = = 121 = = = 225 = = = 729 = = , and the remainder is 1 in each case. (b) The conjecture is that for any odd integer n, we have n 2 = 8k + 1 for some integer k. (c) If n is an odd integer. then n = 4m + 1 or n = 4m + 3 for some integer m, so that either n 2 = (4m + 1) 2 = 16m 2 + 8m + 1 = 8(2m + 1) + 1 or n 2 = (4m + 3) 2 = 16m m + 1 = 8(2m + 3) + 1 and in both cases n 2 = 8k + 1.

2 Question 3. [Exercises 1.2, # 8]. If r Z and r is a nonzero solution of x 2 + ax + b = 0 (where a, b Z), prove that r b. If r is a nonzero solution of x 2 + ax + b = 0, then r 2 + ar + b = 0, so that and r b. b = r 2 ar = r(r + a), Question 4. [Exercises 1.2, # 10]. Prove that (n, n + 1) = 1 for every positive integer n. Note that 1 = 1 (n + 1) + ( 1) n, so that 1 is a linear combination of n + 1 and n, and is the smallest such positive integer. (n, n + 1) = 1. Therefore Question 5. [Exercises 1.2, # 16]. If (a, b) = d, prove that ( a d, b ) = 1. d If (a, b) = d, then there exist integers x and y such that d = ax + by, and since d 1 > 0, dividing both sides of this equation by d, we have 1 = a d x + b d y, so that 1 is a linear combination of a d and b ( a d, and is the smallest such positive integer. Therefore d, b ) = 1. d Question 6. [Exercises 1.2, # 26]. Let a, b, c Z. Prove that the equation ax + by = c has integer solutions if and only if (a, b) c. Suppose that (a, b) c, then c = k (a, b) for some integer k. Also, (a, b) = ax 0 + by 0 for some integers x 0 and y 0, so that c = k(a, b) = akx 0 + bky 0 = ax + by where x = kx 0 and y = ky 0 are in Z, and the equation ax + by = c has integer solutions. Conversely, suppose that there exist integer solutions to the equation ax + by = c, say, since (a, b) a and (a, b) b, then (a, b) c. ax 0 + by 0 = c,

3 Question 7. [Exercises 1.2, # 32]. Prove that a positive integer is divisible by 3 if and only if the sum of its digits is divisible by 3. [Hint : 10 3 = and similarly for other powers of 10.] Every positive integer n has a unique representation as where 0 a i 9 for i = 0, 1, 2,... k. n = a 0 + a a a k 10 k Now, an easy proof by induction shows that for each 1 i k, 10 i 1 = (10 1) (10 i ) = 9 (10 i ), which is divisible by 9, and therefore is also divisible by 3. Thus, n (a 0 + a a k ) = a 1 (10 1 1) + a 2 (10 2 1) + + a k (10 k 1) is also divisible by 9, and hence also by 3, and therefore the positive integer n is divisible by 3 if and only if the sum of its decimal digits is also divisible by 3. Question 8. [Exercises 1.3, # 2]. Let p be an integer other than 0, ±1. Prove that p is prime if and only if for each a Z either (a, p) = 1 or p a. Suppose that p is a prime, and a Z. Let d = (a, p), since d p, then either d = 1 or d = p, that is, either (a, p) = 1 or p a. Let p be an integer other than 0, ±1, and suppose that p is not a prime, then (assuming p > 1) there exist integers a and b with 1 < a, b < p such that p = a b. Since a p, then (a, p) = a > 1. Also, since 1 < a < p, then p a. Question 9. [Exercises 1.3, # 8]. Prove that (a, b) = 1 if and only if there is no prime p such that p a and p b. Suppose (a, b) = 1, if p is a prime such that p a and p b, then p (a, b) = 1, which is a contradiction. Therefore there is no prime such that p a and p b. Conversely, if d = (a, b) > 1, then there exists a prime p such that p d, and since d a and d b, then p a and p b.

4 Question 10. [Exercises 1.3, # 12]. (a) If 3 (a 2 + b 2 ), prove that 3 a and 3 b. [Hint : If 3 a, then a = 3k + 1 or a = 3k + 2.] (b) If 5 (a 2 + b 2 + c 2 ), prove that 5 a or 5 b or 5 c. (a) Note that if 3 a, then a = 3k + 1 or a = 3k + 2 for some integer k, and a 2 = (3k + 1) 2 = 3(3k 2 + 2k) + 1 or a 2 = 3(3k 2 + 4k + 1) + 1 so that a 2 leaves a remainder of 1 when divided by 3. Therefore, a 2 + b 2 leaves a remainder of = 1 or = 2 depending on whether b is divisible by 3 or not. Thus, if 3 a, then 3 a 2 + b 2. Therefore, if 3 a 2 + b 2, then 3 a. Similarly, if 3 a 2 + b 2, then 3 b. (b) Suppose that a, b, c are integers such that 5 a, 5 b, and 5 c. Since 5 a, then a and a 2 must have one of the forms a = 5k + 1 and a 2 = (5k + 1) 2 = 25k k + 1 a = 5k + 2 and a 2 = (5k + 2) 2 = 25k k + 4 a = 5k + 3 and a 2 = (5k + 3) 2 = 25k k a = 5k + 4 and a 2 = (5k + 4) 2 = 25k k so that a 2 can only leave a remainder of 1 or 4 when divided by 5, similarly for b 2 and c 2. Therefore, when a 2 + b 2 is divided by 5, the only possible remainders are 2, 0, or 3, since = 2, = 5, = 8, and the only possible remainders when (a 2 + b 2 ) + c 2 is divided by 5 are 1, 2, 3, or 4, since and 5 a 2 + b 2 + c = 3 and = = 1 and = = 4 and = 7,

5 Question 11. [Exercises 1.3, # 20]. (a) Prove that there are no nonzero integers a, b such that a 2 = 2b 2. [Hint : Use the Fundamental Theorem of Arithmetic or Theorem 1.8.] (b) Prove that 2 is irrational. [Hint : Use proof by contradiction (Appendix A). Assume that 2 = a/b (with a, b Z) and use part (a) to reach a contradiction.] (a) Suppose there exist positive integers a and b such that a 2 = 2b 2. From the Fundamental Theorem of Arithmetic, we may assume that a and b have no prime factors in common (if they do, just cancel them from both sides of the equation a 2 = 2b 2 ). Since 2 is prime, and 2 a 2 = a a, then either 2 a or 2 a, and hence 2 a, and a = 2k for some integer k. Therefore a 2 = (2k) 2 = 4k 2 = 2b 2, so that b 2 = 2k 2, and the same argument as above shows that 2 b. However, this contradicts the fact that a and b have no prime factors in common. Therefore there are no nonzero integers a and b such that a 2 = 2b 2. (b) Suppose that 2 is rational, then there exist positive integers a and b such that 2 = a b, so that a = 2 b. Squaring both sides, we get a 2 = 2b 2, which is a contradiction. Therefore 2 is irrational.

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

In Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3

In Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3 APPENDIX A EXERCISES In Exercises 1 12, list the all of the elements of the given set. 1. The set of all prime numbers less than 20 2. The set of all positive integers whose square roots are less than

More information

Mathematics 228(Q1), Assignment 2 Solutions

Mathematics 228(Q1), Assignment 2 Solutions Mathematics 228(Q1), Assignment 2 Solutions Exercise 1.(10 marks) A natural number n > 1 is said to be square free if d N with d 2 n implies d = 1. Show that n is square free if and only if n = p 1 p k

More information

Math 109 HW 9 Solutions

Math 109 HW 9 Solutions Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we

More information

MATH10040: Numbers and Functions Homework 1: Solutions

MATH10040: Numbers and Functions Homework 1: Solutions MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3

More information

CHAPTER 1 REAL NUMBERS KEY POINTS

CHAPTER 1 REAL NUMBERS KEY POINTS CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division

More information

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.

More information

REAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.

REAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental

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

Solutions to Practice Final

Solutions to Practice Final s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (

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

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

2301 Assignment 1 Due Friday 19th March, 2 pm

2301 Assignment 1 Due Friday 19th March, 2 pm Show all your work. Justify your solutions. Answers without justification will not receive full marks. Only hand in the problems on page 2. Practice Problems Question 1. Prove that if a b and a 3c then

More information

MATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions

MATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a

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

Midterm Preparation Problems

Midterm Preparation Problems Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then

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

MATHEMATICS X l Let x = p q be a rational number, such l If p, q, r are any three positive integers, then, l that the prime factorisation of q is of t

MATHEMATICS X l Let x = p q be a rational number, such l If p, q, r are any three positive integers, then, l that the prime factorisation of q is of t CHAPTER 1 Real Numbers [N.C.E.R.T. Chapter 1] POINTS FOR QUICK REVISION l Euclid s Division Lemma: Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r

More information

Class IX Chapter 1 Number Sustems Maths

Class IX Chapter 1 Number Sustems Maths Class IX Chapter 1 Number Sustems Maths Exercise 1.1 Question Is zero a rational number? Can you write it in the form 0? and q, where p and q are integers Yes. Zero is a rational number as it can be represented

More information

and LCM (a, b, c) LCM ( a, b) LCM ( b, c) LCM ( a, c)

and LCM (a, b, c) LCM ( a, b) LCM ( b, c) LCM ( a, c) CHAPTER 1 Points to Remember : REAL NUMBERS 1. Euclid s division lemma : Given positive integers a and b, there exists whole numbers q and r satisfying a = bq + r, 0 r < b.. Euclid s division algorithm

More information

Numbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =

Numbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 = 2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented

More information

Math 110 HW 3 solutions

Math 110 HW 3 solutions Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r

More information

. As the binomial coefficients are integers we have that. 2 n(n 1).

. As the binomial coefficients are integers we have that. 2 n(n 1). Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor

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

MATH CSE20 Homework 5 Due Monday November 4

MATH CSE20 Homework 5 Due Monday November 4 MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of

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

We want to show P (n) is true for all integers

We want to show P (n) is true for all integers Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to

More information

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

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

More information

1. multiplication is commutative and associative;

1. multiplication is commutative and associative; Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

More information

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)

More information

Masters Tuition Center

Masters Tuition Center 1 REAL NUMBERS Exercise 1.1 Q.1. Use Euclid s division algorithm to find the HCF of: (i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255 Solution. (i) In 135 and 225, 225 is larger integer. Using Euclid

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

CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4

CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4 CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement

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

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

A Level. A Level Mathematics. Proof by Contradiction (Answers) AQA, Edexcel, OCR. Name: Total Marks:

A Level. A Level Mathematics. Proof by Contradiction (Answers) AQA, Edexcel, OCR. Name: Total Marks: AQA, Edexcel, OCR A Level A Level Mathematics Proof by Contradiction (Answers) Name: Total Marks: A1 Proof Answers AQA, Edexcel, OCR 1) Prove that there is an infinite amount of prime numbers. Assume there

More information

Sequences, their sums and Induction

Sequences, their sums and Induction Sequences, their sums and Induction Example (1) Calculate the 15th term of arithmetic progression, whose initial term is 2 and common differnce is 5. And its n-th term? Find the sum of this sequence from

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

MATH 271 Summer 2016 Practice problem solutions Week 1

MATH 271 Summer 2016 Practice problem solutions Week 1 Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,

More information

a the relation arb is defined if and only if = 2 k, k

a the relation arb is defined if and only if = 2 k, k DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),

More information

N= {1,2,3,4,5,6,7,8,9,10,11,...}

N= {1,2,3,4,5,6,7,8,9,10,11,...} 1.1: Integers and Order of Operations 1. Define the integers 2. Graph integers on a number line. 3. Using inequality symbols < and > 4. Find the absolute value of an integer 5. Perform operations with

More information

Day 6: 6.4 Solving Polynomial Equations Warm Up: Factor. 1. x 2-2x x 2-9x x 2 + 6x + 5

Day 6: 6.4 Solving Polynomial Equations Warm Up: Factor. 1. x 2-2x x 2-9x x 2 + 6x + 5 Day 6: 6.4 Solving Polynomial Equations Warm Up: Factor. 1. x 2-2x - 15 2. x 2-9x + 14 3. x 2 + 6x + 5 Solving Equations by Factoring Recall the factoring pattern: Difference of Squares:...... Note: There

More information

Basic Proof Examples

Basic Proof Examples Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques

More information

Notes on Systems of Linear Congruences

Notes on Systems of Linear Congruences MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the

More information

Number Theory Homework.

Number Theory Homework. Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this

More information

Quantitative Aptitude

Quantitative Aptitude WWW.UPSCMANTRA.COM Quantitative Aptitude Concept 1 1. Number System 2. HCF and LCM 2011 Prelims Paper II NUMBER SYSTEM 2 NUMBER SYSTEM In Hindu Arabic System, we use ten symbols 0, 1, 2, 3, 4, 5, 6, 7,

More information

Section 19 Integral domains

Section 19 Integral domains Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There

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

MATH Dr. Halimah Alshehri Dr. Halimah Alshehri

MATH Dr. Halimah Alshehri Dr. Halimah Alshehri MATH 1101 haalshehri@ksu.edu.sa 1 Introduction To Number Systems First Section: Binary System Second Section: Octal Number System Third Section: Hexadecimal System 2 Binary System 3 Binary System The binary

More information

A group of figures, representing a number, is called a numeral. Numbers are divided into the following types.

A group of figures, representing a number, is called a numeral. Numbers are divided into the following types. 1. Number System Quantitative Aptitude deals mainly with the different topics in Arithmetic, which is the science which deals with the relations of numbers to one another. It includes all the methods that

More information

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

Know 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 Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring

More information

7. Prime Numbers Part VI of PJE

7. Prime Numbers Part VI of PJE 7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.

More information

Cool Results on Primes

Cool Results on Primes Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why

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

Complete Induction and the Well- Ordering Principle

Complete Induction and the Well- Ordering Principle Complete Induction and the Well- Ordering Principle Complete Induction as a Rule of Inference In mathematical proofs, complete induction (PCI) is a rule of inference of the form P (a) P (a + 1) P (b) k

More information

Standard forms for writing numbers

Standard forms for writing numbers Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,

More information

Handout - Algebra Review

Handout - Algebra Review Algebraic Geometry Instructor: Mohamed Omar Handout - Algebra Review Sept 9 Math 176 Today will be a thorough review of the algebra prerequisites we will need throughout this course. Get through as much

More information

Arithmetic, Algebra, Number Theory

Arithmetic, Algebra, Number Theory Arithmetic, Algebra, Number Theory Peter Simon 21 April 2004 Types of Numbers Natural Numbers The counting numbers: 1, 2, 3,... Prime Number A natural number with exactly two factors: itself and 1. Examples:

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

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2 MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been

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

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

Working with Square Roots. Return to Table of Contents

Working with Square Roots. Return to Table of Contents Working with Square Roots Return to Table of Contents 36 Square Roots Recall... * Teacher Notes 37 Square Roots All of these numbers can be written with a square. Since the square is the inverse of the

More information

2.2 Some Consequences of the Completeness Axiom

2.2 Some Consequences of the Completeness Axiom 60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that

More information

Problem Set 5 Solutions

Problem Set 5 Solutions Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true

More information

Fall 2017 November 10, Written Homework 5

Fall 2017 November 10, Written Homework 5 CS1800 Discrete Structures Profs. Aslam, Gold, & Pavlu Fall 2017 November 10, 2017 Assigned: Mon Nov 13 2017 Due: Wed Nov 29 2017 Instructions: Written Homework 5 The assignment has to be uploaded to blackboard

More information

MATH 361: NUMBER THEORY FOURTH LECTURE

MATH 361: NUMBER THEORY FOURTH LECTURE MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the

More information

Clock Arithmetic. 1. If it is 9 o clock and you get out of school in 4 hours, when do you get out of school?

Clock Arithmetic. 1. If it is 9 o clock and you get out of school in 4 hours, when do you get out of school? Clock Arithmetic We are going to learn all about clock addition and the relationship to remainders when you divide numbers. 1 Standard Clock Addition 1. If it is 9 o clock and you get out of school in

More information

Modular Arithmetic Instructor: Marizza Bailey Name:

Modular Arithmetic Instructor: Marizza Bailey Name: Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find

More information

STEP Support Programme. Hints and Partial Solutions for Assignment 17

STEP Support Programme. Hints and Partial Solutions for Assignment 17 STEP Support Programme Hints and Partial Solutions for Assignment 7 Warm-up You need to be quite careful with these proofs to ensure that you are not assuming something that should not be assumed. For

More information

As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic

As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic Chapter 4 Three Famous Theorems As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic The goal of this section is to prove The Fundamental Theorem

More information

Wilson s Theorem and Fermat s Little Theorem

Wilson s Theorem and Fermat s Little Theorem Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =

More information

Chapter 1 The Real Numbers

Chapter 1 The Real Numbers Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus

More information

Lesson 3.5 Exercises, pages

Lesson 3.5 Exercises, pages Lesson 3.5 Exercises, pages 232 238 A 4. Calculate the value of the discriminant for each quadratic equation. a) 5x 2-9x + 4 = 0 b) 3x 2 + 7x - 2 = 0 In b 2 4ac, substitute: In b 2 4ac, substitute: a 5,

More information

Twitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Factorise each polynomial: a) x 2 6x + 5 b) x 2 16 c) 9x 2 25 2) Simplify the following algebraic fractions fully: a) x 2

More information

Properties of Rational and Irrational Numbers

Properties of Rational and Irrational Numbers Properties of Rational and Irrational Numbers September 8, 2016 Definition: The natural numbers are the set of numbers N = {1, 2, 3,...}, and the integers are the set of numbers Z = {..., 2, 1, 0, 1, 2,...}.

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

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

Real Number. Euclid s division algorithm is based on the above lemma.

Real Number. Euclid s division algorithm is based on the above lemma. 1 CHAPTER We are Starting from a Point but want to Make it a Circle of Infinite Radius Basic Concepts 1. Euclid s division lemma Given two positive integers a and b, there exist unique integers q and r

More information

12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.

12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z. Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)

More information

The Real Number System

The Real Number System MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely

More information

Mathematics 228(Q1), Assignment 3 Solutions

Mathematics 228(Q1), Assignment 3 Solutions Mathematics 228(Q1), Assignment 3 Solutions Exercise 1.(10 marks)(a) If m is an odd integer, show m 2 1 mod 8. (b) Let m be an odd integer. Show m 2n 1 mod 2 n+2 for all positive natural numbers n. Solution.(a)

More information

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same

More information

Tenth Bit Bank Mathematics Real Numbers

Tenth Bit Bank Mathematics Real Numbers Tenth Bit Bank Mathematics Real Numbers 1. The rational number among the following is... i) 4.28 ii) 4.282828... iii) 4.288888... A) i) & ii) B) ii) & iii) C) i) & iii) D) All the above 2. A rational number

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

Ch 7 Summary - POLYNOMIAL FUNCTIONS

Ch 7 Summary - POLYNOMIAL FUNCTIONS Ch 7 Summary - POLYNOMIAL FUNCTIONS 1. An open-top box is to be made by cutting congruent squares of side length x from the corners of a 8.5- by 11-inch sheet of cardboard and bending up the sides. a)

More information

CHAPTER 3 REVIEW QUESTIONS MATH 3034 Spring a 1 b 1

CHAPTER 3 REVIEW QUESTIONS MATH 3034 Spring a 1 b 1 . Let U = { A M (R) A = and b 6 }. CHAPTER 3 REVIEW QUESTIONS MATH 334 Spring 7 a b a and b are integers and a 6 (a) Let S = { A U det A = }. List the elements of S; that is S = {... }. (b) Let T = { A

More information

Homework #2 solutions Due: June 15, 2012

Homework #2 solutions Due: June 15, 2012 All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is

More information

+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4

+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4 Math 4030-001/Foundations of Algebra/Fall 2017 Polynomials at the Foundations: Rational Coefficients The rational numbers are our first field, meaning that all the laws of arithmetic hold, every number

More information

Question 1: Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0?

Question 1: Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0? Class IX - NCERT Maths Exercise (.) Question : Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0? q Solution : Consider the definition of a rational number.

More information

Contents Real Numbers Polynomials 2 0 Pair of Linear Equations in Two Variables 3 8 Quadratic Equations 7 0

Contents Real Numbers Polynomials 2 0 Pair of Linear Equations in Two Variables 3 8 Quadratic Equations 7 0 Foreword Preface Contents 1. Real Numbers 1 1.1 Introduction 1 1. Euclid s Division Lemma 1.3 The Fundamental Theorem of Arithmetic 7 1.4 Revisiting Irrational Numbers 11 1.5 Revisiting Rational Numbers

More information

10.1 Radical Expressions and Functions Math 51 Professor Busken

10.1 Radical Expressions and Functions Math 51 Professor Busken 0. Radical Expressions and Functions Math 5 Professor Busken Objectives Find square roots without a calculator Simplify expressions of the form n a n Evaluate radical functions and find the domain of radical

More information

CHAPTER 2: Polynomial and Rational Functions

CHAPTER 2: Polynomial and Rational Functions 1) (Answers for Chapter 2: Polynomial and Rational Functions) A.2.1 CHAPTER 2: Polynomial and Rational Functions SECTION 2.1: QUADRATIC FUNCTIONS (AND PARABOLAS) ( ) ; c) x = 1 ( ) ( ) and ( 4, 0) ( )

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend

More information

Homework 3: Solutions

Homework 3: Solutions Homework 3: Solutions ECS 20 (Fall 2014) Patrice Koehl koehl@cs.ucdavis.edu October 16, 2014 Exercise 1 Show that this implication is a tautology, by using a table of truth: [(p q) (p r) (q r)] r. p q

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

More information

SEVENTH EDITION and EXPANDED SEVENTH EDITION

SEVENTH EDITION and EXPANDED SEVENTH EDITION SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to

More information

Introduction Integers. Discrete Mathematics Andrei Bulatov

Introduction Integers. Discrete Mathematics Andrei Bulatov Introduction Integers Discrete Mathematics Andrei Bulatov Discrete Mathematics - Integers 9- Integers God made the integers; all else is the work of man Leopold Kroenecker Discrete Mathematics - Integers

More information

Number Theory and Graph Theory. Prime numbers and congruences.

Number Theory and Graph Theory. Prime numbers and congruences. 1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes

More information

Computer Science Section 1.6

Computer Science Section 1.6 Computer Science 180 Solutions for Recommended Exercises Section 1.6. Let m and n be any two even integers (possibly the same). Then, there exist integers k and l such that m = k and n = l. Consequently,

More information