# Chapter 3. if 2 a i then location: = i. Page 40

Size: px
Start display at page:

Download "Chapter 3. if 2 a i then location: = i. Page 40"

Transcription

1 Chapter 3 1. Describe an algorithm that takes a list of n integers a 1,a 2,,a n and finds the number of integers each greater than five in the list. Ans: procedure greaterthanfive(a 1,,a n : integers) answer : = 0 for i : = 1 to n if a i > 5 then answer : = answer Describe an algorithm that takes a list of integers a 1,a 2,,a n (n 2) and finds the secondlargest integer in the sequence. Ans: procedure secondlargest(a 1,,a n : integers) largest : = a 1 secondlargest : = a 2 if a 2 > a 1 then begin secondlargest : = a 1 largest : = a 2 end if n = 2 then stop for i : = 3 to n if a i > largest then begin secondlargest : = largest largest : = a i end if (a i > secondlargest and a i largest) then secondlargest: = a i. 3. Describe an algorithm that takes a list of n integers (n 1) and finds the location of the last even integer in the list, or returns 0 if there are no even integers in the list. Ans: procedure lasteven(a 1,,a n : integers) location : = 0 for i : = 1 to n if 2 a i then location: = i. Page 40

2 4. Describe an algorithm that takes a list of n integers (n 1) and finds the average of the largest and smallest integers in the list. Ans: procedure avgmaxmin(a 1,,a n : integers) max: = a 1 min: = a 1 for i : = 2 to n begin if a i > max then max: = a i if a i < min then min: = a i end avg: =(max + min)/2. 5. Describe in words how the binary search works. Ans: To search for x in an ordered list a 1,,a n, find the midpoint of the list and choose the appropriate half of the list. Continue until the list consists of one element. Either this element is x, or else x is not in the list. 6. Show how the binary search algorithm searches for 27 in the following list: Ans: The consecutive choices of sublists of the original list are: , 25 31, and 25. Since 27 25, the integer 25 is not in the list. 7. You have supplies of boards that are one foot, five feet, seven feet, and twelve feet long. You need to lay pieces end-to-end to make a molding 15 feet long and wish to do this using the fewest number of pieces possible. Explain why the greedy algorithm of taking boards of the longest length at each stage (so long as the total length of the boards selected does not exceed 15 feet) does not give the fewest number of boards possible. Ans: The greedy algorithm first chooses a 12-foot-long board, and then three one-footlong boards. This requires four boards. But only three boards are needed: each five feet long. 8. Use the definition of big-oh to prove that n 2 is O(n 3 ). Ans: n 2 n 2 + n n 2 = n n 2 = n n 8 4n 9. Use the definition of big-oh to prove that is O(n 2 ). 2n n 8 4n 3n + 8n + 4n 15n 2 Ans: = = 15n if n 1. 2n 1 2n n n 10. Use the definition of big-oh to prove that n 3 is O(n 4 ). Ans: n 3 n 3 + n n 3 = n n 3 = n 4. Page 41

3 5 6n+ 4n Use the definition of big-oh to prove that 2 7n n+ 4n 4 6n + 4n 10n 5 3 Ans: = = n, if n n 3 7n n 6n 3 is O(n 3 ). 12. Use the definition of big-oh to prove that (n 1) n is O(n 3 ). Ans: (n 1) n (n 1) n + (n 1) n (n 1) n = (n 1) 2 n n Let f(n) = 3n 2 + 8n + 7. Show that f(n) is O(n 2 ). Find C and k from the definition. Ans: f(n) 3n 2 + 8n 2 + 7n 2 = 18n 2 if n 1; therefore C = 18 and k = 1 can be used. Use the following to answer questions 14-19: In the questions below find the best big-oh function for the function. Choose your answer from among the following: 1, log 2 n, n, n log 2 n, n 2, n 3,, 2 n, n!. 14. f(n) = (3n + 1). Ans: n g(n) = (2n 1). Ans: n n 4n. 3 2n 3n Ans: n. 17. f(n) = (n 2 1) + n 2. Ans: n n + 2 n/3. Ans: n n 4 + log 2 n 8. Ans: n 4. n Show that ( j + j) is O(n 4 ). j= 1 n n Ans:. ( j + j) ( n + n ) = n 2n = 2n j= 1 j= 1 Page 42

