# Math 55: Discrete Mathematics

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February Let P (n) be the statement that n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What is the statement P (1)? b) Show that P (1) is true. c) What is the induction hypothesis? d) What do you need to prove in the inductive step? e) Complete the inductive step. f) Explain why these steps show that this formula is true for all positive integers n. a) P (1) is the statement 1 3 = ((1(1 + 1)/2) 2. b) This is true because both sides of the equation evaluate to 1. c) The induction hypothesis is the statement P (k) for some positive integer k, that is, the statement k 3 = (k(k +1)/2) 2. d) Assuming that P (k) holds, we need to show that P (k + 1) holds, that is, we need to derive the equation k 3 +(k+1) 3 = ((k + 1)(k + 2)/2) 2 from the equation in (c). e) We add (k + 1) 3 to both the left hand side and the right hand side of the equation in (c). This shows that the left hand side in (d) is equal to (k(k + 1)/2) 2 + (k + 1) 3. By expanding and factoring, we find that this expression equals ((k + 1)(k + 2)/2) 2. Hence we have shown that the left hand side of the equation in (d) equals the right hand side of the equation in (d). f) We have carried out both the basis step and the inductive step. The principle of mathematical induction now ensures that P (n) is true for all positive integers n. 1

2 5.1.6 Prove that 1 1! + 2 2! + + n n! = (n + 1)! 1 whenever n is a positive integer. We use mathematical induction. In fhe basis step, for n = 1, the equation states that 1 1! = (1 + 1)! 1, and this is true because both sides of the equation evaluate to 1. For the inductive step, we assume that 1 1! + 2 2! + + k k! = (k + 1)! 1 for some positive integer k. We add (k + 1)(k + 1)! to the left hand side to find that 1 1! + 2 2! + + (k + 1) (k + 1)! = (k + 1)! 1 + (k + 1)(k + 1)! The right hand side equals (k + 1)!(k + 2) 1 = (k + 2)! 1. This establishes the desired equation also for k + 1, and we are done by the principle of mathematical induction a) Find a formula for n(n + 1) by examining the values of this expression for small values of n. b) Prove the formula you conjectured in part (a). (a) By evaluating the sum for n = 1, 2, 3, 4, 5,..., we are led to conjecture that the following equation holds for all positive integers n: n(n + 1) = n n + 1. (1) (b) We use mathematical induction. The basis step is n = 1. Here both sides of the equation are equal to 1/2, so the claim holds. For the inductive step, we assume that (1) is true for n = k. We 1 add (k+1)(k+2) to both sides of this equation. Then the right hand side becomes k k (k + 1)(k + 2) = k(k + 2) + 1 (k + 1)(k + 2) = k + 1 k + 2. Hence the left hand side of (1) for n = k +1 equals the right hand side of (1) for n = k + 1. This completes the proof by induction Prove that n! < n n for all integers n 2, using the six suggested steps. Let P (n) be the propositional function n! < n n. 2

3 a) The statement P (2) says that 2! = 2 is less than 2 2 = 4. b) This statement is true because 4 is larger than 2. c) The inductive hypothesis states that P (k) holds for some integer k 2. d) We need to prove that k! < k k implies (k + 1)! < (k + 1) k+1. e) Given that k! < k k holds, easily seen inequalities imply (k + 1)! = k! (k + 1) < k k (k + 1) < (k + 1) k (k + 1) = (k + 1) k+1. f) We have carried out both the basis step and the inductive step. The principle of mathematical induction now ensures that P (n) is true for all integers n Prove that 3 divides n 3 + 2n whenever n is a positive integer. We use mathematical induction. For n = 1, the assertion says that 3 divides , which is indeed the case, so the basis step is fine. For the inductive step, we assume that 3 divides k 3 + 2k for some positive integer k. Hence there exists an integer l such that 3l = k 3 + 2k. A computation shows (k + 1) 3 + 2(k + 1) = (k 3 + 2k) + 3(k 2 + k + 1). The right hand is divisible by 3. This is evident for the second summand, and it is the induction hypothesis for the first summand. Hence we have proved that 3 divides (k + 1) 3 + 2(k + 1). This complete the inductive step, and hence the assertion follows Use mathematical induction to show that given a set of n + 1 positive integers, none exceeding 2n, there is at least one integer in this set that divides another integer in the set. Let P (n) be the following propositional function: given a set of n + 1 positive integers, none exceeding 2n, there is at least one integer in this set that divides another integer in the set. The proposition P (1) is true because there is only one set of positive integers none exceeding 2 1. This set is {1, 2} and it contains an integer, namely 1, that divides the other integer, namely 2. This verifies the basis step in our proof by mathematical induction. For the inductive step we assume that P (k) is true for some positive integer k. To prove P (k + 1), we consider a set S of k + 2 positive 3

