18.781: Solution to Practice Questions for Final Exam
|
|
- Sharleen Pierce
- 5 years ago
- Views:
Transcription
1 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 =[,, ]=[,, ]=[,, 6+] =[,, 4, ] 6 =[,, 4,, 4,, 4,...]=[,, 4]. Therefore, lookng at [, ] we get 5/, whch leads to 5 6 = 1. Therefore (5, ) s a soluton. To get two more we compute (5 + 6) = (5 + 6) 3 =(5+ 6) ( ) = Therefore (5, ), (49, 0) and (485, 198) are three solutons. Note that snce the length of the perod s (even) there are no solutons to x 6y = 1.. If θ 1 =[3, 1, 5, 9,a 1,a,...]andθ =[3, 1, 5, 7,b 1,b,...], show that θ 1 θ < 49/7095. Soluton: Let θ =[3, 1, 5] = 3/6. Then computng the next convergent to [3, 1, 5, 9] = 11/56, we see that θ 1 θ < 1/(6 55). Smlarly θ θ < 1/(6 43). So by the trangle nequalty θ 1 θ θ 1 θ + θ θ < 1/(6 55) + 1/(6 43) = 49/7095. Note: once you compute [3, 1] = 4/1 and[3, 1, 5] = 3/6, you can be a bt lazy and not compute say [3, 1, 5, 9], snce you re only nterested n q 3 = a 3 q + q 1 = = 55. Smlarly for [3, 1, 5, 7]. 3. For n = 178, fgure out the number of postve dvsors of n, and the sum of ts postve dvsors. Soluton: n = 6 3 3,sod(n) = (6 + 1)(3 + 1) = 8, and 7 1 σ(n) = = = Use multplcatvty to calculate the sum φ(d). d d 59 1
2 Soluton: Snce f(n) = φ(n)/n s a multplcatve functon of n, so s φ(d) g = U f =. d d n So we need to fgure out what t s on prme powers. We have g(1) = 1 and for e 1, g(p e p 1 p(p 1) p e 1 (p 1) 1 )=1+ ( ) =1+e p p 1. p 1 p Now 59 = We have g( 5 ) = 1 + 5/ = 7/ andg(3 4 ) = 1 + 8/3 = 11/3. So g(n) =77/6. 5. Prove that f a prme p>3 dvdes n n + 1 for an nteger n, thenp 1 (mod 6). (the orgnal problem should have sad p>3) Soluton: We have n n +1 0(modp). So 4n 4n +4 0(modp). That s, (n 1) 3(modp). So 3 s a quadratc resdue mod p (snce gcd(3,p)=1). Ths forces p 1(mod3),snce ( ) ( )( ) ( 1= = =( 1) (p 1)/ ( 1) (p 1)/ p ) ( p =, p p p 3 3) and the last expresson s +1 f p 1(mod3)and 1 fp (mod3). 6. Compute the value of the nfnte perodc fracton 1, 4. Fnd the smallest postve (.e. both x, y > 0) soluton of x 145y =1. Soluton: Let y =[4] = 4+1/y. Theny 4y 1 =0,soy = (plus sgn because y>0). Therefore x =[1, 4] = 1 + 1/y =1+1/( ) = = 145. The perod s odd. Therefore the smallest postve soluton to the Brahmagupta-Pell equaton wll come from [1, 4] = 1 + 1/4 = 89/4, and t s (89, 4). Note that [1] = 1/1 wll gve = Determne whether there s a nontrval nteger soluton of the equaton 49x +5y +38z 8xy +70xz 8yz =0. Soluton: Let s smplfy the conc. It s expedtous to frst scale x by 1/7, getttng x +5y +38z 4xy +10xz 8yz =(x y +5z) + y +13z 8yz. Therefore replacng callng (x y + 5z) our new varable x, we get So we end up wth x + y +13z 8yz = x +(y 4z) 3z. x + y 3z whch s already nce and squarefree. By Legendre s theorem, we just need to verfy whether the local condtons are satsfed. The coeffcents 1, 1, 3 don t all have the same sgn, so that one s ok. We also need to check that 1 s a square mod 3, whch s not ok. So the orgnal conc doesn t have any nontrval ratonal or nteger ponts.
3 8. Fnd a Pythagorean trangle such that the dfference of the two (shorter) sdes s 1, and every sde s at least 100. Soluton: Suppose that the sdes are r s, rs, r + s. (In general, they wll be some common multple of these, but the fact that the dfference of two of the sdes s 1, and postvty of the sdes, forces that multple to be 1 anyway). So we need r s rs =1,.e. (r s) s =1. Letx = r s and y = s, then ths s just a Brahmagupta-Pell type equaton x y = ±1. We want a soluton such that s = y and r = x+y ar e both postve, and such that mn(rs, r s ) s larger than 100. The contnued fracton of s[1, ]. So the smallest postve soluton comes from [1] = 1/1,.e. s (x, y) =(1, 1) (whch we could have guessed anyway, wthout usng contnued fractons). Now 1 1 = 1. To get all solutons, we just have to look at the ratonal and rratonal parts of (1+ ) n. The smallest one whch works s (1+ ) 3 =7+5. So we get (r, s) =(1, 5). So the Pythagorean trangle s (119, 10, 169). 9. Show that x +y =8z + 5 has no ntegral soluton. Soluton: Lookng mod 8, we see that we have x +y 5 (mod 8). Now, further lookng mod we see x must be odd. So x 1 (mod 8), whch forces y 4 (mod 8). Ths s mpossble, snce f y s even, then y 0(mod8),andfysodd, then y (mod8). 10. Defne a sequence by a 0 =, a 1 = 5 and a n = 5a n 1 4a n for n. Show that a n a n+ a n+1 s a square for every n 0. Soluton: The characterstc polynomal s T 5T +4=(T 1)(T 4). So we must have a n = A 4 n + B 1 n. Substutng n n =0and1,wegeta n =4 n +1. So whch s a perfect square. a n a n+ a n+1 =(4n + 1)(4 n+ +1) (4 n+1 +1) =4 n+ +4 n 4 n+1 n =4 ( ) = 9 4 n =( 3 n ) 11. Let p ab. Show that ax + by c (mod p) has a soluton. Soluton: Consder the (p +1)/ numberax for x =0,...,(p 1)/. These are all dstnct modulo p. Smlarly, the (p +1)/ numbersc by are also all dstnct modulo p. Snce we now have p + 1 numbers n all, and only p resdue classes mod p, by the Pgeonhole prncple, two of these must be congruent mod p. Therefore we must have ax c by (mod p) for some x, y. Therefore the congruence has a soluton. 1. How many solutons are there to x +3x (mod 8)? Fnd all of them. Soluton: We need to fgure out the number of solutons mod 4 and mod 7, and multply. Modulo 4 we have x +3x + (x +1)(x + ) (mod 4). It s easy to see ths has the solutons x 1, (mod4). Note: one must be very careful when dealng wth congruences modulo prme powers. It s not necessarly true that f you have a product of (e.g. lnear) factors, that the product wll 3
4 be zero mod p e ff one of them s. For example, x(x +) 0 (mod 8) has more than the two solutons x 0, ; n fact, any even number x wll make x(x + ) vansh mod 8, so there are 4 solutons mod 8. If p e s small enough, the best strategy s probably just to run over all the congruence classes and check. On the other hand, f you re workng mod a prme (.e. e = 1) then you can separate out factors. Modulo 7 we have x 3 +3x +18 x 4x +4=(x ) 0 (mod 7). So just one soluton x (mod 7). So the total number of solutons mod 8 s 1 =. To fnd them, we need the lnear combnaton 4+( 1) 7=1. Then to combne 1 andwehave( 1) ( 1) 7+ 4 = 3. To combne andwe have ( ) ( 1) 7+ 4=30 (mod 8). So the two solutons mod 8 are and Let a, m be postve ntegers, not necessarly coprme. Show that a m a m φ(m) (mod m). Soluton: Wrte m = p e. Enough to prove that for every. Ifp a then by Euler e a m a m φ(m) e e (mod p ) a φ(p ) 1 (mod p ). Snce φ(p ) dvdes φ(m) = φ(p ), we get that e e a φ(m) 1 (mod p e ), and then by multplyng by a m φ(m), we get the desred congruence. On the other hand, f p a, then the left and rght sdes of the congruence we wsh to prove wll be dvsble by m m φ(m) p and p respectvely. If we prove that both the exponents are at least e,thenboth sdes wll be congruent to 0 modulo p e, and we ll be done. It s obvously enough to prove m φ(m) e,sncem m φ(m). We ll assume m>1, snce f m = 1 there are no prmes dvdng t, and nothng to prove. Now note that m>φ(m) (snceφ(m) sthenumberof ntegers n {1,...,m} coprme to m, and there s at least one whch s not coprme to m, namely m). Also, snce p e m, rememberng that φ(m) =pe 1 tmes other stuff, we see that e 1 p e 1 dvdes m φ(m). So m φ(m) p e 1 e whenever e 1. (It s an easy exercse to prove by nducton that e 1 e for any e N.) 14. Parametrze all the ratonal ponts on the curve x 3y =1. Soluton: We fnd one trval pont (1, 0). So wrte y = m(x 1) and plug t n, to get So Cancellng a factor of (x 1), we get x 3m (x 1) =1 (x 1)(x +1)=3m (x 1). x +1=3m (x 1) 4
5 So x =(3m +1)/(3m 1) and then y = m(x 1) = m/(3m 1). Ths parametrzes all ratonal ponts on the conc (except for the orgnal pont (1, 0), whch s obtaned as a lmt when m ). 15. Fnd an nteger soluton of 37x +41y = 3. Soluton: We run the Eucldean algorthm on 37 and 41 to get So ( 9) = Show that f n>1thenn n 1. (Hnt: consder the smallest prme dvdng n). Soluton: By contradcton. Suppose n n 1. Let p be the smallest prme dvdng n. Then p n 1. So the order of mod p dvdes n. But t also dvdes p 1. So the order h of mod p s less than p and dvdes n, and so are the prmes dvdng h. Snce there s no prme smaller than p whch dvdes n, the order must be 1. So 1 1(modp), whch s mpossble. 17. Let p 11 be prme. Show that for some n {1,...,9}, bothn and n + 1 are quadratc resdues. If ether or 5 s a quadratc resdue mod p, we re done, consderng the pars (1, ) and (4, 5), snce 1 and 4 are squares and therefore quadratc resdues. If both and 5 are quadratc nonresdues, then 10 s a quadratc resdue. So (9, 10) does the job. 18. Show that f 3a b (mod 17) then 3a b (mod 89). Soluton: We calculate ( ) ( ) ( ) ( ) ( ) = = = = = So f 3a b (mod 17) then we clam 17 a, else we would have 3 (ba 1 ) (mod 17) whch s a contradcton to the above calculaton. So 17 3a = b and so 17 b. Then 17 3a b,so3a b (mod 89). 19. Calculate the product α ( α), where α runs over the prmtve 14 th roots of unty. Soluton: We compute the cyclotomc polynomal Φ 14 (x) notngthattmusthavedegree φ(14) = 6. x 14 1=(x 7 1)(x 7 +1). Throwng out x 7 1, we have x 7 +1=(x +1)(x 6 x 5 + x 4 x 3 + x x +1) 5
6 So Φ 14 (x) =x 6 x 5 + x 4 x 3 + x x +1. Note that Φ 14 (x) = α (x α), where α runs over the prmtve 14 th roots of unty. Substtutng x =n,weget ( α) = =43. α 0. Let f be a multplcatve functon wth f(1) = 1, and let f 1 be ts nverse for Drchlet convoluton. Show that f 1 s multplcatve as well, and that for squarefree n, wehave f 1 (n) =μ(n)f(n). Soluton: The nverse f 1 s defned by f f 1 = 1, and t exsts as long as f(1) =0,aswe showed on a problem set. To show t s multplcatve, we wll defne a functon g whch wll be multplcatve by defnton, and show that f g = 1. Then t wll follow that f 1 = g. So let g(1) = 1, and defne g on prme powers p e by nducton on e 1 by lettng 1(p e )=0=(f g)(p e )=f(1)g(p e )+f(p)g(p e 1 )+...f(p e 1 )g(e)+f(p e )g(1) = g(p e )+f(p)g(p e 1 )+...f(p e 1 )g(e)+f(p e )g(1). Snce g(1),...,g(p e 1 ) have been defned by the nducton hypothess, we can solve ths unquely for g(p e ). Then for n = p e 1 e 1...p r r, defne g(n) = e g(p ). By constructon, g s multplcatve. Therefore so s g f. By constructon (g f)(1) = 1 and (g f)(p e )=0for e 1. So (g f)(n) =0forn 1 by multplcatvty. That s, g f = 1. Therefore g s the multplcatve nverse of f. Note that there s a unque multplcatve nverse, snce f g were another nverse, then g = g 1 = g (f g )=(g f) g = 1 g = g. Fnally, we need to show g(n) = μ(n)f(n) for n squarefree. By multplcatvty of g, μ and f, t s enough to show ths when n = p, a prme (t s clearly true for n =1). Buttheng(p) s defned by 0=g(p)+f(p)g(1) = g(p)+f(p). That s, g(p) = f(p) = μ(p)f(p), whch fnshes the proof. 6
7 MIT OpenCourseWare Theory of Numbers Sprng 01 For nformaton about ctng these materals or our Terms of Use, vst:
THE 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 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 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 information(2mn, m 2 n 2, m 2 + n 2 )
MATH 16T Homewk Solutons 1. Recall that a natural number n N s a perfect square f n = m f some m N. a) Let n = p α even f = 1,,..., k. be the prme factzaton of some n. Prove that n s a perfect square f
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 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 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 informationBasic Number Theory. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. Last revision: June 11, 2001
Basc Number Theory Instructor: Laszlo Baba Notes by Vncent Lucarell and the nstructor Last revson: June, 200 Notaton: Unless otherwse stated, all varables n ths note are ntegers. For n 0, [n] = {, 2,...,
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 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 informationSome Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM
Example of Extended Eucldean Algorthm Recall that gcd(84, 33) = gcd(33, 18) = gcd(18, 15) = gcd(15, 3) = gcd(3, 0) = 3 We work backwards to wrte 3 as a lnear combnaton of 84 and 33: 3 = 18 15 [Now 3 s
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 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 informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationAttacks on RSA The Rabin Cryptosystem Semantic Security of RSA Cryptology, Tuesday, February 27th, 2007 Nils Andersen. Complexity Theoretic Reduction
Attacks on RSA The Rabn Cryptosystem Semantc Securty of RSA Cryptology, Tuesday, February 27th, 2007 Nls Andersen Square Roots modulo n Complexty Theoretc Reducton Factorng Algorthms Pollard s p 1 Pollard
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 informationMULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6
MULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6 In these notes we offer a rewrte of Andrews Chapter 6. Our am s to replace some of the messer arguments n Andrews. To acheve ths, we need to change
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationPolynomial PSet Solutions
Polynomal PSet Solutons Note: Problems A, A2, B2, B8, C2, D2, E3, and E6 were done n class. (A) Values and Roots. Rearrange to get (x + )P (x) x = 0 for x = 0,,..., n. Snce ths equaton has roots x = 0,,...,
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 information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
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 informationSolutions to Problem Set 6
Solutons to Problem Set 6 Problem 6. (Resdue theory) a) Problem 4.7.7 Boas. n ths problem we wll solve ths ntegral: x sn x x + 4x + 5 dx: To solve ths usng the resdue theorem, we study ths complex ntegral:
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 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 informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationA summation on Bernoulli numbers
Journal of Number Theory 111 (005 37 391 www.elsever.com/locate/jnt A summaton on Bernoull numbers Kwang-Wu Chen Department of Mathematcs and Computer Scence Educaton, Tape Muncpal Teachers College, No.
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 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 informationinv lve a journal of mathematics 2008 Vol. 1, No. 1 Divisibility of class numbers of imaginary quadratic function fields
nv lve a journal of mathematcs Dvsblty of class numbers of magnary quadratc functon felds Adam Merberg mathematcal scences publshers 2008 Vol. 1, No. 1 INVOLVE 1:1(2008) Dvsblty of class numbers of magnary
More informationAlgebraic properties of polynomial iterates
Algebrac propertes of polynomal terates Alna Ostafe Department of Computng Macquare Unversty 1 Motvaton 1. Better and cryptographcally stronger pseudorandom number generators (PRNG) as lnear constructons
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 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 informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationChowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions
Proc. Int. Conf. Number Theory and Dscrete Geometry No. 4, 2007, pp. 7 79. Chowla s Problem on the Non-Vanshng of Certan Infnte Seres and Related Questons N. Saradha School of Mathematcs, Tata Insttute
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 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 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 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 information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
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 informationSPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS
SPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS ROBERT S. COULTER AND TODD GUTEKUNST Abstract. Ths artcle ntroduces a new approach to studyng dfference sets
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 information332600_08_1.qxp 4/17/08 11:29 AM Page 481
336_8_.qxp 4/7/8 :9 AM Page 48 8 Complex Vector Spaces 8. Complex Numbers 8. Conjugates and Dvson of Complex Numbers 8.3 Polar Form and DeMovre s Theorem 8.4 Complex Vector Spaces and Inner Products 8.5
More informationMEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x
MEM633 Lectures 7&8 Chapter 4 Descrptons of MIMO Systems 4- Drect ealzatons y() s s su() s y () s u () s ( s)( s) s y() s u (), s y() s u() s s s y() s u(), s y() s u() s ( s)( s) s () ( s ) y ( s) u (
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 informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
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 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 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 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 informationDifferential Polynomials
JASS 07 - Polynomals: Ther Power and How to Use Them Dfferental Polynomals Stephan Rtscher March 18, 2007 Abstract Ths artcle gves an bref ntroducton nto dfferental polynomals, deals and manfolds and ther
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 informationMTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i
MTH 819 Algebra I S13 Homework 1/ Solutons Defnton A. Let R be PID and V a untary R-module. Let p be a prme n R and n Z +. Then d p,n (V) = dm R/Rp p n 1 Ann V (p n )/p n Ann V (p n+1 ) Note here that
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 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 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 informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
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 informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
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 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 informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
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 informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationCharacter Degrees of Extensions of PSL 2 (q) and SL 2 (q)
Character Degrees of Extensons of PSL (q) and SL (q) Donald L. Whte Department of Mathematcal Scences Kent State Unversty, Kent, Oho 444 E-mal: whte@math.kent.edu July 7, 01 Abstract Denote by S the projectve
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationMultiplicative Functions and Möbius Inversion Formula
Multplcatve Functons and Möbus Inverson Forula Zvezdelna Stanova Bereley Math Crcle Drector Mlls College and UC Bereley 1. Multplcatve Functons. Overvew Defnton 1. A functon f : N C s sad to be arthetc.
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 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 informationCOMPUTING THE NORM OF A MATRIX
COMPUTING THE NORM OF A MATRIX KEITH CONRAD 1. Introducton In R n there s a standard noton of length: the sze of a vector v = (a 1,..., a n ) s v = a 2 1 + + a2 n. We wll dscuss n Secton 2 the general
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 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 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 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 information1. Estimation, Approximation and Errors Percentages Polynomials and Formulas Identities and Factorization 52
ontents ommonly Used Formulas. Estmaton, pproxmaton and Errors. Percentages. Polynomals and Formulas 8. Identtes and Factorzaton. Equatons and Inequaltes 66 6. Rate and Rato 8 7. Laws of Integral Indces
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationk t+1 + c t A t k t, t=0
Macro II (UC3M, MA/PhD Econ) Professor: Matthas Kredler Fnal Exam 6 May 208 You have 50 mnutes to complete the exam There are 80 ponts n total The exam has 4 pages If somethng n the queston s unclear,
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 informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
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 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 information