4 21. Show that f(x) = (x + 2)log 2 (x 2 + 1) + log 2 (x 3 + 1) is O(xlog 2 x). Ans: log 2 (x 2 + 1) and log 2 (x 3 + 1) are each O(log 2 x). Thus each term is O(xlog 2 x), and hence so is the sum. 22. Find the best big-o function for n 3 + sin n 7. Ans: n Find the best big-o function for Ans: x 2. 3 x + 7x. 3x Prove that 5x 4 + 2x 3 1 is Θ(x 4 ). Ans: 5x 4 + 2x 3 1 is O(x 4 ) since 5x 4 + 2x 3 1 5x 4 + 2x 4 7 x 4 (if x 1). Also, x 4 is O(5x 4 + 2x 3 1) since x 4 5x 4 + x 3 5x 4 + 2x 3 1 (if x 1). 3 2 x + 7x Prove that is Θ(x 2 ). 2x x + 7x + 3 Ans: is O(x x + 7x + 3 x + 7x + 3x 11x 11 2 ) since = = x (if x 1). 2x + 1 2x+ 1 2x 2x 2 Also, x x + 7x x x + 7x x + 7x+ 3 x + 7x + 3 is O since x = 2x + 1 x 2x 2x+ 1 2x+ 1 (if x 1). 26. Prove that x 3 + 7x + 2 is Ω(x 3 ). Ans: x 3 + 7x x 3 (if x 1). Use the following to answer questions 27-37: In the questions below find the best big-oh notation to describe the complexity of the algorithm. Choose your answers from the following: 1, log 2 n, n, nlog 2 n, n 2, n 3,, 2 n, n!. 27. A binary search of n elements. Ans: log 2 n. 28. A linear search to find the smallest number in a list of n numbers. Ans: n. 29. An algorithm that lists all ways to put the numbers 1,2,3,,n in a row. Ans: n!. 30. An algorithm that prints all bit strings of length n. Ans: 2 n. Page 43

5 31. The number of print statements in the following: i : = 1, j : = 1 while i n begin while j i begin print ``hello''; j : = j + 1 end i : = i + 1 end. Ans: n The number of print statements in the following: while n > 1 begin print ``hello''; n : = n/2 end. Ans: log 2 n. 33. An iterative algorithm to compute n!, (counting the number of multiplications). Ans: n. 34. An algorithm that finds the average of n numbers by adding them and dividing by n. Ans: n. 35. An algorithm that prints all subsets of size three of the set {1,2,3,, n}. Ans: n The best-case analysis of a linear search of a list of size n (counting the number of comparisons). Ans: The worst-case analysis of a linear search of a list of size n (counting the number of comparisons). Ans: n. 38. Prove or disprove: For all integers a,b,c,d, if a b and c d, then (a + c) (b + d). : a = b = c = 1, d = Prove or disprove: For all integers a,b,c, if a b and b c then a c. Ans: True: If b = ak and c = bl, then c = a(kl), so a c. Page 44