4 integers none exceeding 2k + 2. If S {2k + 1, 2k + 2} has cardinality 0 or 1 then we apply the induction hypothesis to S\{2k + 1, 2k + 2} to conclude that this set contains a dividing pair of integers. Hence we are left with the case that 2k + 1 and 2k + 2 are both in S and S\{2k + 1, 2k + 2} consists of k positive integers of size at most 2k that pairwise don t divide each other. If k + 1 is in S then we are done because k + 1 divides 2k + 2. Suppose therefore that k + 1 S. Then we replace S by the set S = (S\{2k + 2}) {k + 1}. The new set S is covered by the previous case, so it contains a divisible pair. If that pair does not involve k + 1 then it is also in S. If it involves k + 1 then this means that some l S\{k + 1} divides l. That l must also divide 2k + 2 and hence S contains a divisible pair. This completes the inductive step and hence the proof Let P (n) be the statement that a postage of n cents can be formed using just 4-cent stamps and 7-cent stamps. Prove that P (n) is true for n 18, using the six suggested steps. We prove this using strong induction. The basis step is to check that P (18), P (19), P (20) and P (21) hold. This seen from the identities 18 = , 19 = , 20 = , 21 = For the inductive step, we assume that P (j) holds for all integers j with 18 j k where k 21. To realize k + 1 cents, we first realize k 3 cents using 4-cent stamps and 7-cent stamps. This is possible by the inductive hypothesis, since k Now add one more 4-cent stamp to realize k + 1 cents. This completes the induction step and it hence proves the assertion Assume that a chocolate bar consists of n squares arranged in a rectangular pattern. The entire bar, or a smaller rectangular piece of the bar, can be broken along a vertical or a horizontal line separating the squares. Assuming that only one piece can be broken at a time, determine how many breaks you must successively make to break the bar into n separate squares use strong induction to prove your answer. We claim that the number of needed breaks is n 1. We shall prove this for all positive integers n using strong induction. The basis step n = 1 is clear. In that case we don t need to break the chocolate at all, we can just eat it. Suppose now that n 2 and assume the assertion is true for all rectangular chocolate bars with fewer than n 4

5 squares. Then we break the chocolate into two pieces of size m and n m where 1 m < n. By the induction hypotheses, the bar with m pieces requires m 1 breaks and the bar with n m squares requires n m 1 breaks. Thus the original cholocate bar requires 1+(m 1) +(n m 1) breaks. This number equals n 1, as required Suppose that P (n) is a propositional function. Determine for which nonnegative integers n the statement P (n) must be true if a) P (0) is true; for all nonnegative integers n, if P (n) is true then P (n + 2) is true. b) P (0) is true; for all nonnegative integers n, if P (n) is true then P (n + 3) is true. c) P (0) and P (1) are true; for all non-negative integers n, if P (n) and P (n + 1) are true then P (n + 2) is true. d) P (0) is true; for all non-negative integers n, if P (n) is true then P (n + 2) and P (n + 3) are true. a) The statement P (n) is true for all nonnegative integers n that are even. b) The statement P (n) is true for all nonnegative integers n that are divisible by 3. c) The statement P (n) is true for all nonnegative integers n. d) The statement P (n) is true for all nonnegative integers n with n 1, since every such n is expressible as a sum of 2 s and 3 s Find f(2), f(3), f(4), and f(5) if f is defined recursively by f(0) = f(1) = 1 and for n = 1, 2,... a) f(n + 1) = f(n) f(n 1), b) f(n + 1) = f(n)f(n 1), c) f(n + 1) = f(n) 2 + f(n 1) 2, d) f(n + 1) = f(n)/f(n 1). a) 0, 1, 2, 3 b) 1, 1, 1, 1 c) 2, 5, 29, 866 d) 1, 1, 1, 1 5

