Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010
|
|
- Hilary Cross
- 5 years ago
- Views:
Transcription
1 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 },...; for n odd, t s acheved by the partton {n},{,n },{2,n 2},... One way to see that ths s optmal s to note that the common sum can never be less than n, snce n tself belongs to one of the boxes. Ths mples that k + + n/n n + /2. Another argument s that f k > n + /2, then there would have to be two boxes wth one number each by the pgeonhole prncple, but such boxes could not have the same sum. Remark. A much subtler queston would be to fnd the smallest k as a functon of n for whch no such arrangement exsts. A 2 The only such functons are those of the form f x cx + d for some real numbers c,d for whch the property s obvously satsfed. To see ths, suppose that f has the desred property. Then for any x R, 2 f x f x + 2 f x f x + 2 f x + + f x + f x f x + + f x. Consequently, f x + f x. Defne the functon g : R R by gx f x + f x, and put c g, d f. For all x R, g x f x + f x, so gx c dentcally, and f x f x+ f x gx c, so f x cx+d dentcally as desred. A 3 f a b, then the desred result holds trvally, so we assume that at least one of a,b s nonzero. Pck any pont a,b R 2, and let L be the lne gven by the parametrc equaton Lt a,b + a,bt for t R. By the chan rule and the gven equaton, we have d dt h L h L. f we wrte f h L : R R, then f t f t for all t. t follows that f t Ce t for some constant C. Snce f t M for all t, we must have C. t follows that ha,b ; snce a,b was an arbtrary pont, h s dentcally over all of R 2. A 4 Put N n + n + n. Wrte n 2 m k wth m a nonnegatve nteger and k a postve odd nteger. For any nonnegatve nteger j, Snce n n 2 m m +, n s dvsble by 2 n and hence by 2 m+, and smlarly n s dvsble by 2 n and hence by 2 m+. t follows that N mod 2m +. Snce N n > n + 2m +, t follows that N s composte. A 5 We start wth three lemmas. Lemma. f x,y G are nonzero orthogonal vectors, then x x s parallel to y. Proof. Put z x y, so that x,y, and z x y are nonzero and mutually orthogonal. Then w x z, so w x z s nonzero and orthogonal to x and z. However, f x x y, then w x x y x x y x x y s also orthogonal to y, a contradcton. Lemma 2. f x G s nonzero, and there exsts y G nonzero and orthogonal to x, then x x. Proof. Lemma mples that x x s parallel to both y and x y, so t must be zero. Lemma 3. f x,y G commute, then x y. Proof. f x y, then y x s nonzero and dstnct from x y. Consequently, x y x y and y x y x x y. We proceed now to the proof. Assume by way of contradcton that there exst a,b G wth a b. Put c a b a b, so that a,b,c are nonzero and lnearly ndependent. Let e be the dentty element of G. Snce e commutes wth a,b,c, by Lemma 3 we have e a e b e c. Snce a,b,c span R 3, e x for all x R 3, so e. Snce b,c, and b c b c are nonzero and mutually orthogonal, Lemma 2 mples b b c c b c b c e. Hence b c c b, contradctng Lemma 3 because b c. The desred result follows. A 6 Frst soluton. Note that the hypotheses on f mply that f x > for all x [,+, so the ntegrand s a contnuous functon of f and the ntegral makes sense. Rewrte the ntegral as f x +, f x 2m j j mod 2m +.
2 2 and suppose by way of contradcton that t converges to a fnte lmt L. For n, defne the Lebesgue measurable set n {x [,] : f x + n + f x + n /2}. Then L n 2 µ n, so the latter sum converges. n partcular, there exsts a nonnegatve nteger N for whch nn µ n < ; the ntersecton n [,] [,] n nn nn then has postve Lebesgue measure. By Taylor s theorem wth remander, for t [,/2], { } log t t +t 2 sup t 2 t [,/2] t t2 5 3 t. For each nonnegatve nteger n N, we then have n L N n N n N 3 5 n N f x + f x log 5 log n log N f x + + f x + f x + + f x + f x + f x + + f x + f x + + f x + N f x + n. For each x, log f x + N/ f x + n s a strctly ncreasng unbounded functon of n. By the monotone convergence theorem, the ntegral log f x + N/ f x + n grows wthout bound as n +, a contradcton. Thus the orgnal ntegral dverges, as desred. Remark. Ths soluton s motvated by the commonlyused fact that an nfnte product + x + x 2 converges absolutely f and only f the sum x +x 2 + converges absolutely. The addtonal measure-theoretc argument at the begnnng s needed because one cannot bound log t by a fxed multple of t unformly for all t [,. Greg Martn suggests a varant soluton that avods use of Lebesgue measure. Note frst that f f y > 2 f y +, then ether f y > 2 f y + /2 or f y + /2 > 2 f y +, and n ether case we deduce that b a f there exst arbtrarly large values of y for whch f y > 2 f y+, we deduce that the orgnal ntegral s greater than any multple of /7, and so dverges. Otherwse, for x large we may argue that f x f x + f x > 3 5 log f x f x + as n the above soluton, and agan get dvergence usng a telescopng sum. Second soluton. Communcated by Paul Allen. Let b > a be nonnegatve ntegers. Then f x f x + f x b ka b ka b ka f x + k f x + k + f x + k f x + k f x + k + f x + k f x + k f x + k + f x + a f x + a f x + b. f x + a Now snce f x, gven a, we can choose an nteger la > a for whch f la < f a + /2; then f x+a f x+la f x+a f la f a+ > /2 for all x [,]. Thus f we defne a sequence of ntegers a n by a, a n+ la n, then f x f x + f x > an+ n n and the fnal sum clearly dverges. f x f x + a n f x /2, Thrd soluton. By Joshua Rosenberg, communcated by Cataln Zara. f the orgnal ntegral converges, then on one hand the ntegrand f x f x+/ f x f x + / f x cannot tend to as x. On the other hand, for any a, f a + < f a < a+ f x f a a f x f x + f a a f x f x +, f x a and the last expresson tends to as a. Hence by the squeeze theorem, f a + / f a as a, a contradcton. y+/2 y /2 f x f x + > 2 > f x 2 7.
3 3 B Frst soluton. No such sequence exsts. f t dd, then the Cauchy-Schwartz nequalty would mply contradcton. 8 a 2 + a a 4 + a a 3 + a , Second soluton. Communcated by Cataln Zara. Suppose that such a sequence exsts. f a 2 k [,] for all k, then a 4 k a2 k for all k, and so 4 a 4 + a a 2 + a , contradcton. There thus exsts a postve nteger k for whch a 2 k. However, n ths case, for m large, a2m k > 2m and so a 2m + 2m. + a2m 2 Thrd soluton. We generalze the second soluton to show that for any postve nteger k, t s mpossble for a sequence a,a 2,... of complex numbers to satsfy the gven condtons n case the seres a k + ak 2 + converges absolutely. Ths ncludes the orgnal problem by takng k 2, n whch case the seres a 2 + a2 2 + conssts of nonnegatve real numbers and so converges absolutely f t converges at all. Snce the sum a k converges by hypothess, we can fnd a postve nteger n such that n+ a k <. For each postve nteger d, we then have n kd a kd n+ a kd <. We thus cannot have a,..., a n, or else the sum n akd would be bounded n absolute value by n ndependently of d. But f we put r max{ a,..., a n } >, we obtan another contradcton because for any ε >, lm supr ε kd n d a kd >. For nstance, ths follows from applyng the root test to the ratonal functon z d, n a k z d n a kd whch has a pole wthn the crcle z r /k. An elementary proof s also possble. Fourth soluton. Communcated by Noam Elkes. Snce k a 2 k 2, for each postve nteger k we have a 2 k 2 and so a4 k 2a2 k, wth equalty only for a2 k {,2}. Thus to have k a 4 k 4, there must be a sngle ndex k for whch a 2 k 2, and the other a k must all equal. But then k a 2m k 2 m 2m for any postve nteger m > 2. Remark. Manjul Bhargava ponts out t s easy to construct sequences of complex numbers wth the desred property f we drop the condton of absolute convergence. Here s an nductve constructon of whch several varants are possble. For n,2,... and z C, defne the fnte sequence s n,z z e2π j/n : j,...,n. Ths sequence has the property that for any postve nteger j, the sum of the j-th powers of the terms of s n,z equals /z j f j s dvsble by n and otherwse. Moreover, any partal sum of j-th powers s bounded n absolute value by n/ z j. The desred sequence wll be constructed as follows. Suppose that we have a fnte sequence whch has the correct sum of j-th powers for j,...,m. For nstance, for m, we may start wth the sngleton sequence. We may then extend t to a new sequence whch has the correct sum of j-th powers for j,...,m +, by appendng k copes of s m+,z for sutable choces of a postve nteger k and a complex number z wth z < m 2. Ths last restrcton ensures that the resultng nfnte sequence a,a 2,... s such that for each postve nteger m, the seres a m + am 2 + s convergent though not absolutely convergent. ts partal sums nclude a subsequence equal to the constant value m, so the sum of the seres must equal m as desred. B 2 The smallest dstance s 3, acheved by A,, B 3,, C,4. To check ths, t suffces to check that AB cannot equal or 2. t cannot equal because f two of the ponts were to concde, the three ponts would be collnear. The trangle nequalty mples that AC BC AB, wth equalty f and only f A,B,C are collnear. f AB, we may assume wthout loss of generalty that A,, B,. To avod collnearty, we must have AC BC, but ths forces C /2,y for some y R, a contradcton. One can also treat ths case by scalng by a factor of 2 to reduce to the case AB 2, treated n the next paragraph. f AB 2, then we may assume wthout loss of generalty that A,,B 2,. The trangle nequalty mples AC BC {,}. Also, for C x,y, AC 2 x 2 + y 2 and BC 2 2 x 2 + y 2 have the same party; t follows that AC BC. Hence c,y for some y R, so y 2 and y 2 + BC 2 are consecutve perfect squares. Ths can only happen for y, but then A,B,C are collnear, a contradcton agan. Remark. Manjul Bhargava ponts out that more generally, a Heronan trangle a trangle wth nteger sdes and ratonal area cannot have a sde of length or 2 and agan t s enough to treat the case of length 2. The orgnal problem follows from ths because a trangle whose vertces have nteger coordnates has area
4 4 equal to half an nteger by Pck s formula or the explct formula for the area as a determnant. B 3 t s possble f and only f n 5. Snce , for n 4, we can start wth an ntal dstrbuton n whch each box B starts wth at most balls so n partcular B s empty. From such a dstrbuton, no moves are possble, so we cannot reach the desred fnal dstrbuton. Suppose now that n 5. By the pgeonhole prncple, at any tme, there exsts at least one ndex for whch the box B contans at least balls. We wll descrbe any such ndex as beng elgble. The followng sequence of operatons then has the desred effect. a Fnd the largest elgble ndex. f, proceed to b. Otherwse, move balls from B to B, then repeat a. b At ths pont, only the ndex can be elgble so t must be. Fnd the largest ndex j for whch B j s nonempty. f j, proceed to c. Otherwse, move ball from B to B j ; n case ths makes j elgble, move j balls from B j to B. Then repeat b. c At ths pont, all of the balls are n B. For 2,...,2, move one ball from B to B n tmes. After these operatons, we have the desred dstrbuton. B 4 Frst soluton. The pars p, q satsfyng the gven equaton are those of the form px ax + b,qx cx + d for a,b,c,d R such that bc ad. We wll see later that these ndeed gve solutons. Suppose p and q satsfy the gven equaton; note that nether p nor q can be dentcally zero. By subtractng the equatons pxqx + px + qx px qx pxqx, we obtan the equaton pxqx + + qx qxpx + + px. The orgnal equaton mples that px and qx have no common nonconstant factor, so px dvdes px + + px. Snce each of px + and px has the same degree and leadng coeffcent as p, we must have px + + px 2px. f we defne the polynomals rx px + px, sx qx + qx, we have rx + rx, and smlarly sx + sx. Put Then rx a,sx c for all x Z, and hence dentcally; consequently, px ax + b,qx cx + d for all x Z, and hence dentcally. For p and q of ths form, pxqx + px + qx bc ad, so we get a soluton f and only f bc ad, as clamed. Second soluton. Communcated by Cataln Zara. Agan, note that p and q must be nonzero. Wrte px p + p x + + p m x m qx q + q x + + q n x n wth p m,q n, so that m degp,n degq. t s enough to derve a contradcton assumng that max{m, n} >, the remanng cases beng treated as n the frst soluton. Put Rx pxqx+ px+qx. Snce m+n 2 by assumpton, the coeffcent of x m+n n Rx must vansh. By easy algebra, ths coeffcent equals m np m q n, so we must have m n >. For k,...,2m 2, the coeffcent of x k n Rx s j p q j p j q k k j + j>k, j> and must vansh. For k 2m 2, the only summand s for, j m,m, so p m q m p m q m. Suppose now that h and that p q j p j q s known to vansh whenever j > h. By the prevous paragraph, we ntally have ths for h m. Take k m+h 2 and note that the condtons + j > h, j m force h. Usng the hypothess, we see that the only possble nonzero contrbuton to the coeffcent of x k n Rx s from, j h,m. Hence p h q m p m q h ; snce p m,q m, ths mples p h q j p j q h whenever j > h. By descendng nducton, we deduce that p q j p j q whenever j >. Consequently, px and qx are scalar multples of each other, forcng Rx, a contradcton. Thrd soluton. Communcated by Davd Feldman. As n the second soluton, we note that there are no solutons where m degp, n degq are dstnct and m+n 2. Suppose p,q form a soluton wth m n 2. The desred dentty asserts that the matrx px px + qx qx + has determnant. Ths condton s preserved by replacng qx wth qx t px for any real number t. n partcular, we can choose t so that degqx t px < m; we then obtan a contradcton. a r,b p,c s,d q.
5 5 B 5 Frst soluton. The answer s no. Suppose otherwse. For the condton to make sense, f must be dfferentable. Snce f s strctly ncreasng, we must have f x for all x. Also, the functon f x s strctly ncreasng: f y > x then f y f f y > f f x f x. n partcular, f y > for all y R. For any x, f f x b and f x a >, then f x > a for x > x and thus f x ax x + b for x x. Then ether b < x or a f x f f x f b ab x +b. n the latter case, b ax +/a+ x +. We conclude n ether case that f x x + for all x. t must then be the case that f f x f x for all x, snce otherwse f x > x + for large x. Now by the above reasonng, f f b and f a >, then f x > a x + b for x >. Thus for x > max{, b /a }, we have f x > and f f x > a x + b. But then f f x > for suffcently large x, a contradcton. Second soluton. Communcated by Cataln Zara. Suppose such a functon exsts. Snce f s strctly ncreasng and dfferentable, so s f f f. n partcular, f s twce dfferentable; also, f x f f x f x s the product of two strctly ncreasng nonnegatve functons, so t s also strctly ncreasng and nonnegatve. n partcular, we can choose α > and M R such that f x > 4α for all x M. Then for all x M, f x f M + f Mx M + 2αx M 2. n partcular, for some M > M, we have f x αx 2 for all x M. Pck T > so that αt 2 > M. Then for x T, f x > M and so f x f f x α f x 2. Now f T 2T f 2T T f t 2T f t 2 dt α dt; T however, as T, the left sde of ths nequalty tends to whle the rght sde tends to +, a contradcton. Thrd soluton. Communcated by Noam Elkes. Snce f s strctly ncreasng, for some y, we can defne the nverse functon gy of f for y y. Then x g f x, and we may dfferentate to fnd that g f x f x g f x f f x. t follows that g y / f y for y y ; snce g takes arbtrarly large values, the ntegral y dy/ f y must dverge. One then gets a contradcton from any reasonable lower bound on f y for y large, e.g., the bound f x αx 2 from the second soluton. One can also start wth a lnear lower bound f x βx, then use the ntegral expresson for g to deduce that gx γ logx, whch n turn forces f x to grow exponentally. B 6 For any polynomal px, let [px]a denote the n n matrx obtaned by replacng each entry A j of A by pa j ; thus A [k] [x k ]A. Let Px x n + a n x n + + a denote the characterstc polynomal of A. By the Cayley-Hamlton theorem, A PA A n+ + a n A n + + a A A [n+] + a n A [n] + + a A [] [xpx]a. Thus each entry of A s a root of the polynomal xpx. Now suppose m n +. Then [x m+ n px]a A [m+] + a n A [m] + + a A [m+ n] snce each entry of A s a root of x m+ n px. On the other hand, A m+ n PA A m+ + a n A m + + a A m+ n. Therefore f A k A [k] for m + n k m, then A m+ A [m+]. The desred result follows by nducton on m. Remark. Davd Feldman ponts out that the result s best possble n the followng sense: there exst examples of n n matrces A for whch A k A [k] for k,...,n but A n+ A [n+].
Lectures - 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 informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
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 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 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 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 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 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 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 informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
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 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 informationa 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 informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
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 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 informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
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 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 informationand problem sheet 2
-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,
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 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 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 informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
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 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 informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
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 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 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 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 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 informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationALGEBRA HW 7 CLAY SHONKWILER
ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
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 informationTHERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.
THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q. IAN KIMING We shall prove the followng result from [2]: Theorem 1. (Bllng-Mahler, 1940, cf. [2]) An ellptc curve defned over Q does not have a
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 informationSolutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010
Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 21 Kiran Kedlaya and Lenny Ng A1 The largest such k is n+1 2 = n 2. For n even, this value is achieved by the
More information2 More examples with details
Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and
More informationMath 702 Midterm Exam Solutions
Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement
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 informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
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 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 informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
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 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 informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
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 informationALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements.
ALGEBRA MID-TERM CLAY SHONKWILER 1 Suppose I s a prncpal deal of the ntegral doman R. Prove that the R-module I R I has no non-zero torson elements. Proof. Note, frst, that f I R I has no non-zero torson
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
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 informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
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 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 informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
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 informationNorms, Condition Numbers, Eigenvalues and Eigenvectors
Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
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 informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
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 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 informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationFor all questions, answer choice E) NOTA" means none of the above answers is correct.
0 MA Natonal Conventon For all questons, answer choce " means none of the above answers s correct.. In calculus, one learns of functon representatons that are nfnte seres called power 3 4 5 seres. For
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 information1 Generating functions, continued
Generatng functons, contnued. Generatng functons and parttons We can make use of generatng functons to answer some questons a bt more restrctve than we ve done so far: Queston : Fnd a generatng functon
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 informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationNo-three-in-line problem on a torus: periodicity
arxv:1901.09012v1 [cs.dm] 25 Jan 2019 No-three-n-lne problem on a torus: perodcty Mchael Skotnca skotnca@kam.mff.cun.cz Abstract Let τ m,n denote the maxmal number of ponts on the dscrete torus (dscrete
More informationCALCULUS CLASSROOM CAPSULES
CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationk(k 1)(k 2)(p 2) 6(p d.
BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
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 informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
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 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 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 informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
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 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 information