Part II FINAL PART -B

Size: px
Start display at page:

Download "Part II FINAL PART -B"

Transcription

1 Part II FINAL Branch 1(A) - Mathematics Paper I - FINITE MATHEMATICS AND GALOIS THEORY PART -A 1. Find the coefficient of xk, k ~ 18 in the expansion of + X r. 2. Find the number of primes between 2 and 48 inclusive. 3. Prove that every connected graph contains a spanning tree. 4. If G is a Hamiltonian then prove that for every nonempty proper subset S of V, w(g-s)!~isj. 5. State and prove Gauss lemma. 6. Prove that the degree of the extension of the splitting field of x 3 2 QE xj is Let. F be a field of characteristic * 2. Let x 2 - a F [ x ] be an 'irreducible polynomial over F. Then prove that its Galois group is of order Prove that the Galois group of x4 +X2 +1 is the same as that of x 6 1 and is of order 2. PART -B Answer ONE question from each Unit. Each question carries 15 marks.. (Marks :4x 15= 60) UNIT I 9. (a) Show that S(rn)= S(r - 1,n - i)+ ns(r - 1,n) where r,n E N with r 2! n. (b) Solve the system of recurrence relations a + 2a_1-4b,, = 0 b,, + 5a..1-7b,, 1 = 0 Given that a1 =4 and b 1 =1. UNIT IV 15. State and prove fundamental theorem of Galois theory. 16. (a) Let F be a field and let U be a finite subgroup of the multiplicative group F* F M. Then prove that U is cyclic. (b) Let E be the splitting field of x" a e F[x]. Then prove that G(E I F) is a solvable group.

2 Part II Final Branch I (A) Mathematics Paper II TOPOLOGY AND FUNCTIONAL ANALYSIS P A R T A 1. Show that any intersection of closed sets in a topological space Xis closed. 2. Show that every separable metric space is second countable. 3. Show that every sequentially compact metric space is totally bounded. 4. Show that any continuous image of a connected space is connected. 5. Let N be a non-zero normed linear space and prove that N is' a 13anach space iff E I = 1 } is complete. 6. If P is a projection on a Banach space B and if M and N are its range and null space, then show that'm and N are closed linear subspaces of B such that B = M N. 7. Show that a closed convex subset C of a Hilbert space H contains a unique vector of smallest norm. 8. If A/ and A, are self-adjoint operators on H, then their product A.1.42 is self-adjoint iff A1A2 = A2A1. PART B Answer ONE question from each Unit. Each question carries 15 marks. (Marks : 4 x 15 = 60) UNIT I 9. (a) If f and g are continuous real or complex functions on a topological space X then show that f v g and f A g are continuous. (b) State and prove Liondelofs theorem. 10. (a) State and prove Heine-Borel theorem. (b) Show that every sequentially compact metric space is compact. UNIT II 11. State and prove Uryshon's lemma. 12. State and prove Ascolis theorem.

3 13. State and prove Hahn-Banach theorem State and prove closed graph theorem. UNIT IIT (Jr UNIT IV 15. (a) If N and N' are normed linear spaces, then the set BV\ r, N') of all continuous linear transformation of N into N' is itself a normed linear space with. respect to the pointwise linear operation and the norm defined by TI,SudiTx11/11x1k1}. If N' is a Banach space then show that B(N, N') is also a Banach space. (b) Prove that the adjoint operation T T' or B(1I) has the following properties. ) (T, +T 2 )' = T: (ii) (dr = (Ti = T2-7. 1, (iv) T =T (v) 11T 1=111 (vi) ; IT-TI 16. (a) Define a normal operator. If NI and N 2 are normal operators on II with the property that either commutes with the adjoint of the other then show that N 1 4- N, and N, N. are normal. (b) If P and Q are the projections on closed linear subspaces Al and.1\i' of H, then show that M I N PQ = 0 = 0.

