Solutions to Problem Set 8
|
|
- Melvyn Dawson
- 5 years ago
- Views:
Transcription
1 8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of So ( ) ( + ) + ( + ω) + ( + ω ) 3 3. We have + ( ω ) + ( ω) 3 ( + )/3 if 0 (mod 6) ( )/3 if 3 (mod 6). ( )/3 if, 4 (mod 6) ( + )/3 if, 5 (mod 6) d d (A(x)) x a dx dx! 0 x a! x a +,! 0 which is the expoetial geeratig fuctio of {a, a,... }. 3. Sice c is! times the coefficiet of x i A(x)B(x), c! a 0 b! ( )! ( ) a b 0 4. By part (a), d E(x) is the expoetial geeratig fuctio for the sequece {r, r, r 3 dx,... }. It follows that E (x) re(x). Sice E(0), solvig the differetial equatio, we get. r E( ) x x e rx.! 5. (a) I gp, x/(exp(x) ) gives the sequece of B /!, from which we deduce B
2 (b) First, ote that O the other had, f(x) f( x) B x.! odd x x f(x) f( x) e x e x x xe x + e x e x x x( e ) ex So for 3 odd, B 0. x. (c) Multiplyig both sides of the defiig equatio by e x, we have ( ) x x x B.!! For, the coefficiet of x is (d) We have Therefore, > 0 ( ) B. x S () ( ) x!! 0 0 e x + e x + + e x x e x e e x e x x x e x ( ) ( ) l+ Bm x l ( ) m x m. (l + )! m! l0 m0 m Bm S()! ( ) ( m + )! m! m+ m0 + ) ( ) m B + 6. (a) If m a + b ad c + d, the m0 m m + m. m (a + b )(c + d ) (ac bd) + (ad bc). Now if p (mod 4) the p is a sum of two squares (show i class). If p 3 (mod 4) the q q + 0 is a sum of two squares. Fially, + is a sum of two squares. So ay iteger of the give form is a sum of two squares.
3 (b) We wat to use iductio o. Assume we have show that for all itegers less tha which are sums of two squares, every prime p 3 (mod 4) dividig such a iteger divides it to a eve power. Now suppose a + b ad let q 3 (mod 4) be a prime dividig (if there is o such prime, we are doe). We claim that q divides a ad b. Otherwise, say without loss of geerality that q b. Sice a + b 0 (mod q), we must have (ab ) (mod q), which is impossible. This shows that q a, b. Now write a a q ad b b q, so that q (a + b ). Lettig m a + b, by the iductive hypothesis it follows that m is divisible by primes cogruet to 3 mod 4 to eve powers. Sice q m, satisfies the same property. With the trivial base case, the iductio is complete. (c) Oe directio is obvious: if is a sum of two iteger squares, the it s a sum of two ratioal squares. Suppose ow that is a sum of two ratioal squares α ad β. Taig the commo deomiator, we write α a/d, β b/d. The a + b d. Now if we cosider ay prime q 3 (mod 4) the q divides a + b a eve umber of times. Obviously q also divides d a eve umber of times. Therefore, q divides a eve umber of times, so is of the form metioed i part (b), ad is thus a sum of two iteger squares. 7. (a) We have x 3 Φ 3 (x) x + x +. x Hece ω ω. Now for ay complex umber a + bω, a + bω (a + bω)(a + bω) (a + bω)(a + bω ) a + b + ab(ω + ω ) a ab + b. So if M a ab + b a + bω ad N c cd + d d + cω, the is of the same form. MN (a + bω)(d + cω) ad + bcω + (ac + bd)ω ad + bc( ω ) + (ac + bd)ω (ad bc) (ad bc)(ac + bd bc) + (ac + bd bc) (b) Suppose p (mod 3) ad p a ab + b. The p a or p b, sice otherwise p a ab + b would be divisible by p. I fact, if p a the p a ab + b implies p b, so p b as well. Thus, p divides either a or b. Ayway, (a b) + 3b 4(a ab + b ) 0 (mod p), so ( a b ) 3 (mod p). b Therefore, 3 is a square mod p. But we ve show before (usig quadratic reciprocity) that 3 is a square mod p if ad oly if p 3 or p (mod 3), cotradictio. 8. (a) For p 3, we have trivially 3 ()( ) + ( ). Now suppose p (mod 3). We ll prove by iductio o p that p is of the form a ab + b. Assume we have prove this statemet for primes less tha p. (We ca tae as our base case 7 3 (3)() +.) We ow 3 is a square mod p, so let x be the solutio to x 3 (mod p), ad write x y for some y. The y satisfies y y + 0 (mod p). We ca tae y < p/, so y p p y + < + + < p. 4 3
4 Hece y y + p for some < p, ad we have i additio that > 0 sice y y + (y /) + 3/4 > 0. Now let m be the smallest positive iteger such that mp ca be writte i the form a ab + b. Note that by the above proof m < p, ad if m the we are doe. Assume, for the sae of cotradictio, that m >. Let mp a ab + b. We may assume that g gcd(a, b), else g m ad thus we ca divide a ad b by g to reduce m to m/g. Now let l be a prime dividig m. The l a or l b; say l b. As i Problem 7, we have ( a b ) 3 (mod l), b so l 3 or l (mod 3). First, suppose l 3. The we have a ab + b 0 (mod 3). Sice 3 caot divide both a ad b, it ca be easily checed that the oly possibility is that a (mod 3) ad b (mod 3) (or vice versa). The ( ) ( ) ( ) a + b ) ( a + b a b a b b a ab + ( m ) + p, so we have a smaller multiple of p, cotradictio. Therefore we must have l > 3. The x x + 0 (mod l) for x ab (mod l). Also, sice l m < p, by the iductive hypothesis l is of the form l c cd + d. Agai, we ca assume that l d, so y y + 0 (mod l) for y cd. Now x x + y y + (mod l), so (x y)(x + y ) 0 (mod l). Thus either x y (mod l) or x y (mod l). I the secod case, replacig (c, d) by (d c, d), we ote that (d c) (d c)d + d d cd + c l ad (d c)d cd y, so we may assume that x y (mod l). It follows that ab cd (mod l), so l ad bc. Now we showed i Problem 7 that (a ab + b )(c cd + d ) (ad bc) (ad bc)(ac + bd bc) + (ac + bd bc). The LHS ad the first two terms of the RHS are divisible by l. Thus, l ad + bd bc. Writig ad bc xl ad ac + bd bc yl, we ow have (mp)(l) x l xyl + y l. So ( m ) p x xy + y, l showig that m is ot miimal, cotradictio. Therefore every prime p (mod 3) ca be writte i the form a ab + b. (b) Oe directio is easy: suppose is positive ad every prime q (mod 3) divides to a eve power. We showed that 3 ad primes p (mod 3) are of the form a ab + b. Ad for q (mod 3), we have trivially that q q q is also of this form. Sice the set of umbers of the form a ab + b is closed uder multiplicatio, it follows that is of the form a ab + b for some itegers a, b. To prove the coverse, we first ote that if a ab + b the ( b a ) + 4 ( ) b > 0.
5 (We will exclude the case a b 0.) We ow proceed with iductio o. The base case is obvious. Suppose q (mod 3) divides 4. We claim that q a, b. Otherwise, without loss of geerality, assume that q b. The ( ) a b 3 (mod q), b 9. Computig, showig that 3 is a square mod q, which is impossible. So we ca write a a q, b b q, ad thus q (a a b + b ). By the iductive hypothesis, q divides a a b + b to a eve power, so it divides to a eve power as well. This completes the iductio / / / [7,, 6, 3, 34/5] [7,, 6, 3, 6, 5/4] [7,, 6, 3, 6,, 4] /5 5
6 Next, (3 + 5)/ /( 5 3) [3,, 6, [ ],... ] 3,, Taig the log of both sides, Differetiatig, so log si z log z + ( z ) log π. z cot z + π, z z π z cot z + z z π ( ) z π z π ( ) z z π π 0 z. π O the other had, we have x x r e x B r, r! r 0 6
7 ad pluggig i x iz, Taig the real part of this equatio, we get (iz) r iz B r r! e iz ize iz e iz e iz z cot z r 0 r eve iz(cos z i si z) i si z z cot z iz. B r (i) r r! z r ( ) B z ()! 0 ( ) B z. ()! Equatig the two expressios, ad taig the coefficiet of z, B ( ). ()! π So we coclude that ζ() ( ) B π. ()! 7
8 MIT OpeCourseWare Theory of Numbers Sprig 0 For iformatio about citig these materials or our Terms of Use, visit:
and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationMath 140A Elementary Analysis Homework Questions 1
Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationHomework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.
Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationThe Structure of Z p when p is Prime
LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z
More information+ au n+1 + bu n = 0.)
Lecture 6 Recurreces - kth order: u +k + a u +k +... a k u k 0 where a... a k are give costats, u 0... u k are startig coditios. (Simple case: u + au + + bu 0.) How to solve explicitly - first, write characteristic
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationMATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1
MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The
More informationSolutions to Problem Set 6
18.781 Solutios to Problem Set 6 1. Sice both sies are positive, it s eough to show their squares are the same. Now =, so. For a prime power p e, we have = = = = (). σ k (p e ) = 1 + p k + + p ek, which
More informationInduction proofs - practice! SOLUTIONS
Iductio proofs - practice! SOLUTIONS 1. Prove that f ) = 6 + + 15 is odd for all Z +. Base case: For = 1, f 1) = 41) + 1) + 13 = 19. Sice 19 is odd, f 1) is odd - base case prove. Iductive hypothesis:
More informationA detailed proof of the irrationality of π
Matthew Straugh Math 4 Midterm A detailed proof of the irratioality of The proof is due to Iva Nive (1947) ad essetial to the proof are Lemmas ad 3 due to Charles Hermite (18 s) First let us itroduce some
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationMath 2112 Solutions Assignment 5
Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationLecture 23 Rearrangement Inequality
Lecture 23 Rearragemet Iequality Holde Lee 6/4/ The Iequalities We start with a example Suppose there are four boxes cotaiig $0, $20, $50 ad $00 bills, respectively You may take 2 bills from oe box, 3
More informationBertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.
Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,
More informationDIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More informationCourse : Algebraic Combinatorics
Course 8.32: Algebraic Combiatorics Lecture Notes # Addedum by Gregg Musier February 4th - 6th, 2009 Recurrece Relatios ad Geeratig Fuctios Give a ifiite sequece of umbers, a geeratig fuctio is a compact
More information[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationInduction: Solutions
Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationSolutions to Problem Set 7
8.78 Solutios to Problem Set 7. If the umber is i S, we re doe sice it s relatively rime to everythig. So suose S. Break u the remaiig elemets ito airs {, }, {4, 5},..., {, + }. By the Pigeohole Pricile,
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationBasic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.
Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
More informationRead carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.
THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: Jauary 2009 Aalysis I Time Allowed:.5 hours Read carefully the istructios o the aswer book ad make sure that the particulars required are etered o each
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationCoffee Hour Problems of the Week (solutions)
Coffee Hour Problems of the Week (solutios) Edited by Matthew McMulle Otterbei Uiversity Fall 0 Week. Proposed by Matthew McMulle. A regular hexago with area 3 is iscribed i a circle. Fid the area of a
More informationMath 210A Homework 1
Math 0A Homework Edward Burkard Exercise. a) State the defiitio of a aalytic fuctio. b) What are the relatioships betwee aalytic fuctios ad the Cauchy-Riema equatios? Solutio. a) A fuctio f : G C is called
More informationPUTNAM TRAINING INEQUALITIES
PUTNAM TRAINING INEQUALITIES (Last updated: December, 207) Remark This is a list of exercises o iequalities Miguel A Lerma Exercises If a, b, c > 0, prove that (a 2 b + b 2 c + c 2 a)(ab 2 + bc 2 + ca
More informationObjective Mathematics
. If sum of '' terms of a sequece is give by S Tr ( )( ), the 4 5 67 r (d) 4 9 r is equal to : T. Let a, b, c be distict o-zero real umbers such that a, b, c are i harmoic progressio ad a, b, c are i arithmetic
More informationANSWERS SOLUTIONS iiii i. and 1. Thus, we have. i i i. i, A.
013 ΜΑΘ Natioal Covetio ANSWERS (1) C A A A B (6) B D D A B (11) C D D A A (16) D B A A C (1) D B C B C (6) D C B C C 1. We have SOLUTIONS 1 3 11 61 iiii 131161 i 013 013, C.. The powers of i cycle betwee
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,
More informationDe Moivre s Theorem - ALL
De Moivre s Theorem - ALL. Let x ad y be real umbers, ad be oe of the complex solutios of the equatio =. Evaluate: (a) + + ; (b) ( x + y)( x + y). [6]. (a) Sice is a complex umber which satisfies = 0,.
More informationa 2 +b 2 +c 2 ab+bc+ca.
All Problems o the Prize Exams Sprig 205 The source for each problem is listed below whe available; but eve whe the source is give, the formulatio of the problem may have bee chaged. Solutios for the problems
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationUSA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year
/3/27. Fill i each space of the grid with either a or a so that all sixtee strigs of four cosecutive umbers across ad dow are distict. You do ot eed to prove that your aswer is the oly oe possible; you
More informationSEQUENCE AND SERIES NCERT
9. Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a, a,..., etc., the subscript deotes the positio of the term. I view of
More information1+x 1 + α+x. x = 2(α x2 ) 1+x
Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem
More informationTHE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours
THE 06-07 KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: hours Let x, y, ad A all be positive itegers with x y a) Prove that there are
More informationHomework 2 January 19, 2006 Math 522. Direction: This homework is due on January 26, In order to receive full credit, answer
Homework 2 Jauary 9, 26 Math 522 Directio: This homework is due o Jauary 26, 26. I order to receive full credit, aswer each problem completely ad must show all work.. What is the set of the uits (that
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationBasic Sets. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4
Basic Sets Example 1. Let S = {1, {, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 False. Note that the elemets of S are 1, the set {, 3}, ad 4. Thus S = 3. (b) {1} S False. While 1
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More information1 lim. f(x) sin(nx)dx = 0. n sin(nx)dx
Problem A. Calculate ta(.) to 4 decimal places. Solutio: The power series for si(x)/ cos(x) is x + x 3 /3 + (2/5)x 5 +. Puttig x =. gives ta(.) =.3. Problem 2A. Let f : R R be a cotiuous fuctio. Show that
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationPROBLEMS AND SOLUTIONS 2
PROBEMS AND SOUTIONS Problem 5.:1 Statemet. Fid the solutio of { u tt = a u xx, x, t R, u(x, ) = f(x), u t (x, ) = g(x), i the followig cases: (b) f(x) = e x, g(x) = axe x, (d) f(x) = 1, g(x) =, (f) f(x)
More informationPROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).
PROBLEM SET 5 SOLUTIONS 1 Fid every iteger solutio to x 17x 5 0 mod 45 Solutio We rove that the give cogruece equatio has o solutios Suose for cotradictio that the equatio x 17x 5 0 mod 45 has a solutio
More informationRADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify
Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL
More informationSolutions for May. 3 x + 7 = 4 x x +
Solutios for May 493. Prove that there is a atural umber with the followig characteristics: a) it is a multiple of 007; b) the first four digits i its decimal represetatio are 009; c) the last four digits
More informationProblem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient
Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case
More informationLemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.
15 Cubics, Quartics ad Polygos It is iterestig to chase through the argumets of 14 ad see how this affects solvig polyomial equatios i specific examples We make a global assumptio that the characteristic
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationFUNCTIONAL EQUATIONS WITH PRIME ROOTS FROM ARITHMETIC EXPRESSIONS FOR. BARRY BRENT Efmhurst, New York 11373
FUNCTIONAL EQUATIONS WITH PRIME ROOTS FROM ARITHMETIC EXPRESSIONS FOR BARRY BRENT Efmhurst, New York 373. I this article, a geeralized form of Euler f s law cocerig the sigma fuctio will be obtaied ad
More informationSolutions to Final Exam Review Problems
. Let f(x) 4+x. Solutios to Fial Exam Review Problems Math 5C, Witer 2007 (a) Fid the Maclauri series for f(x), ad compute its radius of covergece. Solutio. f(x) 4( ( x/4)) ( x/4) ( ) 4 4 + x. Sice the
More informationDifferentiable Convex Functions
Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationANSWERSHEET (TOPIC = ALGEBRA) COLLECTION #2
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC ALGEBRA) COLLECTION # Questio Type A.Sigle Correct Type Q. (B) Sol ( 5 7 ) ( 5 7 9 )!!!! C
More informationMath 609/597: Cryptography 1
Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit
More informationSequences and Limits
Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q
More informationMath 132, Fall 2009 Exam 2: Solutions
Math 3, Fall 009 Exam : Solutios () a) ( poits) Determie for which positive real umbers p, is the followig improper itegral coverget, ad for which it is diverget. Evaluate the itegral for each value of
More informationInternational Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY
Iteratioal Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL TOPIC NUMBER THEORY METHODS OF PROOF. Couterexample - Cotradictio - Pigeohole Priciple Strog mathematical iductio 2 DIVISIBILITY....
More information5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define
5. Matrix expoetials ad Vo Neuma s theorem 5.1. The matrix expoetial. For a matrix X we defie e X = exp X = I + X + X2 2! +... = 0 X!. We assume that the etries are complex so that exp is well defied o
More informationWorksheet on Generating Functions
Worksheet o Geeratig Fuctios October 26, 205 This worksheet is adapted from otes/exercises by Nat Thiem. Derivatives of Geeratig Fuctios. If the sequece a 0, a, a 2,... has ordiary geeratig fuctio A(x,
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
More information= 4 and 4 is the principal cube root of 64.
Chapter Real Numbers ad Radicals Day 1: Roots ad Radicals A2TH SWBAT evaluate radicals of ay idex Do Now: Simplify the followig: a) 2 2 b) (-2) 2 c) -2 2 d) 8 2 e) (-8) 2 f) 5 g)(-5) Based o parts a ad
More informationExam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.
1 (1 poits) Circle T if the correspodig statemet is True or F if it is False T F For ay positive iteger,, GCD(, 1) = 1 T F Every positive iteger is either prime or composite T F If a b mod p, the (a/p)
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More informationMATH1035: Workbook Four M. Daws, 2009
MATH1035: Workbook Four M. Daws, 2009 Roots of uity A importat result which ca be proved by iductio is: De Moivre s theorem atural umber case: Let θ R ad N. The cosθ + i siθ = cosθ + i siθ. Proof: The
More informationFermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.
Departmet of Mathematical Scieces Istructor: Daiva Puciskaite Discrete Mathematics Fermat s Little Theorem 43.. For all a Z 3, calculate a 2 ad a 3. Case a = 0. 0 0 2-times Case a 0. 0 0 3-times a a 2-times
More informationSOLVING LINEAR RECURSIONS OVER ALL FIELDS
SOLVING LINEAR RECURSIONS OVER ALL FIELDS KEITH CONRAD 1. Itroductio A sequece {a } = a 0, a 1, a,... i a field K satisfies a liear recursio if there are c 1,..., c d K such that 1.1 a = c 1 a 1 + c a
More informationModern Algebra 1 Section 1 Assignment 1. Solution: We have to show that if you knock down any one domino, then it knocks down the one behind it.
Moder Algebra 1 Sectio 1 Assigmet 1 JOHN PERRY Eercise 1 (pg 11 Warm-up c) Suppose we have a ifiite row of domioes, set up o ed What sort of iductio argumet would covice us that ocig dow the first domio
More informationHomework 9. (n + 1)! = 1 1
. Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves
More informationLINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS
LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS BROTHER ALFRED BROUSSEAU St. Mary's College, Califoria Give a secod-order liear recursio relatio (.1) T. 1 = a T + b T 1,
More informationMathematics 170B Selected HW Solutions.
Mathematics 17B Selected HW Solutios. F 4. Suppose X is B(,p). (a)fidthemometgeeratigfuctiom (s)of(x p)/ p(1 p). Write q = 1 p. The MGF of X is (pe s + q), sice X ca be writte as the sum of idepedet Beroulli
More informationMath 61CM - Solutions to homework 1
Math 61CM - Solutios to homework 1 Cédric De Groote October 1 st, 2018 Problem 1: Use mathematical iductio to check the validity of the formula j 3 = 2 ( + 1) 2 for = 1, 2,.... Note: The priciple of mathematical
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationMIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS
MIDTERM 3 CALCULUS MATH 300 FALL 08 Moday, December 3, 08 5:5 PM to 6:45 PM Name PRACTICE EXAM S Please aswer all of the questios, ad show your work. You must explai your aswers to get credit. You will
More informationLESSON 2: SIMPLIFYING RADICALS
High School: Workig with Epressios LESSON : SIMPLIFYING RADICALS N.RN.. C N.RN.. B 5 5 C t t t t t E a b a a b N.RN.. 4 6 N.RN. 4. N.RN. 5. N.RN. 6. 7 8 N.RN. 7. A 7 N.RN. 8. 6 80 448 4 5 6 48 00 6 6 6
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 21: Primal Barrier Interior Point Algorithm
508J/65J Itroductio to Mathematical Programmig Lecture : Primal Barrier Iterior Poit Algorithm Outlie Barrier Methods Slide The Cetral Path 3 Approximatig the Cetral Path 4 The Primal Barrier Algorithm
More information