6 40. Prove or disprove: For all integers a,b,c, if a c and b c, then (a + b) c. : a = b = c = Prove or disprove: For all integers a,b,c,d, if a b and c d, then (ac) (b + d). : a = b = 2,c = d = Prove or disprove: For all integers a,b, if a b and b a, then a = b. : a = 1,b = Prove or disprove: For all integers a,b,c, if a (b + c), then a b and a c. : a = 2,b = c = Prove or disprove: For all integers a,b,c, if a bc, then a b or a c. : a = 4,b = 2,c = Prove or disprove: For all integers a,b,c, if a c and b c, then ab c 2. Ans: True: If c = ak and c = bl, then c 2 = ab(kl), so ab c Find the prime factorization of 1,024. Ans: Find the prime factorization of 1,025. Ans: Find the prime factorization of 510,510. Ans: Find the prime factorization of 8,827. Ans: Find the prime factorization of 45,617. Ans: Find the prime factorization of 111,111. Ans: List all positive integers less than 30 that are relatively prime to 20. Ans: 1,3,7,9,11,13,17,19,21,23,27, Find gcd(20!,12!) by directly finding the largest divisor of both numbers. Ans: 12!. 54. Find gcd(2 89,2 346 ) by directly finding the largest divisor of both numbers. Ans: Page 45

7 55. Find lcm(20!,12!) by directly finding the smallest positive multiple of both numbers. Ans: 20!. 56. Find lcm(2 89,2 346 ) by directly finding the smallest positive multiple of both numbers. Ans: Suppose that the lcm of two numbers is 400 and their gcd is 10. If one of the numbers is 50, find the other number. Ans: Applying the division algorithm with a = 41 and d = 6 yields what value of r? Ans: Find 18 mod 7. Ans: Find 88 mod 13. Ans: Find 289 mod 17. Ans: Find the hexadecimal expansion of ABC16 + 2F516. Ans: (DB. 1) Prove or disprove: A positive integer congruent to 1 modulo 4 cannot have a prime factor congruent to 3 modulo 4. : 9 = = Find 50! mod 50. Ans: Find 50! mod 49!. Ans: Prove or disprove: The sum of two primes is a prime. ; is not prime. 67. Prove or disprove: If p and q are primes (> 2), then p + q is composite. Ans: p + q is even, hence composite. 68. Prove or disprove: There exist two consecutive primes, each greater than 2. ; one of any two consecutive integers is even, hence not prime. Page 46

8 69. Prove or disprove: The sum of two irrational numbers is irrational. ; 2 + ( 2) = Prove or disprove: If a and b are rational numbers (not equal to zero), then a b is rational. 12 / ; (1/ 2) = 2/ 2, which is not rational. 71. Prove or disprove: If f (n) = n 2 n + 17, then f (n) is prime for all positive integers n., f (17) is divisible by Prove or disprove: If p and q are primes (> 2), then pq + 1 is never prime. Ans: pq + 1 is an even number, hence not prime. 73. Find three integers m such that 13 7 (mod m). Ans: 2,3, Find the smallest positive integer a such that a + 1 2a (mod 11). Ans: Find four integers b (two negative and two positive) such that 7 b (mod 4). Ans: 3,7,11,15,, 1, 5, 9,. 76. Find an integer a such that a 3a (mod 7). Ans: 0,±7,±14,. 77. Find integers a and b such that a + b a b (mod 5). Ans: b = 0,±5,±10,±15, ; a any integer. Use the following to answer questions 78-84: In the questions below determine whether each of the following theorems is true or false. Assume that a, b, c, d, and m are integers with m > If a b (mod m), and a c (mod m), then a b + c(mod m). 79. If a b (mod m) and c d (mod m), then ac b + d (mod m). 80. If a b (mod m), then 2a 2b (mod m). Ans: True 81. If a b (mod m), then 2a 2b (mod 2m). Ans: True Page 47