4 Part II Final Branch I (A) - Mathematics Paper III - OPERATIONS RESEARCH P A R T A 1. Explain the linear programming problem giving two examples. 2. Explain the use of artificial in L.P. 3. What is a balanced transportation problem? What are its applications? 4. Explain the difference between a transportation problem and an assignment problem. 5. Explain the advantages and disadvantages of dynamic programming. 6. What is a non-linear programming problem and give the general form of NLPP? 7. What is queuing theory? What are the limitations of queuing theory? 8. Enumerate the various types of inventory models. PART B Answer ONE question from each Unit. Each question carries 15 marks. (Marks: 4 x 15 = 60) UNIT - I 9. (a) Explain the Big M method to solve L.P.P (b) Use penalty method to Maximize z =x1 +2X2+ 3x3 -x4 Subject to the constraints Xi+ 2x2 + 3x3 = 15 2x x3 = 20 x1+2x2+x3+x4 =10 x11x21x1x4 >O.

5 10. (a) Explain two phase simplex method to solve L.P.P. (b) Use two-phase simplex method to Maximize z = 3x 1 - x2 Subject to the constraints 2x 1 + x2?, 2 x +3x,, < 2.<1.-4,xpx, O.. '". UNIT -II 11. (a) Explain 'Vogel's approximation method to solve L.P.P. (b) By using above method obtain an initial basic feasible solution of the transportation problem D E F G Available A ` C l _, 400 D e m an d (a) Explain the North-West cornermethod to solve L.P.P. (b) Obtain an initial basic feasible solutions to the following transportation problem using the North-West corner rule. D E F G Available A I I Requirement U N I T -I l l 13. (a) What are the basic features and applications of dynamic programming? (b) Use dynamic programming to solve the L.P.P. Maximize z = 3x x 2 Subject to the constraint x I + 4 x 2 X.5_ 2 and x > 0 > 0 ".-2

6 14. (a) Explain the significance of lagrange multipliers. (b) Solve by using lagrangian multipliers Maximize z = 4x1 +6x9 2x1,x2 2x92 Subject to the constraints + 2x, =2 andx1,x2 O. UNIT IV 15. Determine the steady state solution of the queuing models. (a) (M/M/1X./FCFS) (b) (M/M/I) (N/FCFS) and obtain the average queue length in each tsable. 16. (a) Derive the E0Q formula for the manufacturing model without shortages. (b) An item is produced at the rate of 50 items per day. The demand occurs at the rate of 25 items per day. If the set up cost is Rs. 100 and holiday cost is Re unit of item per day. Find the economic lot size for one run, assuming that the shortages are not permitted. Also find the time of cycle and minimum total cost for one run.

7 Part II - Final Branch I (A) - Mathematics Paper IV - NUMBER THEORY PART A 1. If f and g are multiplicative, then prove that their Dirichiet product f * g is also multiplicative. 2. Show that 1 (mod in), if (a, in) = If x > 1 prove that I= logx + C +0 ~1). n:5x 4. Show that lirn1 - H ( x ) = 0. X xlogx1 5. If A is the conjugate transpose of the matrix A, then prove that AA = ni, where I is the ii x n identity matrix. 6. Show that there are infinitely many primes of the form If S ( n ) = f(d)gij where f and g are multiplicative, then prove that d(n,k) S,(ab) = S..., WS,, (b), whenever (a, k) = (b, m) = Let x be an odd integer. If a ~: 3, prove that x 22 1 (mod 2). PART - B Answer ONE question from each Unit. Each question carries 15 marks. (Marks: 4 x 15 = 60) 9. (a) If 1, prove thatç o ( d ) = n. UNIT I rifr (b) State and prove the Selberg identity (a) State and prove Chinese remainder theorem. (b) Show that the lattice points in the plane visible from the origin contains arbitrarily large square gaps.