6 5.3.6 Determine whether each of these proposed definitions is a valid recursive definition of a function f from the set of all nonnegative integers to the set of integers. If f is well defined, find a formula for f(n) when n is a nonnegative integer and prove that your formula is valid. a) f(0) = 1, f(n) = f(n 1) for n 1, b) f(0) = 1, f(1) = 0, f(2) = 2, f(n) = 2f(n 3) for n 3, c) f(0) = 0, f(1) = 1, f(n) = 2f(n + 1) for n 2, d) f(0) = 0, f(1) = 1, f(n) = 2f(n 1) for n 1, e) f(0) = 2, f(n) = f(n 1) if n is odd and n 1 and f(n) = 2f(n 2) if n 2. a) The function is well-defined and given by f(n) = ( 1) n. b) The function is well-defined and given by f(n) = 0 if n 1 (mod3) and f(n) = 2 (n 1)/2 otherwise. c) The function is not well-defined because the definition of f(n) involves the value at n + 1. d) The function is well-defined and given by f(n) = 2 (n+3)/ Give a recursive definition of the sequence [a n ], n = 1, 2, 3,... if a) a n = 6n, b) a n = 2n + 1, c) a n = 10 n, d) a n = 5. a) a 1 = 6 and a n = a n for n 2. b) a 1 = 3 and a n = a n for n 2. c) a 1 = 1 and a n = 10a n 1 for n 2. d) a 1 = 5 and a n = a n 1 for n Let f n denote the nth Fibonacci number. Prove that f 2 1 +f f 2 n = f n f n+1 when n is a positive integer. We prove this by induction on n. The statement is true for n = 1 because 1 2 = 1 1, it is true for n = 2 because = 1 2, and it is true for n = 3 because = 2 3. This takes care of the 6

7 basis step. For the inductive step, suppose it is true for n = k, and consider the left hand for n = k + 1. We find f f f 2 k + f 2 k+1 = f kf k+1 + f 2 k+1 = f k+1(f k + f k+1 ). The last expression equals f k+1 f k+2 by the recursive definition of the Fibonacci sequences. The verifies the equation for n = k + 1. We have thus completed both the basis step and the inductive step, and hence the claim follows by the principle of mathematical induction ** Give a recursive definition of the functions max and min, so that that max(a 1, a 2,..., a n ) and min(a 1, a 2,..., a n ) are the maximum and the minimum of the n numbers a 1, a 2,..., a n respectively. a 1 if n = 1 (base case) a n if n > 1 and max(a 1,..., a n ) = a n > max(a 1,..., a n 1 ) max(a 1,..., a n 1 ) otherwise min(a 1,..., a n ) = a 1 if n = 1 (base case) if n > 1 and a n min(a 1,..., a n 1 ) Find these values of Ackermann s function a) A(2, 3) b) A(3, 3) a n < min(a 1,..., a n 1 ) otherwise The Ackermann function is defined recursively by A(m, n) = 2n if m = 0; A(m, n) = 0 if m 1 and n = 0; A(m, n) = 2 if m 1 and n = 1; A(m, n) = A(m 1, A(m, n 1)) if m 1 and n 2. We have A(2, 2) = A(1, A(2, 1)) = A(1, 2) = A(0, A(1, 1)) = A(0, 2) = 4. Also, we have A(1, 1) = 2, A(1, 2) = A(0, A(1, 1)) = A(0, 2) = 4, A(1, 3) = A(0, A(1, 2)) = A(0, 4) = 8, and A(1, 4) = A(0, A(1, 3)) = A(0, 8) = 16. More generally, A(1, n) = 2 n. This is Exercise 50. 7

8 a) A(2, 3) = A(1, A(2, 2)) = A(1, 4) = 16. b) A(3, 3) = A(2, A(3, 2)) = A(2, A(1, A(3, 1))) = A(2, A(1, 2)) = A(2, 4) = A(1, A(2, 3)) = A(1, 16) = 2 16 =

### TAKE-AWAY GAMES. ALLEN J. SCHWENK California Institute of Technology, Pasadena, California INTRODUCTION

TAKE-AWAY GAMES ALLEN J. SCHWENK California Institute of Technology, Pasadena, California L INTRODUCTION Several games of Tf take-away?f have become popular. The purpose of this paper is to determine the

### Collatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1.

Fibonacci Roulette In this game you will be constructing a recurrence relation, that is, a sequence of numbers where you find the next number by looking at the previous numbers in the sequence. Your job

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

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

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu

Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

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

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

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

### Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

### About the inverse football pool problem for 9 games 1

Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

### SOLUTIONS FOR PROBLEM SET 2

SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### If n is odd, then 3n + 7 is even.

Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that

### Taylor and Maclaurin Series

Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions

### Math 231b Lecture 35. G. Quick

Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

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

### Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

### Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)

Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common

### Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100

Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### Many algorithms, particularly divide and conquer algorithms, have time complexities which are naturally

Recurrence Relations Many algorithms, particularly divide and conquer algorithms, have time complexities which are naturally modeled by recurrence relations. A recurrence relation is an equation which

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### On three zero-sum Ramsey-type problems

On three zero-sum Ramsey-type problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 7, due Wedneday, March 14 Happy Pi Day! (If any errors are spotted, please email them to morrison at math dot berkeley dot edu..5.10 A croissant

### Jacobi s four squares identity Martin Klazar

Jacobi s four squares identity Martin Klazar (lecture on the 7-th PhD conference) Ostrava, September 10, 013 C. Jacobi [] in 189 proved that for any integer n 1, r (n) = #{(x 1, x, x 3, x ) Z ( i=1 x i

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

### 3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

### Entry Level College Mathematics: Algebra or Modeling

Entry Level College Mathematics: Algebra or Modeling Dan Kalman Dan Kalman is Associate Professor in Mathematics and Statistics at American University. His interests include matrix theory, curriculum development,

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Month Rabbits # Pairs

1. Fibonacci s Rabbit Problem. Fibonacci rabbits come in pairs. Once a pair is two months old, it bears another pair and from then on bears one pair every month. Starting with a newborn pair at the beginning

### PROOFS BY DESCENT KEITH CONRAD

PROOFS BY DESCENT KEITH CONRAD As ordinary methods, such as are found in the books, are inadequate to proving such difficult propositions, I discovered at last a most singular method... that I called the

### A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE

A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE DANIEL A. RAMRAS In these notes we present a construction of the universal cover of a path connected, locally path connected, and semi-locally simply

### A Hajós type result on factoring finite abelian groups by subsets II

Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is

### If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### ELEMENTARY PROBLEMS AND SOLUTIONS

Edited by A. P. HILLMAN Assistant Editors GLORIA C. PADILLA CHARLES R. WALL Send all communications regarding ELEMENTARY PROBLEMS SOLUTIONS to PROFESSOR A. P. HILLMAN; 709 Solano Dr., S.E.,; Albuquerque,

### 13. Write the decimal approximation of 9,000,001 9,000,000, rounded to three significant

æ If 3 + 4 = x, then x = 2 gold bar is a rectangular solid measuring 2 3 4 It is melted down, and three equal cubes are constructed from this gold What is the length of a side of each cube? 3 What is the

### The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line

The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,

### BX in ( u, v) basis in two ways. On the one hand, AN = u+

1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x

### To define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions

Chapter 7 Functions This unit defines and investigates functions as algebraic objects. First, we define functions and discuss various means of representing them. Then we introduce operations on functions

### NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1

NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1 R. Thangadurai Stat-Math Division, Indian Statistical Institute, 203, B. T. Road, Kolkata 700035, INDIA thanga v@isical.ac.in Received: 11/28/01,

### 9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

### Putnam Notes Polynomials and palindromes

Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning

### FACTORING PEAK POLYNOMIALS

FACTORING PEAK POLYNOMIALS SARA BILLEY, MATTHEW FAHRBACH, AND ALAN TALMAGE Abstract. Let S n be the symmetric group of permutations π = π 1 π 2 π n of {1, 2,..., n}. An index i of π is a peak if π i 1

### On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### Is Sometime Ever Better Than Alway?

Is Sometime Ever Better Than Alway? DAVID GRIES Cornell University The "intermittent assertion" method for proving programs correct is explained and compared with the conventional method. Simple conventional

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

### ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give

### 15-251: Great Theoretical Ideas in Computer Science Anupam Gupta Notes on Combinatorial Games (draft!!) January 29, 2012

15-251: Great Theoretical Ideas in Computer Science Anupam Gupta Notes on Combinatorial Games (draft!!) January 29, 2012 1 A Take-Away Game Consider the following game: there are 21 chips on the table.

### Examples of Tasks from CCSS Edition Course 3, Unit 5

Examples of Tasks from CCSS Edition Course 3, Unit 5 Getting Started The tasks below are selected with the intent of presenting key ideas and skills. Not every answer is complete, so that teachers can

### You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

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

### Discrete Convolution and the Discrete Fourier Transform

Discrete Convolution and the Discrete Fourier Transform Discrete Convolution First of all we need to introduce what we might call the wraparound convention Because the complex numbers w j e i πj N have

### Polynomials. Dr. philippe B. laval Kennesaw State University. April 3, 2005

Polynomials Dr. philippe B. laval Kennesaw State University April 3, 2005 Abstract Handout on polynomials. The following topics are covered: Polynomial Functions End behavior Extrema Polynomial Division

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### This chapter is all about cardinality of sets. At first this looks like a

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

### Degrees that are not degrees of categoricity

Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara

### ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER

Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group

### Lecture Notes on Polynomials

Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex

### TEST A CHAPTER 6, EQUATIONS, INEQUALITIES, PROBLEM SOLVING. 1. Factor x 2-5x + 6. 2. Factor x 2-4x - 5.

TEST A CHAPTER 6, EQUATIONS, INEQUALITIES, PROBLEM SOLVING. Factor x 2-5x + 6. 2. Factor x 2-4x - 5. 3. Solve: (x + 2)(x - 3) = 0 x(x - 3)(x + 4) = 0 4. Solve by factoring: x 2 + x + 2 = 0. 5. Solve by

### 5. Factoring by the QF method

5. Factoring by the QF method 5.0 Preliminaries 5.1 The QF view of factorability 5.2 Illustration of the QF view of factorability 5.3 The QF approach to factorization 5.4 Alternative factorization by the

### Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

### VISUAL ALGEBRA FOR COLLEGE STUDENTS. Laurie J. Burton Western Oregon University

VISUAL ALGEBRA FOR COLLEGE STUDENTS Laurie J. Burton Western Oregon University VISUAL ALGEBRA FOR COLLEGE STUDENTS TABLE OF CONTENTS Welcome and Introduction 1 Chapter 1: INTEGERS AND INTEGER OPERATIONS

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

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

### Universal hashing. In other words, the probability of a collision for two different keys x and y given a hash function randomly chosen from H is 1/m.

Universal hashing No matter how we choose our hash function, it is always possible to devise a set of keys that will hash to the same slot, making the hash scheme perform poorly. To circumvent this, we

### Course Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics

Course Notes for Math 16: Mathematical Statistics Approximation Methods in Statistics Adam Merberg and Steven J. Miller August 18, 6 Abstract We introduce some of the approximation methods commonly used

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### Chapter 21: The Discounted Utility Model

Chapter 21: The Discounted Utility Model 21.1: Introduction This is an important chapter in that it introduces, and explores the implications of, an empirically relevant utility function representing intertemporal

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS

International Electronic Journal of Algebra Volume 6 (2009) 95-106 FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS Sándor Szabó Received: 11 November 2008; Revised: 13 March 2009

### The Ideal Class Group

Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression

On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression Carrie E. Finch and N. Saradha Abstract We prove the irreducibility of ceratin polynomials

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### Some strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative variables

Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 6 (013), 74 85 Research Article Some strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative

### Exam Introduction Mathematical Finance and Insurance

Exam Introduction Mathematical Finance and Insurance Date: January 8, 2013. Duration: 3 hours. This is a closed-book exam. The exam does not use scrap cards. Simple calculators are allowed. The questions

### Surface bundles over S 1, the Thurston norm, and the Whitehead link

Surface bundles over S 1, the Thurston norm, and the Whitehead link Michael Landry August 16, 2014 The Thurston norm is a powerful tool for studying the ways a 3-manifold can fiber over the circle. In

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Number Theory for Mathematical Contests. David A. SANTOS dsantos@ccp.edu

Number Theory for Mathematical Contests David A. SANTOS dsantos@ccp.edu August 13, 2005 REVISION Contents Preface 1 Preliminaries 1 1.1 Introduction.................. 1 1.2 Well-Ordering.................

### Sums of Independent Random Variables

Chapter 7 Sums of Independent Random Variables 7.1 Sums of Discrete Random Variables In this chapter we turn to the important question of determining the distribution of a sum of independent random variables

### SOLVING QUADRATIC EQUATIONS BY THE NEW TRANSFORMING METHOD (By Nghi H Nguyen Updated Oct 28, 2014))

SOLVING QUADRATIC EQUATIONS BY THE NEW TRANSFORMING METHOD (By Nghi H Nguyen Updated Oct 28, 2014)) There are so far 8 most common methods to solve quadratic equations in standard form ax² + bx + c = 0.