Homework #1. Denote the sum we are interested in as To find we subtract the sum to find that
|
|
- William Higgins
- 6 years ago
- Views:
Transcription
1 Homework #1 CMSC351 - Spring 2013 PRINT Name : Due: Feb 12 th at the start of class o Grades depend on neatness and clarity. o Write your answers with enough detail about your approach and concepts used, so that the grader will be able to understand it easily. You should ALWAYS prove the correctness of your algorithms either directly or by referring to a proof in the book. o Write your answers in the spaces provided. If needed, attach other pages. o The grades would be out of 20. Four problems would be selected and everyone s grade would be based only on those problems. You will also get 5 bonus points for trying to solve all problems. 1. [Prob 2.3, Pg 31] Find the following sum and prove your claim: Denote the sum we are interested in as To find we subtract the sum to find that In class we saw that, so that We now prove that by induction. For this is trivial. Assume that, we now show that. We have that
2 2. Let denote the number with ones. For example, and and so on. For each prove that is divisible by. The base case k=1 is true since = 111 = 3x37. The induction hypothesis is that is divisible by. Observe that to write down you have to write down three times. Hence where the digits of the number in the bracket are one, followed by k-1 zeros, then a one, again k-1 zeros and the last digit is one. For example. By induction hypothesis is divisible by The sum of digits of the number in the bracket is three, and hence it is divisible by 3 which implies is divisible by Note that sum of digits of is exactly. Hence it follows that there are infinitely many natural numbers (none of which contain zero as a digit) which are divisible by the sum of their digits. This fact is not so easy to prove otherwise!!
3 3. [Prob 2.11, Pg 32] Find an expression for the sum of the ith row of the following triangle, and prove the correctness of your claim. Each entry in the triangle is the sum of the three entries directly above it (a nonexisting entry is considered 0) The sums of each of the first few rows are 1,3,9,27 which suggests that the sum of the nth row is. We prove this by induction. For n=1 this is trivial. Assume the sum of the nth row is, we now show that the sum of the (n +1)-th row is. Let denote the ith entry in the (n+1)-th row and note that, by definition, We need to show that Each entry from the n-th row appears three times in this expression, so by the inductive hypothesis which proves the result.
4 4. [Prob 2.19, Pg 32] Prove that the regions formed by n circles (see figure below) can be colored with two colors such that any neighboring regions are colored differently. We prove this by induction on the number of circles. The base case of n=1 can be trivially colored by two colors: one for the region insider the circle and one for the big outer region. Now suppose we have n+1 circles. Draw only the first n circles. By induction hypothesis we can color the regions formed by these n circles. Now draw the n+1 th circle, which we denote by say C. For any region inside C flip its color. For any region outside C keep its color same. The claim is that this is a valid coloring. We have the following 3 cases for two neighboring regions: Both are inside C : In this case they had different colors before, and we flipped both their colors. So they have different colors even now. Both are outside C : In this case they had different colors before, and we do not change color of either region. So they have different colors even now. One is outside C and other is inside C : In this case these two regions were part of the same region before we added C, and hence had the same color in that coloring. But now we flipped color of only the region which is inside C, and hence they have different colors now.
5 5. Are the following pairs of functions in terms of order of magnitude. In each case, briefly explain whether,, and/or. a) Using a similar approach to part (c) below you can show that and, and thus. b) Since, we have ( ). c) We show which implies that ( ) Let, so. Now, By Theorem 3.1 (Theorem 1, Lecture 4 notes), ( ) which proves the result. d) We have. By increasing we can make this ratio arbitrary big, thus.
6 6. [Prob 3.16, Pg 57] Find a counterexample to the following claim: and imply Since we don t need upper bounds to be tight, finding counterexamples in this case is easy. For example
7 7. [Prob 3.3, Pg 56] Prove, by using Theorem 3.1, that 5 = Note that it is enough to show that, c = 5 and a = 5 = This follows easily from Theorem 3.1 with
Discrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More information1.1 Inductive Reasoning filled in.notebook August 20, 2015
1.1 Inductive Reasoning 1 Vocabulary Natural or Counting Numbers Ellipsis Scientific Method Hypothesis or Conjecture Counterexample 2 Vocabulary Natural or Counting Numbers 1, 2, 3, 4, 5... positive whole
More informationLecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8
Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness
More informationCS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions PRINT Your Name: Answer: Oski Bear SIGN Your Name: PRINT Your Student ID: CIRCLE your exam room: Dwinelle
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationFinite Math - J-term Section Systems of Linear Equations in Two Variables Example 1. Solve the system
Finite Math - J-term 07 Lecture Notes - //07 Homework Section 4. - 9, 0, 5, 6, 9, 0,, 4, 6, 0, 50, 5, 54, 55, 56, 6, 65 Section 4. - Systems of Linear Equations in Two Variables Example. Solve the system
More informationPRIMES Math Problem Set
PRIMES Math Problem Set PRIMES 017 Due December 1, 01 Dear PRIMES applicant: This is the PRIMES 017 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 01.
More information2 Elementary number theory
2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},
More informationLinear Algebra Exam 1 Spring 2007
Linear Algebra Exam 1 Spring 2007 March 15, 2007 Name: SOLUTION KEY (Total 55 points, plus 5 more for Pledged Assignment.) Honor Code Statement: Directions: Complete all problems. Justify all answers/solutions.
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationMATH 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 informationCS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works
CS68: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant April 20, 206 Introduction Last lecture introduced the idea of principal components analysis (PCA). The
More informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
More informationMath 308 Midterm, Feb 11th 2015 Winter Form Bonus. Possible (6) 63
Math 38 Midterm, Feb th 5 Winter 5 Your Name Your Signature Student ID # Points.. 3. 4. 5. Form Bonus Possible 6 6 6 3 (6) 63 No books are allowed. You may use a calculator. Place a box around your final
More informationMath 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More informationThe Advantage Testing Foundation Olympiad Solutions
The Advantage Testing Foundation 015 Olympiad Problem 1 Prove that every positive integer has a unique representation in the form d i i, where k is a nonnegative integer and each d i is either 1 or. (This
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.
Formal Methods Name: Key Midterm 2, Spring, 2007 Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.. Determine whether each of
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Describe computer representation of sets with bitstrings Define and compute the cardinality of finite
More informationMTH 35, SPRING 2017 NIKOS APOSTOLAKIS
MTH 35, SPRING 2017 NIKOS APOSTOLAKIS 1. Linear independence Example 1. Recall the set S = {a i : i = 1,...,5} R 4 of the last two lectures, where a 1 = (1,1,3,1) a 2 = (2,1,2, 1) a 3 = (7,3,5, 5) a 4
More informationAll numbered readings are from Beck and Geoghegan s The art of proof.
MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2
More informationLecture 2 Systems of Linear Equations and Matrices, Continued
Lecture 2 Systems of Linear Equations and Matrices, Continued Math 19620 Outline of Lecture Algorithm for putting a matrix in row reduced echelon form - i.e. Gauss-Jordan Elimination Number of Solutions
More informationCSC 373: Algorithm Design and Analysis Lecture 30
CSC 373: Algorithm Design and Analysis Lecture 30 Allan Borodin April 5, 2013 1 / 12 Announcements and Outline Announcements Two misstated questions on term test Grading scheme for term test 3: 1 Test
More informationMA 3280 Lecture 05 - Generalized Echelon Form and Free Variables. Friday, January 31, 2014.
MA 3280 Lecture 05 - Generalized Echelon Form and Free Variables Friday, January 31, 2014. Objectives: Generalize echelon form, and introduce free variables. Material from Section 3.5 starting on page
More informationMath 31 Lesson Plan. Day 5: Intro to Groups. Elizabeth Gillaspy. September 28, 2011
Math 31 Lesson Plan Day 5: Intro to Groups Elizabeth Gillaspy September 28, 2011 Supplies needed: Sign in sheet Goals for students: Students will: Improve the clarity of their proof-writing. Gain confidence
More informationQuiz 1. Adrian Georgi Josh Karen Lee Min Nikos Tina. There are five (5) problems totaling 100 points. Total time is 110 minutes.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Quiz 1 Your name: Circle the name of your Tutorial Instructor:
More informationMath 230 Final Exam, Spring 2009
IIT Dept. Applied Mathematics, May 13, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2009 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part
More informationCSC 2414 Lattices in Computer Science September 27, Lecture 4. An Efficient Algorithm for Integer Programming in constant dimensions
CSC 2414 Lattices in Computer Science September 27, 2011 Lecture 4 Lecturer: Vinod Vaikuntanathan Scribe: Wesley George Topics covered this lecture: SV P CV P Approximating CVP: Babai s Nearest Plane Algorithm
More informationMATH 341 MIDTERM 2. (a) [5 pts] Demonstrate that A and B are row equivalent by providing a sequence of row operations leading from A to B.
11/01/2011 Bormashenko MATH 341 MIDTERM 2 Show your work for all the problems. Good luck! (1) Let A and B be defined as follows: 1 1 2 A =, B = 1 2 3 0 2 ] 2 1 3 4 Name: (a) 5 pts] Demonstrate that A and
More informationConjectures and proof. Book page 24-30
Conjectures and proof Book page 24-30 What is a conjecture? A conjecture is used to describe a pattern in mathematical terms When a conjecture has been proved, it becomes a theorem There are many types
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationAssignment 3 Logic and Reasoning KEY
Assignment 3 Logic and Reasoning KEY Print this sheet and fill in your answers. Please staple the sheets together. Turn in at the beginning of class on Friday, September 8. Recall this about logic: Suppose
More informationSection 2.5 Formulas and Additional Applications from Geometry Section 2.6 Solving Linear Inequalities Section 7.
Section 2.5 Formulas and Additional Applications from Geometry Section 2.6 Solving Linear Inequalities Section 7.1 Evaluating Roots Section 2.5 Formulas and Additional Applications from Geometry Definition
More informationMathematical Induction. EECS 203: Discrete Mathematics Lecture 11 Spring
Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring 2016 1 Climbing the Ladder We want to show that n 1 P(n) is true. Think of the positive integers as a ladder. 1, 2, 3, 4, 5, 6,...
More informationSimilar Shapes and Gnomons
Similar Shapes and Gnomons May 12, 2013 1. Similar Shapes For now, we will say two shapes are similar if one shape is a magnified version of another. 1. In the picture below, the square on the left is
More informationThe Pigeonhole Principle
The Pigeonhole Principle 2 2.1 The Pigeonhole Principle The pigeonhole principle is one of the most used tools in combinatorics, and one of the simplest ones. It is applied frequently in graph theory,
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 8 Solutions
Basic Combinatorics Math 4010, Section 01 Fall 01 Homework 8 Solutions 1.8.1 1: K n has ( n edges, each one of which can be given one of two colors; so Kn has (n -edge-colorings. 1.8.1 3: Let χ : E(K k
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More information19. Basis and Dimension
9. Basis and Dimension In the last Section we established the notion of a linearly independent set of vectors in a vector space V and of a set of vectors that span V. We saw that any set of vectors that
More informationNo books, notes, any calculator, or electronic devices are allowed on this exam. Show all of your steps in each answer to receive a full credit.
MTH 309-001 Fall 2016 Exam 1 10/05/16 Name (Print): PID: READ CAREFULLY THE FOLLOWING INSTRUCTION Do not open your exam until told to do so. This exam contains 7 pages (including this cover page) and 7
More informationFranklin Math Bowl 2007 Group Problem Solving Test 6 th Grade
Group Problem Solving Test 6 th Grade 1. Consecutive integers are integers that increase by one. For eample, 6, 7, and 8 are consecutive integers. If the sum of 9 consecutive integers is 9, what is the
More informationDay 6. Tuesday May 29, We continue our look at basic proofs. We will do a few examples of different methods of proving.
Day 6 Tuesday May 9, 01 1 Basic Proofs We continue our look at basic proofs. We will do a few examples of different methods of proving. 1.1 Proof Techniques Recall that so far in class we have made two
More informationChapter 2. Solving Linear Equation
Chapter 2 Solving Linear Equation 2.1 Square Roots and Comparing Real Numbers I can find square roots and compare real numbers. CC.9-12.N.Q.1 Square Root of a Number: Words: If b 2 = a, then b is a square
More information(2) Generalize De Morgan s laws for n sets and prove the laws by induction. 1
ARS DIGITA UNIVERSITY MONTH 2: DISCRETE MATHEMATICS PROFESSOR SHAI SIMONSON PROBLEM SET 2 SOLUTIONS SET, FUNCTIONS, BIG-O, RATES OF GROWTH (1) Prove by formal logic: (a) The complement of the union of
More informationPrompt. Commentary. Mathematical Foci
Situation 51: Proof by Mathematical Induction Prepared at the University of Georgia Center for Proficiency in Teaching Mathematics 9/15/06-Erik Tillema 2/22/07-Jeremy Kilpatrick Prompt A teacher of a calculus
More informationProblem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
More information1. Determine by inspection which of the following sets of vectors is linearly independent. 3 3.
1. Determine by inspection which of the following sets of vectors is linearly independent. (a) (d) 1, 3 4, 1 { [ [,, 1 1] 3]} (b) 1, 4 5, (c) 3 6 (e) 1, 3, 4 4 3 1 4 Solution. The answer is (a): v 1 is
More informationMATH 113 FINAL EXAM December 14, 2012
p.1 MATH 113 FINAL EXAM December 14, 2012 This exam has 9 problems on 18 pages, including this cover sheet. The only thing you may have out during the exam is one or more writing utensils. You have 180
More informationMATH 430 PART 2: GROUPS AND SUBGROUPS
MATH 430 PART 2: GROUPS AND SUBGROUPS Last class, we encountered the structure D 3 where the set was motions which preserve an equilateral triangle and the operation was function composition. We determined
More informationHOMEWORK 9 solutions
Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 9 solutions Due 4pm Wednesday, November 13. You will be graded not only on the correctness of your answers but
More informationMatrices. A matrix is a method of writing a set of numbers using rows and columns. Cells in a matrix can be referenced in the form.
Matrices A matrix is a method of writing a set of numbers using rows and columns. 1 2 3 4 3 2 1 5 7 2 5 4 2 0 5 10 12 8 4 9 25 30 1 1 Reading Information from a Matrix Cells in a matrix can be referenced
More informationMath 4: Advanced Algebra Ms. Sheppard-Brick A Quiz Review Learning Targets
5A Quiz Review Learning Targets 4.4 5.5 Key Facts Graphing one-variable inequalities (ex. x < 4 ) o Perform algebra steps to get x alone! If you multiply or divide by a negative number, you must flip the
More informationMath 115 Spring 11 Written Homework 10 Solutions
Math 5 Spring Written Homework 0 Solutions. For following its, state what indeterminate form the its are in and evaluate the its. (a) 3x 4x 4 x x 8 Solution: This is in indeterminate form 0. Algebraically,
More information18.06 Problem Set 1 - Solutions Due Wednesday, 12 September 2007 at 4 pm in
18.6 Problem Set 1 - Solutions Due Wednesday, 12 September 27 at 4 pm in 2-16. Problem : from the book.(5=1+1+1+1+1) (a) problem set 1.2, problem 8. (a) F. A Counterexample: u = (1,, ), v = (, 1, ) and
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationLecture 10: Lovász Local Lemma. Lovász Local Lemma
Lecture 10: Introduction Let A 1,..., A n be indicator variables for bad events in an experiment Suppose P [A i ] p We want to avoid all the bad events If P [ A 1 A n ] > 0, then there exists a way to
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationPhysics Grading Sheet.
Physics - Grading Sheet. Dept. of Physics and Astronomy. TAMU. Marking Instructions Fill oval completely Erase cleanly Students Fill Only this information. First Name: Last Name:. Section:. Clearly hand-write
More informationMAC-CPTM Situations Project
Prompt MAC-CPTM Situations Project Situation 51: Proof by Mathematical Induction Prepared at the University of Georgia Center for Proficiency in Teaching Mathematics 13 October 2006-Erik Tillema 22 February
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationCS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A
CS1800 Discrete Structures Spring 2018 February 2018 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More informationAstro 115: Introduction to Astronomy. About Me. On your survey paper, take 3 minutes to answer the following:
1/25/17 Astro 115: Introduction to Astronomy About Me My office is in Science 356 Best way to contact me is email jfielder@sfsu.edu put Astro 115-03 (for TTh) or Astro 115-05 (for MWF) in the subject line
More informationk 2r n k n n k) k 2r+1 k 2r (1.1)
J. Number Theory 130(010, no. 1, 701 706. ON -ADIC ORDERS OF SOME BINOMIAL SUMS Hao Pan and Zhi-Wei Sun Abstract. We prove that for any nonnegative integers n and r the binomial sum ( n k r is divisible
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2013 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More informationCMSC Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade. 1. (6 points) Let a
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
More informationCIT 596 Theory of Computation Spring 2005, 212 Moore, TR PM. Homework Assignment 2
CIT 596 Theory of Computation Spring 2005, 212 Moore, TR 12-1.30PM Homework Assignment 2 Due: Tuesday, February 1, 2005, by 12 PM (IN CLASS) Name: Student ID (8 digits): Email: Signature: PLEASE, READ
More informationPUTNAM 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 informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More informationMATH10040: 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 information2. (10 pts) How many vectors are in the null space of the matrix A = 0 1 1? (i). Zero. (iv). Three. (ii). One. (v).
Exam 3 MAS 3105 Applied Linear Algebra, Spring 2018 (Clearly!) Print Name: Apr 10, 2018 Read all of what follows carefully before starting! 1. This test has 7 problems and is worth 110 points. Please be
More informationHonors Advanced Mathematics Determinants page 1
Determinants page 1 Determinants For every square matrix A, there is a number called the determinant of the matrix, denoted as det(a) or A. Sometimes the bars are written just around the numbers of the
More informationMath 110, Spring 2015: Midterm Solutions
Math 11, Spring 215: Midterm Solutions These are not intended as model answers ; in many cases far more explanation is provided than would be necessary to receive full credit. The goal here is to make
More informationClass Notes: Solving Simultaneous Linear Equations by Gaussian Elimination. Consider a set of simultaneous linear equations:
METR/OCN 465: Computer Programming with Applications in Meteorology and Oceanography Dr Dave Dempsey Dept of Geosciences, SFSU Class Notes: Solving Simultaneous Linear Equations by Gaussian Elimination
More informationMath 31 Lesson Plan. Day 16: Review; Start Section 8. Elizabeth Gillaspy. October 18, Supplies needed: homework. Colored chalk. Quizzes!
Math 31 Lesson Plan Day 16: Review; Start Section 8 Elizabeth Gillaspy October 18, 2011 Supplies needed: homework Colored chalk Quizzes! Goals for students: Students will: improve their understanding of
More informationIntroduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 03 Simplex Algorithm Lecture 15 Infeasibility In this class, we
More informationComputer Science Foundation Exam
Computer Science Foundation Exam May 6, 2016 Section II A DISCRETE STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. SOLUTION Question Max Pts Category Passing
More informationSECTION 2.3: LONG AND SYNTHETIC POLYNOMIAL DIVISION
2.25 SECTION 2.3: LONG AND SYNTHETIC POLYNOMIAL DIVISION PART A: LONG DIVISION Ancient Example with Integers 2 4 9 8 1 In general: dividend, f divisor, d We can say: 9 4 = 2 + 1 4 By multiplying both sides
More information, p 1 < p 2 < < p l primes.
Solutions Math 347 Homework 1 9/6/17 Exercise 1. When we take a composite number n and factor it into primes, that means we write it as a product of prime numbers, usually in increasing order, using exponents
More informationSection 7.5: Cardinality
Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many
More informationHomework # 3. Due Monday, October 22, 2018, at 2:00 PM PDT
CS/CNS/EE 156a Learning Systems Caltech - Fall 018 http://cs156.caltech.edu (Learning From Data campus version Homework # 3 Due Monday, October, 018, at :00 PM PDT Definitions and notation follow the lectures.
More informationFINAL (CHAPTERS 7-9) MATH 141 SPRING 2018 KUNIYUKI 250 POINTS TOTAL
Math 141 Name: FINAL (CHAPTERS 7-9) MATH 141 SPRING 2018 KUNIYUKI 250 POINTS TOTAL Show all work, simplify as appropriate, and use good form and procedure (as in class). Box in your final answers! No notes
More informationNotes on arithmetic. 1. Representation in base B
Notes on arithmetic The Babylonians that is to say, the people that inhabited what is now southern Iraq for reasons not entirely clear to us, ued base 60 in scientific calculation. This offers us an excuse
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 09 Tuesday, February 13 PROOFS and COUNTING Figure 1: Too Many Pigeons Theorem 9.1 (The Pigeonhole Principle (PHP)) If k + 1 or more pigeons fly to
More informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Asymptotic Analysis, recurrences Date: 9/7/17
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Asymptotic Analysis, recurrences Date: 9/7/17 2.1 Notes Homework 1 will be released today, and is due a week from today by the beginning
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationHOMEWORK 7 solutions
Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 7 solutions Due 4pm Wednesday, October 16. You will be graded not only on the correctness of your answers but
More informationSITE REPORT #4 COVER IMAGE: The Picture below is a Black & White map of Farragut Houses and its neighbors found during our NYPL visit.
Learning Places Spring 2017 SITE REPORT #4 COVER IMAGE: The Picture below is a Black & White map of Farragut Houses and its neighbors found during our NYPL visit. Thein Moe 03.30.2017 INTRODUCTION Our
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationa) Let x,y be Cauchy sequences in some metric space. Define d(x, y) = lim n d (x n, y n ). Show that this function is well-defined.
Problem 3) Remark: for this problem, if I write the notation lim x n, it should always be assumed that I mean lim n x n, and similarly if I write the notation lim x nk it should always be assumed that
More information3 Fields, Elementary Matrices and Calculating Inverses
3 Fields, Elementary Matrices and Calculating Inverses 3. Fields So far we have worked with matrices whose entries are real numbers (and systems of equations whose coefficients and solutions are real numbers).
More information( x 12) 1 ( x 12) ( x 12) ( x 12) step 2: For what interval will the series converge? The series will converge iff r 1, so...
Math 253 Lab #7 Power Series, an Intro. Names: Work in groups of 2-4 for full credit and 5% bonus if turned in by Wed. of week 0. Make sure everyone in your group understands the question and its answer.
More information6.042/18.062J Mathematics for Computer Science March 9, 2005 Srini Devadas and Eric Lehman. Quiz 1. Ishan Christos Grant
6.042/18.062J Mathematics for Computer Science March 9, 2005 Srini Devadas and Eric Lehman Quiz 1 YOUR NAME: Circle the name of your recitation instructor: Ishan Christos Grant You may use one 8.5 11 sheet
More informationMathematical induction
Mathematical induction Notes and Examples These notes contain subsections on Proof Proof by induction Types of proof by induction Proof You have probably already met the idea of proof in your study of
More informationSpring 2015 Midterm 1 03/04/15 Lecturer: Jesse Gell-Redman
Math 0 Spring 05 Midterm 03/04/5 Lecturer: Jesse Gell-Redman Time Limit: 50 minutes Name (Print): Teaching Assistant This exam contains pages (including this cover page) and 5 problems. Check to see if
More informationLinear Algebra. Introduction. Marek Petrik 3/23/2017. Many slides adapted from Linear Algebra Lectures by Martin Scharlemann
Linear Algebra Introduction Marek Petrik 3/23/2017 Many slides adapted from Linear Algebra Lectures by Martin Scharlemann Midterm Results Highest score on the non-r part: 67 / 77 Score scaling: Additive
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 3
CS 70 Discrete Mathematics and Probability Theory Spring 06 ao and Walrand Note 3 Mathematical Induction Introduction. In this note, we introduce the proof technique of mathematical induction. Induction
More information