8 UNIT H 11. State and prove Eu]er's summation formula. 12. For every integer n 2. prove that n <11 <. G log72 tog /I UNIT 1.3. Show that a finite abelian group G of order n has exactly 77. distinct characters. 14. (a. ) Prove that there are infinitely many primes of the form e l. n. -,-- 1. (b) For x >1, prove that. lotg p 1, 1. e.,,,i, N-- -- = -- iof,, - x -2., ( p) log p - I - V -- + L.--,. / 7.(h)I. ' - I./ ( L ). pfi. x P (p(h) - q ) ( k ),,ff-, 2 p-_,:x P p... h (modk) UNIT IV 15. (a) if p is an odd prime, then for all 11 show that (nip) n IP (mod p). (b) Ifp and q are distinct odd primes, then prove that (p 1 q)(q I p)=( 16. (a) State and prove Lagrange's interpolation theorem. (b) If p is an odd prime and a 1, prove that there exist odd primitive roots olmodulo p" and each such g is also a primitive root modulo 2 p'.

9 Part II- Final Branch I(A) - Mathematics Paper V MATHEMATICAL STATISTICS PART - A Answer any FOUR questions. Each question carries 5 marks. (Marks : 4 x5 = 20) 1. Let X be a random variable with p.d.f. f(x), 0 <x < g and zero otherwise. Find g 2, the pdf of Y = sin x. 2. Let X and Y have the p.d.f f(x,y)=x+y; 0 <x< 1, 0 <y< 1 and zero elsewhere, find E(XY2). 3. Let X be n(5,10). Find Pr[0.04 < (X - 5) 2 <38.4j. 4. Let T have a t distribution with 14 degrees of freedom. Determine b so that Pr(-b <T <b)= Let P = 0.95 be the probability that a man, in a certain age group lives atleast 5 years. If we are to observe 60 such men and if we assume independence, find the probability that atleast 56 of them live 4 or more years. 6. Let the observed value of the mean X of a random sample of size 20 from a distribution that is n 80) be Find a 95 percent confidence interval for,u 7. Let X 1,X 9,... X n be a random sample of size n from a geometric distribution that has p.d.f f(x;0)= - 6 0, x 0, 1, < 0 <1 and zero elsewhere. Show that 1- :X is a sufficient statistic for Show that the mean X of a random sample of size ti from a distribution which is b(1,0), 0 <0 <1 is an efficient estimator of 0.

10 PART B Answer ONE question from each Unit. Each question carries 15 marks. (Marks :4x15=60) UNIT (a) Let X and Y have the p.d.f. fx,y) = 1, 0 <x <1, 0 < <1 and zero elsewhere. Find the p.d.f of the product Z XY (b) Let 1(x) =, x = 1,2,3... and zero elsewhere, be the p.d..f of the random variable X. Find the moment generating, the mean and the variance of K. 10. (a) Show that the random variables K3 and K2 with joint p.d.f. fx1,x2) = 12x1x2(1 x2), 0 <x1 <1, 0 <x2 <1 and zero elsewhere, are Stochastically independent. (b) Find Pr <K1 <, 0< K2 <J if the random variables K1 and K2 havethe, joint p.d. ffx1,x9) = 4 x 1(i'- x 2),0<x3 <1, 0<x., <1 and zero elsewhere. UNIT Il 11. (a) Find the moment-generating function of a ganmia distribution and deduce mean and variance. (b) If X has a gamma distribution with a = 3 and fi = 4 find Pr(3.28 <X< 25.2). 12. (a). Find, the mean and variance of a normal distribution. (b) if K is the mean of a random sample of size n from a normal distribution with mean je and variance 100, 'find ii SO that, Pr - 5 <X <u -' 5) = UNIT - flj 13. (a) Let X3,X2...X, denote the items of a random sample from a distribution that has mean ft and positive variance a 2. Then prove that the random variable = I x1. -'- has a limiting distribution that is normal with. mean zero and variance 1. (b) Let X denote the mean of a raridorn sample of size n from a distribution that is 17.U,a 2 ). Find the limiting distribution of X 2