9 82. If a b (mod m), then a b (mod 2m). 83. If a b (mod 2m), then a b (mod m). Ans: True 84. If a b (mod m 2 ), then a b (mod m). Ans: True 85. Either find an integer x such that x 2 (mod 6) and x 3 (mod 9) are both true, or else prove that there is no such integer. Ans: There is no such x; if there were, then there would be integers k and l such that x 2 = 6k and x 3 = 9l. Hence 1 = 6k 9l = 3(2k 3l), which is not possible. 86. What sequence of pseudorandom numbers is generated using the pure multiplicative generator x n + 1 = 3x n mod11 with seed x 0 = 2? Ans: The sequence 2,6,7,10,8 repeats. 87. Encrypt the message NEED HELP by translating the letters into numbers, applying the encryption function f (p) = (p + 3) mod 26, and then translating the numbers back into letters. Ans: Encrypted form: QHHG KHOS. 88. Encrypt the message NEED HELP by translating the letters into numbers, applying the encryption function f (p) = (3p + 7) mod 26, and then translating the numbers back into letters. Ans: Encrypted form: UTTQ CTOA. 89. Suppose that a computer has only the memory locations 0,1,2,,19. Use the hashing function h where h(x) = (x + 5) mod 20 to determine the memory locations in which 57, 32, and 97 are stored. Ans: 2,17, A message has been encrypted using the function f (x) = (x + 5) mod 26. If the message in coded form is JCFHY, decode the message. Ans: EXACT. 91. Explain why f (x) = (2x + 3) mod 26 would not be a good coding function. Ans: f is not 1 1 (f (0) = f (13)), and hence f 1 is not a function. 92. Encode the message stop at noon using the function f (x) = (x + 6) mod 26. Ans: YZUV GZ TUUT. Page 48

10 93. Explain in words the difference between a b and b a. Ans: a b is a statement; b a represents a number. 94. Prove or disprove: if p and q are prime numbers, then pq + 1 is prime. : p = q = (a) Find two positive integers, each with exactly three positive integer factors greater than 1. (b) Prove that there are an infinite number of positive integers, each with exactly three positive integer factors greater than 1. Ans: (a) 8,27. (b) Any integer of the form p 3 where p is prime. 96. Convert (204) 10 to base 2. Ans: Convert (11101) 2 to base 16. Ans: 1D. 98. Convert (11101) 2 to base 10. Ans: Convert (2AC) 16 to base 10. Ans: Convert (10000) 10 to base 2. Ans: Convert (8091) 10 to base 2. Ans: Convert (BC1) 16 to base 2. Ans: Convert ( ) 2 to base 16. Ans: 4C Take any three-digit integer, reverse its digits, and subtract. For example, = 495. The difference is divisible by 9. Prove that this must happen for all three-digit numbers abc. Ans: abc cba = 100a + 10b + c (100c + 10b + a) = 99a 99c = 9(11a 11c). Therefore 9 abc cba. Page 49

11 105. Prove or disprove that 30! ends in exactly seven 0s. Ans: True. When the factors 5, 10, 15, 20, and 30 are multiplied by the factor 2, each contributes one zero; when the factor 25 is multiplied by two factors 2, it contributes two zeros Here is a sample proof that contains an error. Explain why the proof is not correct. Theorem: If a b and b c, then a c. Proof: Since a b, b = ak. Since b c, c = bk. Therefore c = bk = (ak)k = ak 2. Therefore a c. Ans: The proof is not correct since there is no guarantee that the multiple k will be the same in both cases Prove: if n is an integer that is not a multiple of 3, then n 2 1 mod 3. Ans: Proof by cases. Suppose n is not a multiple of 3. Then n = 3k + 1, n = 3k + 2 for some integer k. Case 1, n = 3k + 1: therefore n 2 = (3k + 1) 2 = 9k 2 + 6k + 1 = 3(3k 2 + 2k) + 1, and hence n 2 1 mod 3. Case 2, n = 3k + 2: therefore n 2 = (3k + 2) 2 = 9k k + 4 = 3(3k 2 + 4k + 1) + 1, and hence n 2 1 mod Prove: if n is an integer that is not a multiple of 4, then n 2 0 mod 4 or n 2 1 mod 4. Ans: Proof by cases. Suppose n is not a multiple of 4. Then there is an integer k such that n = 4k + 1, n = 4k + 2, or n = 4k + 3. Case 1, n = 4k + 1: therefore n 2 = (4k + 1) 2 = 16k 2 + 8k + 1 = 4(4k 2 + 2k) + 1, and hence n 2 1 mod 4. Case 2, n = 4k + 2: therefore n 2 = (4k + 2) 2 = 16k k + 4 = 4(4k 2 + 4k + 1), and hence n 2 0 mod 4. Case 3, n = 4k + 3: therefore n 2 = (4k + 3) 2 = 16k k + 9 = 4(4k 2 + 6k + 2) + 1, and hence n 2 1 mod Use the Euclidean algorithm to find gcd(44,52). Ans: Use the Euclidean algorithm to find gcd(144,233). Ans: Use the Euclidean algorithm to find gcd(203,101). Ans: Use the Euclidean algorithm to find gcd(300,700). Ans: 100. Page 50

