and problem sheet 2
|
|
- Hugo Morton
- 5 years ago
- Views:
Transcription
1 -8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems, not to be turned n, for those seekng more practce and also for revew pror to the exam. Problem Usng nducton and wthout usng the formulae for and prove that n nn + n + + = for all n N =0 Soluton. We proceed by nducton on n. Let Pn= n nn+n+ =0 + =. Base case. When n = 0, the left-hand sde s 0 = 0 and the rght hand sde s = 0. These are equal, so P0 s true. 0 = 0 Inducton step. Fx n N and suppose that Pn s true. That s to say, n nn + n + + =. We need to prove that Well, n+ + = = = n+ + = = n + + n + n + = n + n + n +. by defnton of summaton nn + n + = + n + n + by the nducton hypothess nn + n + + n + n + = n + n + n + = by dstrbutvty Hence we have proved what we wanted to prove.
2 The clam follows for all natural numbers, by nducton. Problem Prove that for all n N +. n = + = n n + Soluton. We proceed by nducton on n. Let Pn= n = + = n n+. Base case. When n =, the left-hand sde s 4 = 4, and the rght-hand sde s 4. These are equal, so P s true. Inducton step. Fx n N + and suppose that Pn s true. That s to say, We need to prove that Well, n+ = n+ = n = n + = = + = n n +. + = n + n n + n + 4 = n n + + n + n + 4 nn = n + n + 4 = n + 4n + n + n + 4 n + n + = n + n + 4 = n + n + 4 Snce n + 4 = n + +, Pn+ s true. The clam follows for all postve ntegers, by nducton. by defnton of summaton by the nducton hypothess by combnng fractons by dstrbutvty by factorzaton by cancellaton
3 Problem For ntegers n fnd and prove a formula for n. = How to approach ths problem Ths part s meant to help you thnk about how to fnd the formula. In partcular, ths part should only appear on scratch paper but not on your answer sheet. Usually, when you have a sum or product of lots of thngs, the natural way to fnd the closed-form formula s to try some small n s to see how ths thng behaves. Therefore, When n = 4, When n = 5, When n =, = = 4 = = 5 = = = + = = + + = = 5 It seems that most terms n the mddle wll cancel out. More specfcally, when n s even, only the frst term remans, and when n s odd, only the frst and last term, namely n+ and n remans. Therefore, we may guess that: n { = n s even n s odd = Now, what we are left to do s to formally prove ths s the correct formula, whch wll be presented n the next part. We ll use nducton to prove ths. n+ n How to how to formally prove ths problem Ths part s the formal proof, whch should be on your answer sheet.
4 Let Pn = n { = n s even n+ n n s odd = Proof Because the cases splt by party, we rewrte n as ether k or k + to ndcate the party. And we wll nduct on k N and k. Base Case. When k =, we have + = = = = = and Inducton Step. Assume for some k and k N, k = Then we have k+ = = = = k+ and k+ = k + k + + = 4 = = + = = k + k + k + k + = k + = k + k + = k + k + IH k + 4
5 and k++ = = = k+ = + k + = k + 4 k + k + + = k + + k + whch also comples wth the formula we clamed. Therefore, by nducton, we have proved that for all ntegers n n { = n s even n s odd = n+ n Problem 4 Startng wth a sngle stack of 00 cons, two players take alternate turns; n each turn, a player removes,, or 4 cons from the stack. The player who removes the last con wns. Prove that the second player has a strategy to wn regardless of what strategy the frst player uses. Hnt: prove somethng more general Soluton. An teraton of the game conssts of a move by the frst player, followed by a move by the second player. Let pn be the logcal formula, If the game begns wth 5n cons, then the second player has a wnnng strategy. We wll use nducton to show that pn s true for all postve ntegers n. Note that the truth of p0 s exactly what we were asked to show. Base case. p s true, because f the frst player removes cons, then the second player can remove 5 cons e {5 : [4]} = [4]. Inducton Step. Now suppose that k s a postve nteger and that pk s true. Consder a game that begns wth 5k + 5 cons. As n the base case, f the frst player removes cons, then the second player can remove 5 cons, leavng 5k cons. By the truth of pk, and snce t wll be the frst player s turn, the second player has a wnnng strategy from ths pont. 5
6 Therefore, by the prncple of mathematcal nducton, we have shown that pn s true for all postve ntegers n, and the result follows. Problem 5 Suppose that a football team can score ponts or 7 ponts on any scorng opportunty e do not consder, 6 and 8 pont optons. Fnd, wth proof, the largest score that s not possble for the team to acheve. Soluton. We clam that s the largest unachevable score. Frst note that s, ndeed, not achevable. To acheve a score of, there would have to be ether zero or one 7 pont score. Snce s not a multple, zero 7 pont scores s mpossble, and snce 4 s not a multple of, one 7 pont score s mpossble. Now we ll prove that f n then n can be expressed as a nonnegatve multple of plus a nonnegatve multple of 7 by strong nducton on n. Let pn = n = + 7j for some natural numbers and j. Base case. Note that so p, p and p4 are all true. = 4 = = 7 Inducton step. Fx n 4 and suppose, for all k N wth k n, that pk s true, e k can be expressed as a nonnegatve multple of plus a nonnegatve multple of 7. Snce n 4 we have n n. Hence, by our nducton hypothess, n = a + 7b for some a, b 0. Thus n + = a + + 7b and n + can be expressed as a nonnegatve multple of plus a nonnegatve multple of 7. Combnng the above arguments shows that s the largest unachevable score. Problem 6 Let a n n N be a sequence satsfyng a n = a n + a n for all n 6
7 a Gven that a 0, a are odd, prove that a n s odd for all n N. b Gven that a 0 = a =, prove that a n = n n+ for all n N. Soluton. a Suppose a 0 and a are odd. We ll prove that a n s odd for all n N by strong nducton on n. Let pn = a n s odd. For the base case, p0 and p are true, snce we re assumng that a 0, a are odd. For the nducton step, fx n and suppose that for all k n pk s true, e a k s odd. Then, n partcular, a n and a n are odd, so a n = p and a n = q for some p, q Z. Now snce n +, we have a n+ = a n + a n = p + q = p + q so a n+ s odd. Hence, by nducton, a n s odd for all n N. b We ll prove that a n = n n+ for all n N by strong nducton on n. Let pn = a n = n n+. Base case. The truth of p0 and p follow by pluggng n values: 0 = + = = a 0 = = = a Inducton step. Fx n > and suppose that for all 0 < n p s true, e a = +. Snce n > t follows that n, so we can apply the formula to obtan a n = a n + a n Snce 0 n < n and 0 n < n, the nducton hypothess yelds a n = n n + n n = n + n n n = n + n + n n = n n = n n+ Ths s what we needed to prove. By strong nducton, t follows that a n = n n+ for all n N. 7
8 Problem 7 Let f n n N be the sequence satsfyng f 0 = 0, f = and f n = f n + f n for all n. Show, by nducton, that f n + f n+ = f n+ and f n+ f n = f n+ for every n N. Soluton. For all natural numbers n, let P n denote the proposton that f n + f n+ = f n+ and f n+ f n = f n+. We wll show that P n s true for all n 0 by nducton. Base case. Compute f = f + f 0 =. Ths means that f 0 + f = 0 + = = f 0+ and f f 0 = 0 = = f 0+. Thus both equaltes are true when n = 0, mplyng that P 0 s true. Inducton step. Assume now that n N and P n s true, meanng that fn + fn+ = f n+ and fn+ fn = f n+. Our goal s to show that P n P n +,.e. that fn+ + fn+ = f n+ and fn+ fn+ = f n+4. To do ths, frst remark that the equaltes n P n can be rewrtten as Thus fn+ + fn+ IH = f n+ f n f n+ = f n+ f n and f n+ = f n + f n+. = f n+ + f n+ = f n+. + Ths proves the frst equalty n P n +. f n+ + f n 8
9 The second equalty s trcker; whle t s possble to go through the algebrac manpulatons drectly, they are somewhat unmotvated, and so we nstead choose to show a less computatonal soluton. Note that for any real numbers a and b, a + b + a b = a + ab + b + a ab + b = a + b. In partcular, settng a = f n+ and b = f n+ yelds Ths rearranges now to f n+ + f n+ = f n+ + f n+ + f n+ f n+ = f n+ + f n. f n+ f n+ = f n+ + f n+ f n = f n+ + f n+ + f n+ f n IH = fn+ + f n+ = f n+4. Note that n the step n whch we nvoke the nductve hypothess we also make use of the fact that f n+ + f n+ = f n+, whch we proved n the prevous paragraph. Ths proves the second equalty. Thus by the prncpal of mathematcal nducton, we are done. Bonus Problem ponts On the sland of Perfect Reasonng, k > 0 people dress unfashonably. Clve Newstead arrves on a boat, somewhat dstressed at the stereotypcal unfashonablty of the logcally adept, and announces, At least one of you s dressed unfashonably. No unfashonably dressed person realzes that they are dressed unfashonably, but everyone else on the sland realzes t. In n days from now f you have concluded that your apparel s unfashonable, you wll come to the beach at noon that day to denounce your apparel. The slanders gather at noon every day thereafter. When wll the unfashonable apparel be denounced, and how wll the wearers reason? Soluton. Frst consder the case when k =. Then, ths person wll mmedately know that they are dressed unfashonably, and the unfashonable apparel wll be denounced on day. Although not strctly necessary, nvestgatng the k = case s enlghtenng. Say the unfashonable people on the sland are p, p. From the perspectve of p, f he s not unfashonable, then p wll know that p s not unfashonable and p wll denounce hs fashon on day. Thus, f p does not denounce hs fashon on day, p knows that he must be unfashonable, and so he wll denounce hs fashon on day. A key aspect s that p wll thnk exactly the same way as p, and 9
10 so p wll do the same thng, and p, p wll both denounce ther fashon on day. Now, let P k be the proposton that for k > 0 unfashonable people, t wll take k days for the unfashonable apparel to be denounced; furthermore, all k unfashonable people on the sland wll denounce ther unfashonable apparel on the k th day. We have establshed that the base case P s true. We proceed va nducton. Consder the case where we have k + unfashonable people, say p, p,..., p k+. From the perspectve of p k+, f he s not unfashonable, then by the nductve hypothess p, p,..., p k wll all denounce ther unfashonable apparel on day k. Therefore, f p k+ does not see anybody denounce ther fashon on day k, then he wll conclude that he must be unfashonable and announce ths on day k +. Every unfashonable person p on the sland wll reason the same way, and so all k + unfashonable people wll denounce ther fashon on the k + th day. As P k P k +, and P s true, we have by the prncple of nducton that P k s true for every k. Extra Problem Let P n be a mathematcal statement dependng on an nteger n. Suppose that: P 0 s true; and Gven n Z, f P n s true, then at least one of P n + or P n s true. For whch n Z must P n be true? Soluton. P n needs to be true when n = 0; but gven any n 0, P n need not be true. P 0 must be true by. Let P n be the statement n 0. Then P 0 s the asserton 0 0, whch s true. Gven n N, suppose P n s true. Then n 0, so that n 0. Hence P n s true. Hence P n satsfes and, provng that P n need not be true for any n > 0. Now take P n to be the asserton n 0. The same argument as above yelds that P n satsfes and, and yet s false for all n < 0. 0
11 Extra Problem Let n be a postve nteger. For each sum below, wrte t n summaton notaton and fnd and prove a formula n terms of n: a n ; b n + ; c n + n; d n 4n. Soluton. a The sum s n = 4. Snce = nn+, t s equal to nn + n, whch s n turn equal to nn +. b The sum s n = Lke wth, ths s equal to nn + + n +, whch s equal to n + n +. c The sum s n =0 + here we group each par of terms,.e. + for each n. Hence the value of the sum s n. Ths could also be proved by nducton usng the expresson n =, but ths s more nvolved and s unnecessary. d Lke n c, the sum s n =, snce the pars of terms are all of the form +, whch s equal to. Hence the sum evaluates to 4n. Ths could also be proved by nducton usng the expresson n = +. Extra Problem Let a R wth a 0. Fnd the flaw n the followng proof that a n = for all n 0: We prove that a n = for all n 0 by nducton on n. Base case. a 0 = snce any nonzero real number rased to the power 0 s equal to. Inducton step. Let n N and assume the nducton hypothess. Then a n+ = an a n a n = =
12 By nducton, a n = for all n 0. Soluton. The error s n the nducton step. The nducton hypothess s not clearly stated; f t were, then t would be more obvous that t only assumes that a n =, not that a n = as well. To fx ths, we would need to use strong nducton; but then we d realze the clam fals n the nducton step, snce a = a, whch need not be equal to. Extra Problem 4 Show that for all postve ntegers n, the number 4 n + 5n s dvsble by 9. Soluton. Let P n denote the proposton that 4 n + 5n s dvsble by 9. We prove that P n s true for all n va nducton. BC: Note that for n =, we have 4 n + 5n = = 8. Snce 8 s dvsble by 9, we see that P s true. IS: Now assume that P n s true for some n, so that 4 n + 5n s dvsble by 9. Then 4 n+ + 5n + = 4 4 n + 5n + 4 = 44 n + 5n n. Note that by the Inducton Hypothess, 4 n + 5n s dvsble by 9, so there exsts k Z wth 4 n +5n = 9k. Thus, we have 4 n+ +5n+ = 4 9k +8 45n = 9 4k + 5n, so 4 n+ + 5n + s dvsble by 9. Thus P n P n +, as desred. Combnng both of the above bullet ponts gves that P n s true for all nteger n, as desred.
a b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationarxiv: v6 [math.nt] 23 Aug 2016
A NOTE ON ODD PERFECT NUMBERS JOSE ARNALDO B. DRIS AND FLORIAN LUCA arxv:03.437v6 [math.nt] 23 Aug 206 Abstract. In ths note, we show that f N s an odd perfect number and q α s some prme power exactly
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationComplex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)
Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More information28 Finitely Generated Abelian Groups
8 Fntely Generated Abelan Groups In ths last paragraph of Chapter, we determne the structure of fntely generated abelan groups A complete classfcaton of such groups s gven Complete classfcaton theorems
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationMath 2534 Final Exam Review Answer Key 1. Know deþnitions for the various terms: a. Modus Ponens b. Modus Tollens c. divides d. rational e.
Math 534 Fnal Exam Revew Answer Key 1. Know deþntons for the varous terms: a. Modus Ponens b. Modus Tollens c. dvdes d. ratonal e. Quotent-Remander Theorem f. unon g. ntersecton h. complement. DeMorgan
More informationPRIMES 2015 reading project: Problem set #3
PRIMES 2015 readng project: Problem set #3 page 1 PRIMES 2015 readng project: Problem set #3 posted 31 May 2015, to be submtted around 15 June 2015 Darj Grnberg The purpose of ths problem set s to replace
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationInternational Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions
Internatonal Mathematcal Olympad Prelmnary Selecton ontest Hong Kong Outlne of Solutons nswers: 7 4 7 4 6 5 9 6 99 7 6 6 9 5544 49 5 7 4 6765 5 6 6 7 6 944 9 Solutons: Snce n s a two-dgt number, we have
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationSolutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010
Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationCS286r Assign One. Answer Key
CS286r Assgn One Answer Key 1 Game theory 1.1 1.1.1 Let off-equlbrum strateges also be that people contnue to play n Nash equlbrum. Devatng from any Nash equlbrum s a weakly domnated strategy. That s,
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationFOR WHICH p-adic INTEGERS x CAN k
FOR WHICH p-adic INTEGERS x CAN x BE DEFINED? DONALD M. DAVIS Abstract. Let fn) = n. Frst, we show that f : N Q p s nowhere contnuous n the p-adc topology. If x s a p-adc nteger, we say that fx) s p-defnable
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationBayesian epistemology II: Arguments for Probabilism
Bayesan epstemology II: Arguments for Probablsm Rchard Pettgrew May 9, 2012 1 The model Represent an agent s credal state at a gven tme t by a credence functon c t : F [0, 1]. where F s the algebra of
More informationMAE140 - Linear Circuits - Fall 13 Midterm, October 31
Instructons ME140 - Lnear Crcuts - Fall 13 Mdterm, October 31 () Ths exam s open book. You may use whatever wrtten materals you choose, ncludng your class notes and textbook. You may use a hand calculator
More informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
More informationVapnik-Chervonenkis theory
Vapnk-Chervonenks theory Rs Kondor June 13, 2008 For the purposes of ths lecture, we restrct ourselves to the bnary supervsed batch learnng settng. We assume that we have an nput space X, and an unknown
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationThe Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne
The Ramanujan-Nagell Theorem: Understandng the Proof By Spencer De Chenne 1 Introducton The Ramanujan-Nagell Theorem, frst proposed as a conjecture by Srnvasa Ramanujan n 1943 and later proven by Trygve
More informationPh 219a/CS 219a. Exercises Due: Wednesday 23 October 2013
1 Ph 219a/CS 219a Exercses Due: Wednesday 23 October 2013 1.1 How far apart are two quantum states? Consder two quantum states descrbed by densty operators ρ and ρ n an N-dmensonal Hlbert space, and consder
More information1 Generating functions, continued
Generatng functons, contnued. Exponental generatng functons and set-parttons At ths pont, we ve come up wth good generatng-functon dscussons based on 3 of the 4 rows of our twelvefold way. Wll our nteger-partton
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationOn the irreducibility of a truncated binomial expansion
On the rreducblty of a truncated bnomal expanson by Mchael Flaseta, Angel Kumchev and Dmtr V. Pasechnk 1 Introducton For postve ntegers k and n wth k n 1, defne P n,k (x = =0 ( n x. In the case that k
More informationOn the Operation A in Analysis Situs. by Kazimierz Kuratowski
v1.3 10/17 On the Operaton A n Analyss Stus by Kazmerz Kuratowsk Author s note. Ths paper s the frst part slghtly modfed of my thess presented May 12, 1920 at the Unversty of Warsaw for the degree of Doctor
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationHomotopy Type Theory Lecture Notes
15-819 Homotopy Type Theory Lecture Notes Evan Cavallo and Stefan Muller November 18 and 20, 2013 1 Reconsder Nat n smple types s a warmup to dscussng nductve types, we frst revew several equvalent presentatons
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationSolutions to Homework 7, Mathematics 1. 1 x. (arccos x) (arccos x) 1
Solutons to Homework 7, Mathematcs 1 Problem 1: a Prove that arccos 1 1 for 1, 1. b* Startng from the defnton of the dervatve, prove that arccos + 1, arccos 1. Hnt: For arccos arccos π + 1, the defnton
More informationApproximate Smallest Enclosing Balls
Chapter 5 Approxmate Smallest Enclosng Balls 5. Boundng Volumes A boundng volume for a set S R d s a superset of S wth a smple shape, for example a box, a ball, or an ellpsod. Fgure 5.: Boundng boxes Q(P
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationHyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix
6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract
More informationThe Number of Ways to Write n as a Sum of ` Regular Figurate Numbers
Syracuse Unversty SURFACE Syracuse Unversty Honors Program Capstone Projects Syracuse Unversty Honors Program Capstone Projects Sprng 5-1-01 The Number of Ways to Wrte n as a Sum of ` Regular Fgurate Numbers
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationLagrange Multipliers. A Somewhat Silly Example. Monday, 25 September 2013
Lagrange Multplers Monday, 5 September 013 Sometmes t s convenent to use redundant coordnates, and to effect the varaton of the acton consstent wth the constrants va the method of Lagrange undetermned
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationNAME and Section No.
Chemstry 391 Fall 2007 Exam I KEY (Monday September 17) 1. (25 Ponts) ***Do 5 out of 6***(If 6 are done only the frst 5 wll be graded)*** a). Defne the terms: open system, closed system and solated system
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationThe Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions
5-6 The Fundamental Theorem of Algebra Content Standards N.CN.7 Solve quadratc equatons wth real coeffcents that have comple solutons. N.CN.8 Etend polnomal denttes to the comple numbers. Also N.CN.9,
More informationCHAPTER 5: Lie Differentiation and Angular Momentum
CHAPTER 5: Le Dfferentaton and Angular Momentum Jose G. Vargas 1 Le dfferentaton Kähler s theory of angular momentum s a specalzaton of hs approach to Le dfferentaton. We could deal wth the former drectly,
More information3rd Bay Area Mathematical Olympiad
2001 3rd Bay Area Mathematcal Olympad February 27, 2001 Problems and Solutons 1 Each vertex of a regular 17-gon s colored red, blue, or green n such a way that no two adacent vertces have the same color.
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationTHE SCIENTIFIC METHOD
THE SCIENTIFIC METHOD A Hypotheses, sad Medawar n 1964, are magnatve and nspratonal n character ; they are adventures of the mnd. He was argung n favour of the poston taken by Karl Popper n The Logc of
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More information