11 14. (a) If 8.6, 7.9, 8.3, 6.4, 8.4, 9.8, 7.2, 7.8, 7.5 are the observed values of a random sample of size. 9 from a distribution that is n(8, c 2 ), construct a 90 percent confidence interval for a2. (b) Let Xi,X2... X represent a random sample for the probability density function f (x; 0) = 0 x -1, 0 <x <1, 0 < and zero elsewhere. Find the maximum likely hood estimator 8 of 8. UNIT -IV 15. State and prove Neymann-Pearson theorem. 16. State and prove Rao-Blackwell theorem.

ASSIGNMENT - 1, DEC M.Sc. (FINAL) SECOND YEAR DEGREE MATHEMATICS. Maximum : 20 MARKS Answer ALL questions. is also a topology on X.

ASSIGNMENT - 1, DEC M.Sc. (FINAL) SECOND YEAR DEGREE MATHEMATICS. Maximum : 20 MARKS Answer ALL questions. is also a topology on X. (DM 21) ASSIGNMENT - 1, DEC-2013. PAPER - I : TOPOLOGY AND FUNCTIONAL ANALYSIS Maimum : 20 MARKS 1. (a) Prove that every separable metric space is second countable. Define a topological space. If T 1 and

More information

1. Group Theory Permutations.

1. Group Theory Permutations. 1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7

More information

MATHEMATICS. Course Syllabus. Section A: Linear Algebra. Subject Code: MA. Course Structure. Ordinary Differential Equations

MATHEMATICS. Course Syllabus. Section A: Linear Algebra. Subject Code: MA. Course Structure. Ordinary Differential Equations MATHEMATICS Subject Code: MA Course Structure Sections/Units Section A Section B Section C Linear Algebra Complex Analysis Real Analysis Topics Section D Section E Section F Section G Section H Section

More information

Galois theory (Part II)( ) Example Sheet 1

Galois theory (Part II)( ) Example Sheet 1 Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that

More information

Real Analysis Prelim Questions Day 1 August 27, 2013

Real Analysis Prelim Questions Day 1 August 27, 2013 Real Analysis Prelim Questions Day 1 August 27, 2013 are 5 questions. TIME LIMIT: 3 hours Instructions: Measure and measurable refer to Lebesgue measure µ n on R n, and M(R n ) is the collection of measurable

More information

118 PU Ph D Mathematics

118 PU Ph D Mathematics 118 PU Ph D Mathematics 1 of 100 146 PU_2016_118_E The function fz = z is:- not differentiable anywhere differentiable on real axis differentiable only at the origin differentiable everywhere 2 of 100

More information

Part II. Number Theory. Year

Part II. Number Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

More information

2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2

2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2 1 A Good Spectral Theorem c1996, Paul Garrett, garrett@math.umn.edu version February 12, 1996 1 Measurable Hilbert bundles Measurable Banach bundles Direct integrals of Hilbert spaces Trivializing Hilbert

More information

Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay 1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together

More information

Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA

Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA #A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department

More information

Problem 4 (Wed Jan 29) Let G be a finite abelian group. Prove that the following are equivalent

Problem 4 (Wed Jan 29) Let G be a finite abelian group. Prove that the following are equivalent Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Problem 1 (Fri Jan 24) (a) Find an integer x such that x = 6 mod 10 and x = 15 mod 21 and 0 x 210. (b) Find the smallest positive integer

More information

Algebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001

Algebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001 Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,

More information

MAT 578 FUNCTIONAL ANALYSIS EXERCISES

MAT 578 FUNCTIONAL ANALYSIS EXERCISES MAT 578 FUNCTIONAL ANALYSIS EXERCISES JOHN QUIGG Exercise 1. Prove that if A is bounded in a topological vector space, then for every neighborhood V of 0 there exists c > 0 such that tv A for all t > c.

More information

Course 2316 Sample Paper 1

Course 2316 Sample Paper 1 Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity

More information

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem 56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

Lecture 8: Finite fields