12 113. Use the Euclidean algorithm to find gcd(34,21). Ans: Use the Euclidean Algorithm to find gcd(900,140). Ans: Use the Euclidean Algorithm to find gcd(580,50). Ans: Use the Euclidean Algorithm to find gcd(390,72). Ans: Use the Euclidean Algorithm to find gcd(400,0). Ans: Use the Euclidean Algorithm to find gcd(128,729). Ans: Find the two's complement of 12. Ans: Find the two's complement of 13. Ans: Find the two's complement of 9. Ans: Find a 2 2 matrix A such that A = a a Ans: A matrix of the form where a 0. 4a 2a 123. Suppose A is a 6 8 matrix, B is an 8 5 matrix, and C is a 5 9 matrix. Find the number of rows, the number of columns, and the number of entries in A(BC). Ans: A(BC) has 6 rows, 9 columns, and 54 entries. 1 m 124. Let A =. Find A n where n is a positive integer. 0 1 Ans: n 1 mn A =. 0 1 Page 51

13 Suppose A = and 2 4 C = 0 6. Find a matrix B such that AB = C or prove that no such matrix exists. Ans: Suppose B = and 2 4 C = 0 6. Find a matrix A such that AB = C or prove that no such matrix exists. 3 7/2 Ans: Suppose B = and 3 1 C = 0 6. Find a matrix A such that AB = C or prove that no such matrix exists. Ans: None exists since det B = 0 and det C 0. Use the following to answer questions : In the questions below determine whether the statement is true or false If AB = AC, then B = C If A =, then 1 2 A = If A =, then. 5 2 A = If A is a 6 4 matrix and B is a 4 5 matrix, then AB has 16 entries If A and B are 2 2 matrices such that AB= , then A= or B=. 0 0 Page 52

14 133. If A and B are 2 2 matrices, then A+B=B+A. Ans: True 134. AB=BA for all 2 2 matrices A and B What is the most efficient way to multiply the matrices A 1, A 2, A 3 of sizes 20 5, 5 50, 50 5? Ans: A 1 (A 2 A 3 ), 1750 multiplications What is the most efficient way to multiply the matrices A 1, A 2, A 3 of sizes 10 50, 50 10, 10 40? Ans: (A 1 A 2 )A 3, 9000 multiplications Suppose A = and B = Find (a) the join of A and B. (b) the meet of A and B. (c) the Boolean product of A and B. Ans: (a) (b). (c) Suppose A is a 2 2 matrix with real number entries such that AB=BA for all 2 2 matrices. What relationships must exist among the entries of A? a 0 Ans:. 0 a 139. Given that gcd(620,140) = 20, write 20 as a linear combination of 620 and 140. Ans: 620 ( 2) Given that gcd(662,414) = 2, write 2 as a linear combination of 662 and 414. Ans: 662 ( 5) Express gcd(84,18) as a linear combination of 18 and 84. Ans: 18 ( 9) Express gcd(450,120) as a linear combination of 120 and 450. Ans: ( 1). Page 53

15 143. Find an inverse of 5 modulo 12. Ans: Find an inverse of 17 modulo 19. Ans: Solve the linear congruence 2x 5 (mod 9). Ans: 7 + 9k Solve the linear congruence 5x 3 (mod 11). Ans: k. Page 54

### 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 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.

### 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

### 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

### 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

### 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

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition

### 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

### 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

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