Lecture 8: Finite fields Lecture 8: Finite fields Rajat Mittal IIT Kanpur We have learnt about groups, rings, integral domains and fields till now. Fields have the maximum required properties and hence many nice theorems can be

More information

Name: Solutions Final Exam

Name: Solutions Final Exam Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] For

More information

Mathematics for Cryptography

Mathematics for Cryptography Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1

More information

May 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.

May 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated

More information

Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35

Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)

More information

Groups and Symmetries

Groups and Symmetries Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group

More information

A connection between number theory and linear algebra

A connection between number theory and linear algebra A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.

More information

Ph.D. Qualifying Exam: Algebra I

Ph.D. Qualifying Exam: Algebra I Ph.D. Qualifying Exam: Algebra I 1. Let F q be the finite field of order q. Let G = GL n (F q ), which is the group of n n invertible matrices with the entries in F q. Compute the order of the group G

More information

ALGEBRA EXERCISES, PhD EXAMINATION LEVEL

ALGEBRA EXERCISES, PhD EXAMINATION LEVEL ALGEBRA EXERCISES, PhD EXAMINATION LEVEL 1. Suppose that G is a finite group. (a) Prove that if G is nilpotent, and H is any proper subgroup, then H is a proper subgroup of its normalizer. (b) Use (a)

More information

Page Points Possible Points. Total 200

Page Points Possible Points. Total 200 Instructions: 1. The point value of each exercise occurs adjacent to the problem. 2. No books or notes or calculators are allowed. Page Points Possible Points 2 20 3 20 4 18 5 18 6 24 7 18 8 24 9 20 10

More information

Problem Set 6: Solutions Math 201A: Fall a n x n,

Problem Set 6: Solutions Math 201A: Fall a n x n, Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series

More information

Compact operators on Banach spaces

Compact operators on Banach spaces Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact

More information

List of Symbols, Notations and Data

List of Symbols, Notations and Data List of Symbols, Notations and Data, : Binomial distribution with trials and success probability ; 1,2, and 0, 1, : Uniform distribution on the interval,,, : Normal distribution with mean and variance,,,

More information

Convex Feasibility Problems

Convex Feasibility Problems Laureate Prof. Jonathan Borwein with Matthew Tam http://carma.newcastle.edu.au/drmethods/paseky.html Spring School on Variational Analysis VI Paseky nad Jizerou, April 19 25, 2015 Last Revised: May 6,

More information

TEST CODE: PMB SYLLABUS

TEST CODE: PMB SYLLABUS TEST CODE: PMB SYLLABUS Convergence and divergence of sequence and series; Cauchy sequence and completeness; Bolzano-Weierstrass theorem; continuity, uniform continuity, differentiability; directional

More information

Ultraproducts of Finite Groups

Ultraproducts of Finite Groups Ultraproducts of Finite Groups Ben Reid May 11, 010 1 Background 1.1 Ultrafilters Let S be any set, and let P (S) denote the power set of S. We then call ψ P (S) a filter over S if the following conditions

More information

Syllabuses for Honor Courses. Algebra I & II

Syllabuses for Honor Courses. Algebra I & II Syllabuses for Honor Courses Algebra I & II Algebra is a fundamental part of the language of mathematics. Algebraic methods are used in all areas of mathematics. We will fully develop all the key concepts.

More information

Congruent Number Problem and Elliptic curves

Congruent Number Problem and Elliptic curves Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using

More information

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

Homework 10 M 373K by Mark Lindberg (mal4549)

Homework 10 M 373K by Mark Lindberg (mal4549) Homework 10 M 373K by Mark Lindberg (mal4549) 1. Artin, Chapter 11, Exercise 1.1. Prove that 7 + 3 2 and 3 + 5 are algebraic numbers. To do this, we must provide a polynomial with integer coefficients

More information

ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008

ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely

More information

SPECIAL CASES OF THE CLASS NUMBER FORMULA

SPECIAL CASES OF THE CLASS NUMBER FORMULA SPECIAL CASES OF THE CLASS NUMBER FORMULA What we know from last time regarding general theory: Each quadratic extension K of Q has an associated discriminant D K (which uniquely determines K), and an

More information

An introduction to some aspects of functional analysis

An introduction to some aspects of functional analysis An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms

More information

Algebra Qualifying Exam August 2001 Do all 5 problems. 1. Let G be afinite group of order 504 = 23 32 7. a. Show that G cannot be isomorphic to a subgroup of the alternating group Alt 7. (5 points) b.

More information

q xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.

q xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation. Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both

More information

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)

More information

ON THE ENERGY DECAY OF TWO COUPLED STRINGS THROUGH A JOINT DAMPER

ON THE ENERGY DECAY OF TWO COUPLED STRINGS THROUGH A JOINT DAMPER Journal of Sound and Vibration (997) 203(3), 447 455 ON THE ENERGY DECAY OF TWO COUPLED STRINGS THROUGH A JOINT DAMPER Department of Mechanical and Automation Engineering, The Chinese University of Hong

More information

1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0

1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0 4 INUTES. If, ω, ω, -----, ω 9 are the th roots of unity, then ( + ω) ( + ω ) ----- ( + ω 9 ) is B) D) 5. i If - i = a + ib, then a =, b = B) a =, b = a =, b = D) a =, b= 3. Find the integral values for

More information

List of topics for the preliminary exam in algebra

List of topics for the preliminary exam in algebra List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.

More information

1 Fields and vector spaces

1 Fields and vector spaces 1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary

More information

Discrete Math, Second Problem Set (June 24)

Discrete Math, Second Problem Set (June 24) Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have

More information

Analysis Qualifying Exam

Analysis Qualifying Exam Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,

More information

1 Finite abelian groups

1 Finite abelian groups Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Each Problem is due one week from the date it is assigned. Do not hand them in early. Please put them on the desk in front of the room

More information

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter

More information

Finite Fields. [Parts from Chapter 16. Also applications of FTGT]

Finite Fields. [Parts from Chapter 16. Also applications of FTGT] Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory

More information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

Algebra Qualifying Exam, Fall 2018

Algebra Qualifying Exam, Fall 2018 Algebra Qualifying Exam, Fall 2018 Name: Student ID: Instructions: Show all work clearly and in order. Use full sentences in your proofs and solutions. All answers count. In this exam, you may use the

More information

Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.

Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. Minimization Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. 1 Minimization A Topological Result. Let S be a topological

More information

NOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017

NOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017 NOTES ON VECTOR-VALUED INTEGRATION MATH 58, SPRING 207 Throughout, X will denote a Banach space. Definition 0.. Let ϕ(s) : X be a continuous function from a compact Jordan region R n to a Banach space

More information

CHAPTER 14. Ideals and Factor Rings

CHAPTER 14. Ideals and Factor Rings CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements

More information

Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography

Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups

More information

The primitive root theorem

The primitive root theorem The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under

More information

Ideals: Definitions & Examples

Ideals: Definitions & Examples Ideals: Definitions & Examples Defn: An ideal I of a commutative ring R is a subset of R such that for a, b I and r R we have a + b, a b, ra I Examples: All ideals of Z have form nz = (n) = {..., n, 0,

More information

Homogeneous Coordinate Ring

Homogeneous Coordinate Ring Students: Kaiserslautern University Algebraic Group June 14, 2013 Outline Quotients in Algebraic Geometry 1 Quotients in Algebraic Geometry 2 3 4 Outline Quotients in Algebraic Geometry 1 Quotients in

More information

Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications

Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications 1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the

More information

Overview of normed linear spaces

Overview of normed linear spaces 20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural

More information

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is

More information

Math 312/ AMS 351 (Fall 17) Sample Questions for Final

Math 312/ AMS 351 (Fall 17) Sample Questions for Final Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply

More information

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

φ(xy) = (xy) n = x n y n = φ(x)φ(y) Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =

More information

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition).

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 2.1 Exercise (6). Let G be an abelian group. Prove that T = {g G g < } is a subgroup of G.