### 26 Integers: Multiplication, Division, and Order

26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue

### Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### 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

### Discrete Mathematics, Chapter 4: Number Theory and Cryptography

Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility

### Playing with Numbers

PLAYING WITH NUMBERS 249 Playing with Numbers CHAPTER 16 16.1 Introduction You have studied various types of numbers such as natural numbers, whole numbers, integers and rational numbers. You have also

### MACM 101 Discrete Mathematics I

MACM 101 Discrete Mathematics I Exercises on Combinatorics, Probability, Languages and Integers. Due: Tuesday, November 2th (at the beginning of the class) Reminder: the work you submit must be your own.

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### 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

### 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

### Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

### 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

### Computing exponents modulo a number: Repeated squaring

Computing exponents modulo a number: Repeated squaring How do you compute (1415) 13 mod 2537 = 2182 using just a calculator? Or how do you check that 2 340 mod 341 = 1? You can do this using the method

### We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b

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

### Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### 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

### Test1. Due Friday, March 13, 2015.

1 Abstract Algebra Professor M. Zuker Test1. Due Friday, March 13, 2015. 1. Euclidean algorithm and related. (a) Suppose that a and b are two positive integers and that gcd(a, b) = d. Find all solutions

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Just the Factors, Ma am

1 Introduction Just the Factors, Ma am 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

### FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY

FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY LINDSEY R. BOSKO I would like to acknowledge the assistance of Dr. Michael Singer. His guidance and feedback were instrumental in completing this

### 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

### 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:

Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of

### 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

### DigitalCommons@University of Nebraska - Lincoln

University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### Introduction to Programming (in C++) Loops. Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC

Introduction to Programming (in C++) Loops Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC Example Assume the following specification: Input: read a number N > 0 Output:

### Example. Introduction to Programming (in C++) Loops. The while statement. Write the numbers 1 N. Assume the following specification:

Example Introduction to Programming (in C++) Loops Assume the following specification: Input: read a number N > 0 Output: write the sequence 1 2 3 N (one number per line) Jordi Cortadella, Ricard Gavaldà,

### 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)

### 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

### Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

### Abstract Algebra Cheat Sheet

Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the

### On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a

### An Introductory Course in Elementary Number Theory. Wissam Raji

An Introductory Course in Elementary Number Theory Wissam Raji 2 Preface These notes serve as course notes for an undergraduate course in number theory. Most if not all universities worldwide offer introductory

### A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

### 15 Prime and Composite Numbers

15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such

### Some practice problems for midterm 2

Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a long-winded way of asking for the value of 6 2000 mod

### V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography

V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography 3 Congruence Congruences are an important and useful tool for the study of divisibility. As we shall see, they are also critical

### 5-1 NUMBER THEORY: DIVISIBILITY; PRIME & COMPOSITE NUMBERS 210 f8

5-1 NUMBER THEORY: DIVISIBILITY; PRIME & COMPOSITE NUMBERS 210 f8 Note: Integers are the w hole numbers and their negatives (additive inverses). While our text discusses only whole numbers, all these ideas

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### Number Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures

Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### Here are some examples of combining elements and the operations used:

MATRIX OPERATIONS Summary of article: What is an operation? Addition of two matrices. Multiplication of a Matrix by a scalar. Subtraction of two matrices: two ways to do it. Combinations of Addition, Subtraction,

### STUDENT S SOLUTIONS MANUAL ELEMENTARY NUMBER THEORY. Bart Goddard. Kenneth H. Rosen AND ITS APPLICATIONS FIFTH EDITION. to accompany.

STUDENT S SOLUTIONS MANUAL to accompany ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS FIFTH EDITION Bart Goddard Kenneth H. Rosen AT&T Labs Reproduced by Pearson Addison-Wesley from electronic files supplied

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### The application of prime numbers to RSA encryption

The application of prime numbers to RSA encryption Prime number definition: Let us begin with the definition of a prime number p The number p, which is a member of the set of natural numbers N, is considered

### Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