More information

Lattice Theory Lecture 4. Non-distributive lattices

Lattice Theory Lecture 4. Non-distributive lattices Lattice Theory Lecture 4 Non-distributive lattices John Harding New Mexico State University www.math.nmsu.edu/ JohnHarding.html jharding@nmsu.edu Toulouse, July 2017 Introduction Here we mostly consider

More information

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups

More information

FUNCTIONAL ANALYSIS HAHN-BANACH THEOREM. F (m 2 ) + α m 2 + x 0

FUNCTIONAL ANALYSIS HAHN-BANACH THEOREM. F (m 2 ) + α m 2 + x 0 FUNCTIONAL ANALYSIS HAHN-BANACH THEOREM If M is a linear subspace of a normal linear space X and if F is a bounded linear functional on M then F can be extended to M + [x 0 ] without changing its norm.

More information

A few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in

A few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in A few exercises 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in F 2 [x]. solution. Since f(x) is a primitive polynomial in Z[x], by Gauss lemma it is enough

More information

A BRIEF INTRODUCTION TO LOCAL FIELDS

A BRIEF INTRODUCTION TO LOCAL FIELDS A BRIEF INTRODUCTION TO LOCAL FIELDS TOM WESTON The purpose of these notes is to give a survey of the basic Galois theory of local fields and number fields. We cover much of the same material as [2, Chapters

More information

Problem 1A. Use residues to compute. dx x

Problem 1A. Use residues to compute. dx x Problem 1A. A non-empty metric space X is said to be connected if it is not the union of two non-empty disjoint open subsets, and is said to be path-connected if for every two points a, b there is a continuous

More information

School of Mathematics

School of Mathematics School of Mathematics Programmes in the School of Mathematics Programmes including Mathematics Final Examination Final Examination 06 22498 MSM3P05 Level H Number Theory 06 16214 MSM4P05 Level M Number

More information

NOTES FOR DRAGOS: MATH 210 CLASS 12, THURS. FEB. 22

NOTES FOR DRAGOS: MATH 210 CLASS 12, THURS. FEB. 22 NOTES FOR DRAGOS: MATH 210 CLASS 12, THURS. FEB. 22 RAVI VAKIL Hi Dragos The class is in 381-T, 1:15 2:30. This is the very end of Galois theory; you ll also start commutative ring theory. Tell them: midterm

More information

Exercises on chapter 1

Exercises on chapter 1 Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G

More information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon

More information

Public-key Cryptography: Theory and Practice

Public-key Cryptography: Theory and Practice Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues

More information

Apprentice Linear Algebra, 1st day, 6/27/05

Apprentice Linear Algebra, 1st day, 6/27/05 Apprentice Linear Algebra, 1st day, 6/7/05 REU 005 Instructor: László Babai Scribe: Eric Patterson Definitions 1.1. An abelian group is a set G with the following properties: (i) ( a, b G)(!a + b G) (ii)

More information

Syllabus for M.Phil. /Ph.D. Entrance examination in Applied Mathematics PART-A

Syllabus for M.Phil. /Ph.D. Entrance examination in Applied Mathematics PART-A DEPARTMENT OF APPLIED MATHEMATICS GITAM INSTITUTE OF SCIENCE GANDHI INSTITUTE OF TECHNOLOGY AND MANAGEMENT (GITAM) (Declared as Deemed to be University u/s 3 of the UGC Act, 1956) Syllabus for M.Phil.

More information

Real Analysis. Jesse Peterson

Real Analysis. Jesse Peterson Real Analysis Jesse Peterson February 1, 2017 2 Contents 1 Preliminaries 7 1.1 Sets.................................. 7 1.1.1 Countability......................... 8 1.1.2 Transfinite induction.....................

More information

ULTRAFILTER AND HINDMAN S THEOREM

ULTRAFILTER AND HINDMAN S THEOREM ULTRAFILTER AND HINDMAN S THEOREM GUANYU ZHOU Abstract. In this paper, we present various results of Ramsey Theory, including Schur s Theorem and Hindman s Theorem. With the focus on the proof of Hindman

More information

STAT 7032 Probability Spring Wlodek Bryc

STAT 7032 Probability Spring Wlodek Bryc STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,

More information

Convexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.

Convexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ. Convexity in R n Let E be a convex subset of R n. A function f : E (, ] is convex iff f(tx + (1 t)y) (1 t)f(x) + tf(y) x, y E, t [0, 1]. A similar definition holds in any vector space. A topology is needed

More information

ALGEBRA PH.D. QUALIFYING EXAM SOLUTIONS October 20, 2011

ALGEBRA PH.D. QUALIFYING EXAM SOLUTIONS October 20, 2011 ALGEBRA PH.D. QUALIFYING EXAM SOLUTIONS October 20, 2011 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved

More information

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that

More information

Name :. Roll No. :... Invigilator s Signature :.. CS/B.TECH (NEW)(CSE/IT)/SEM-4/M-401/ MATHEMATICS - III

Name :. Roll No. :... Invigilator s Signature :.. CS/B.TECH (NEW)(CSE/IT)/SEM-4/M-401/ MATHEMATICS - III Name :. Roll No. :..... Invigilator s Signature :.. 202 MATHEMATICS - III Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers

More information

2.2 Annihilators, complemented subspaces

2.2 Annihilators, complemented subspaces 34CHAPTER 2. WEAK TOPOLOGIES, REFLEXIVITY, ADJOINT OPERATORS 2.2 Annihilators, complemented subspaces Definition 2.2.1. [Annihilators, Pre-Annihilators] Assume X is a Banach space. Let M X and N X. We

More information

Graduate Preliminary Examination

Graduate Preliminary Examination Graduate Preliminary Examination Algebra II 18.2.2005: 3 hours Problem 1. Prove or give a counter-example to the following statement: If M/L and L/K are algebraic extensions of fields, then M/K is algebraic.

More information

Algebra Exam, Spring 2017

Algebra Exam, Spring 2017 Algebra Exam, Spring 2017 There are 5 problems, some with several parts. Easier parts count for less than harder ones, but each part counts. Each part may be assumed in later parts and problems. Unjustified

More information

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is

More information

9. Finite fields. 1. Uniqueness

9. Finite fields. 1. Uniqueness 9. Finite fields 9.1 Uniqueness 9.2 Frobenius automorphisms 9.3 Counting irreducibles 1. Uniqueness Among other things, the following result justifies speaking of the field with p n elements (for prime

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

Quasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012

Quasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012 Quasi-cyclic codes Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico

More information

GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.

GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,

More information

E.J. Barbeau. Polynomials. With 36 Illustrations. Springer

E.J. Barbeau. Polynomials. With 36 Illustrations. Springer E.J. Barbeau Polynomials With 36 Illustrations Springer Contents Preface Acknowledgment of Problem Sources vii xiii 1 Fundamentals 1 /l.l The Anatomy of a Polynomial of a Single Variable 1 1.1.5 Multiplication

More information

ORAL QUALIFYING EXAM QUESTIONS. 1. Algebra

ORAL QUALIFYING EXAM QUESTIONS. 1. Algebra ORAL QUALIFYING EXAM QUESTIONS JOHN VOIGHT Below are some questions that I have asked on oral qualifying exams (starting in fall 2015). 1.1. Core questions. 1. Algebra (1) Let R be a noetherian (commutative)

More information

Real Analysis Qualifying Exam May 14th 2016

Real Analysis Qualifying Exam May 14th 2016 Real Analysis Qualifying Exam May 4th 26 Solve 8 out of 2 problems. () Prove the Banach contraction principle: Let T be a mapping from a complete metric space X into itself such that d(tx,ty) apple qd(x,

More information

MATH 310 Course Objectives

MATH 310 Course Objectives MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply

More information