### 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,

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### Primes. Name Period Number Theory

Primes Name Period A Prime Number is a whole number whose only factors are 1 and itself. To find all of the prime numbers between 1 and 100, complete the following exercise: 1. Cross out 1 by Shading in

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

### DIVISIBILITY AND GREATEST COMMON DIVISORS

DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will

### Base Conversion written by Cathy Saxton

Base Conversion written by Cathy Saxton 1. Base 10 In base 10, the digits, from right to left, specify the 1 s, 10 s, 100 s, 1000 s, etc. These are powers of 10 (10 x ): 10 0 = 1, 10 1 = 10, 10 2 = 100,

### RSA and Primality Testing

and Primality Testing Joan Boyar, IMADA, University of Southern Denmark Studieretningsprojekter 2010 1 / 81 Correctness of cryptography cryptography Introduction to number theory Correctness of with 2

### CS321. Introduction to Numerical Methods

CS3 Introduction to Numerical Methods Lecture Number Representations and Errors Professor Jun Zhang Department of Computer Science University of Kentucky Lexington, KY 40506-0633 August 7, 05 Number in

### Solutions Manual for How to Read and Do Proofs

Solutions Manual for How to Read and Do Proofs An Introduction to Mathematical Thought Processes Sixth Edition Daniel Solow Department of Operations Weatherhead School of Management Case Western Reserve

### 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

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### Examples of Functions

Examples of Functions In this document is provided examples of a variety of functions. The purpose is to convince the beginning student that functions are something quite different than polynomial equations.

### Factorization Algorithms for Polynomials over Finite Fields

Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is

### Chapter 4 -- Decimals

Chapter 4 -- Decimals \$34.99 decimal notation ex. The cost of an object. ex. The balance of your bank account ex The amount owed ex. The tax on a purchase. Just like Whole Numbers Place Value - 1.23456789

### The Euclidean Algorithm

The Euclidean Algorithm A METHOD FOR FINDING THE GREATEST COMMON DIVISOR FOR TWO LARGE NUMBERS To be successful using this method you have got to know how to divide. If this is something that you have

### (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.

11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order

### Name: Section Registered In:

Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### 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

### NUMBER SYSTEMS. William Stallings

NUMBER SYSTEMS William Stallings The Decimal System... The Binary System...3 Converting between Binary and Decimal...3 Integers...4 Fractions...5 Hexadecimal Notation...6 This document available at WilliamStallings.com/StudentSupport.html

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

### H/wk 13, Solutions to selected problems

H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Number Theory: A Mathemythical Approach. Student Resources. Printed Version

Number Theory: A Mathemythical Approach Student Resources Printed Version ii Contents 1 Appendix 1 2 Hints to Problems 3 Chapter 1 Hints......................................... 3 Chapter 2 Hints.........................................

### THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2 y +n = x 2 for fixed positive n. The computational

### CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis. Linda Shapiro Winter 2015

CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis Linda Shapiro Today Registration should be done. Homework 1 due 11:59 pm next Wednesday, January 14 Review math essential

### An Introduction to the RSA Encryption Method

April 17, 2012 Outline 1 History 2 3 4 5 History RSA stands for Rivest, Shamir, and Adelman, the last names of the designers It was first published in 1978 as one of the first public-key crytographic systems

### 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

### ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### Oct: 50 8 = 6 (r = 2) 6 8 = 0 (r = 6) Writing the remainders in reverse order we get: (50) 10 = (62) 8

ECE Department Summer LECTURE #5: Number Systems EEL : Digital Logic and Computer Systems Based on lecture notes by Dr. Eric M. Schwartz Decimal Number System: -Our standard number system is base, also

### Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

### Systems of Linear Equations

Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

### Chapter 8 Integers 8.1 Addition and Subtraction

Chapter 8 Integers 8.1 Addition and Subtraction Negative numbers Negative numbers are helpful in: Describing temperature below zero Elevation below sea level Losses in the stock market Overdrawn checking

### COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about