The 66th William Lowell Putnam Mathematical Competition Saturday, December 3, 2005
|
|
- Isabel McCarthy
- 6 years ago
- Views:
Transcription
1 The 66th William Lowell Putnam Mathematical Competition Saturday, December 3, 5 A Show that every positive integer is a sum of one or more numbers of the form r 3 s, where r and s are nonnegative integers and no summand divides another. (For example, A Let S {(a, b a,,..., n, b,, 3}. A rook tour of S is a polygonal path made up of line segments connecting points p, p,..., p 3n in sequence such that (i p i S, (ii p i and p i+ are a unit distance apart, for i < 3n, (iii for each p S there is a unique i such that p i p. How many rook tours are there that begin at (, and end at (n,? (An example of such a rook tour for n 5 was depicted in the original. A3 Let p(z be a polynomial of degree n, all of whose zeros have absolute value in the complex plane. Put g(z p(z/z n/. Show that all zeros of g (z have absolute value. A4 Let H be an n n matrix all of whose entries are ± and whose rows are mutually orthogonal. Suppose H has an a b submatrix whose entries are all. Show that ab n. A5 Evaluate ln(x + x + dx. A6 Let n be given, n 4, and suppose that P, P,..., P n are n randomly, independently and uniformly, chosen points on a circle. Consider the convex n-gon whose vertices are P i. What is the probability that at least one of the vertex angles of this polygon is acute? B Find a nonzero polynomial P (x, y such that P ( a, a for all real numbers a. (Note: ν is the greatest integer less than or equal to ν. B Find all positive integers n, k,..., k n such that k + + k n 5n 4 and + +. k k n B3 Find all differentiable functions f : (, (, for which there is a positive real number a such that ( f a x x f(x for all x >. B4 For positive integers m and n, let f(m, n denote the number of n-tuples (x, x,..., x n of integers such that x + x + + x n m. Show that f(m, n f(n, m. B5 Let P (x,..., x n denote a polynomial with real coefficients in the variables x,..., x n, and suppose that ( x + + x P (x,..., x n n and that x + + x n divides P (x,..., x n. Show that P identically. (identically B6 Let S n denote the set of all permutations of the numbers,,..., n. For π S n, let σ(π if π is an even permutation and σ(π if π is an odd permutation. Also, let ν(π denote the number of fixed points of π. Show that σ(π ν(π + n ( n+ n +.
2 Solutions to the 66th William Lowell Putnam Mathematical Competition Saturday, December 3, 5 Manjul Bhargava, Kiran Kedlaya, and Lenny Ng A We proceed by induction, with base case 3. Suppose all integers less than n can be represented. If n is even, then we can take a representation of n/ and multiply each term by to obtain a representation of n. If n is odd, put m log 3 n, so that 3 m n < 3 m+. If 3 m n, we are done. Otherwise, choose a representation (n 3 m / s + +s k in the desired form. Then n 3 m + s + + s k, and clearly none of the s i divide each other or 3 m. Moreover, since s i n 3 m < 3 m+ 3 m, we have s i < 3 m, so 3 m cannot divide s i either. Thus n has a representation of the desired form in all cases, completing the induction. Remarks: This problem is originally due to Paul Erdős. Note that the representations need not be unique: for instance, A We will assume n hereafter, since the answer is for n. First solution: We show that the set of rook tours from (, to (n, is in bijection with the set of subsets of {,,..., n} that include n and contain an even number of elements in total. Since the latter set evidently contains n elements, so does the former. We now construct the bijection. Given a rook tour P from (, to (n,, let S S(P denote the set of all i {,,..., n} for which there is either a directed edge from (i, to (i, or from (i, 3 to (i,. It is clear that this set S includes n and must contain an even number of elements. Conversely, given a subset S {a, a,..., a r n} {,,..., n} of this type with a < a < < a r, we notice that there is a unique path P containing (a i, + ( i, (a, for i,,..., r. This establishes the desired bijection. Second solution: Let A n denote the set of rook tours beginning at (, and ending at (n,, and let B n denote the set of rook tours beginning at (, and ending at (n, 3. For n, we construct a bijection between A n and A n B n. Any path P in A n contains either the line segment P between (n, and (n,, or the line segment P between (n, and (n,. In the former case, P must also contain the subpath P which joins (n, 3, (n, 3, (n,, and (n, consecutively; then deleting P and P from P and adding the line segment joining (n, 3 to (n, results in a path in A n. (This construction is reversible, lengthening any path in A n to a path in A n. In the latter case, P contains the subpath P which joins (n, 3, (n, 3, (n,, (n, consecutively; deleting P results in a path in B n, and this construction is also reversible. The desired bijection follows. Similarly, there is a bijection between B n and A n B n for n. It follows by induction that for n, A n B n n ( A + B. But A and B, and hence the desired answer is A n n. Remarks: Other bijective arguments are possible: for instance, Noam Elkies points out that each element of A n B n contains a different one of the possible sets of segments of the form (i,, (i +, for i,..., n. Richard Stanley provides the reference: K.L. Collins and L.B. Krompart, The number of Hamiltonian paths in a rectangular grid, Discrete Math. 69 (997, This problem is Theorem of that paper; the cases of 4 n and 5 n grids are also treated. The paper can also be found online at the URL kcollins.web.wesleyan.edu/vita.htm. A3 Note that it is implicit in the problem that p is nonconstant, one may take any branch of the square root, and that z should be ignored. First solution: Write p(z c n j (z r j, so that g (z g(z z n j Now if z r j for all j,then z + r j z r j. z + r j (z + r j(z r j z r j z r j z + Im(zr j z r j, and so Re zg (z g(z z j z r j. Since the quantity in parentheses is positive, g (z/g(z can be only if z. If on the other hand z r j for some j, then z anyway. Second solution: Write p(z c n j (z r j, so that g (z g(z n j (. z r j z
3 We first check that g (z whenever z is real and z >. In this case, for r j e iθj, we have z r j (z cos(θ j + sin(θ j i, so the real part of z r j z is z cos(θ j z z cos(θ j + z z z(z z cos(θ j + >. Hence g (z/g(z has positive real part, so g (z/g(z and hence g(z are nonzero. Applying the same argument after replacing p(z by p(e iθ z, we deduce that g cannot have any roots outside the unit circle. Applying the same argument after replacing p(z by z n p(/z, we also deduce that g cannot have any roots inside the unit circle. Hence all roots of g have absolute value, as desired. Third solution: Write p(z c n j (z r j and put r j e iθj. Note that g(e iθ is equal to a nonzero constant times h(θ n e i(θ+θj e i(θ+θj j i n sin(θ + θ j. j Since h has at least n roots (counting multiplicity in the interval [, π, h does also by repeated application of Rolle s theorem. Since g (e iθ ie iθ h (θ, g (z has at least n roots on the unit circle. Since g (z is equal to z n times a polynomial of degree n, g (z has all roots on the unit circle, as then does g (z. Remarks: The second solution imitates the proof of the Gauss-Lucas theorem: the roots of the derivative of a complex polynomial lie in the convex hull of the roots of the original polynomial. The second solution is close to problem B3 from the Putnam. A hybrid between the first and third solutions is to check that on the unit circle, Re(zg (z/g(z while between any two roots of p, Im(zg (z/g(z runs from + to and so must have a zero crossing. (This only works when p has distinct roots, but the general case follows by the continuity of the roots of a polynomial as functions of the coefficients. One can also construct a solution using Rouché s theorem. A4 First solution: Choose a set of a rows r,..., r a containing an a b submatrix whose entries are all. Then for i, j {,..., a}, we have r i r j n if i j and otherwise. Hence a r i r j an. i,j On the other hand, the term on the left is the dot product of r + +r a with itself, i.e., its squared length. Since this vector has a in each of its first b coordinates, the dot product is at least a b. Hence an a b, whence n ab as desired. Second solution: (by Richard Stanley Suppose without loss of generality that the a b submatrix occupies the first a rows and the first b columns. Let M be the submatrix occupying the first a rows and the last n b columns. Then the hypothesis implies that the matrix MM T has n b s on the main diagonal and b s elsewhere. Hence the column vector v of length a consisting of all s satisfies MM T v (n abv, so n ab is an eigenvalue of MM T. But MM T is semidefinite, so its eigenvalues are all nonnegative real numbers. Hence n ab. Remarks: A matrix as in the problem is called a Hadamard matrix, because it meets the equality condition of Hadamard s inequality: any n n matrix with ± entries has absolute determinant at most n n/, with equality if and only if the rows are mutually orthogonal (from the interpretation of the determinant as the volume of a paralellepiped whose edges are parallel to the row vectors. Note that this implies that the columns are also mutually orthogonal. A generalization of this problem, with a similar proof, is known as Lindsey s lemma: the sum of the entries in any a b submatrix of a Hadamard matrix is at most abn. Stanley notes that Ryser (98 asked for the smallest size of a Hadamard matrix containing an r s submatrix of all s, and refers to the URL www3.interscience.wiley.com/cgi-bin/ abstract/5586/abstract for more information. A5 First solution: We make the substitution x tan θ, rewriting the desired integral as Write π/4 log(tan(θ + dθ. log(tan(θ + log(sin(θ + cos(θ log(cos(θ and then note that sin(θ + cos(θ cos(π/4 θ. We may thus rewrite the integrand as log( + log(cos(π/4 θ log(cos(θ. But over the interval [, π/4], the integrals of log(cos(θ and log(cos(π/4 θ are equal, so their contributions cancel out. The desired integral is then just the integral of log( over the interval [, π/4], which is π log(/8. Second solution: (by Roger Nelsen Let I denote the desired integral. We make the substitution x (
4 3 u/( + u to obtain I yielding log( ( + u log(/( + u ( + u log( log( + u + u du du + u I, du ( + u I log( du + u π log(. 8 Third solution: (attributed to Steven Sivek Define the function f(t log(xt + x + so that f( and the desired integral is f(. Then by differentiation under the integral, f (t By partial fractions, we obtain dx x (xt + (x + dx. f (t t arctan(x log(tx + + log(x + (t + f(t whence πt + log( 4 log(t + 4(t, + log( arctan(t and hence f( π log( 4 x x + π log(t + t log(t + 8 t dt + log(t + t dt. + But the integral on the right is again the desired integral f(, so we may move it to the left to obtain f( π log( 4 and hence f( π log(/8 as desired. Fourth solution: (by David Rusin We have ( log(x + ( n x n x dx + n(x dx. + n We next justify moving the sum through the integral sign. Note that n ( n x n dx n(x + is an alternating series whose terms strictly decrease to zero, so it converges. Moreover, its partial sums alternately bound the previous integral above and below, so the sum of the series coincides with the integral. Put J n x n dx x + ; then J arctan( π 4 and J log(. Moreover, Write then J n + J n+ A m B m m i x n dx n +. ( i i m ( i ; i i J n ( n (J A n J n+ ( n (J B n. Now the N-th partial sum of our series equals N n J n n J n n N n ( n n (J B n ( n n (J A n A N (J B N + B N (J A N + A N B N. As N, A N J and B N J, so the sum tends to J J π log(/8. Remarks: The first two solutions are related by the fact that if x tan(θ, then x/( + x tan(π/4 θ. The strategy of the third solution (introducing a parameter then differentiating it was a favorite of physics Nobelist (and Putnam Fellow Richard Feynman. Noam Elkies notes that this integral is number.49#8 in Gradshteyn and Ryzhik, Table of integrals, series, and products. The Mathematica computer algebra system (version 5. successfully computes this integral, but we do not know how. A6 First solution: The angle at a vertex P is acute if and only if all of the other points lie on an open semicircle. We first deduce from this that if there are any two acute angles at all, they must occur consecutively. Suppose the contrary; label the vertices Q,..., Q n in counterclockwise order (starting anywhere, and suppose that the angles at Q and Q i are acute for some i with 3 i n. Then the open semicircle starting
5 4 at Q and proceeding counterclockwise must contain all of Q 3,..., Q n, while the open semicircle starting at Q i and proceeding counterclockwise must contain Q i+,..., Q n, Q,..., Q i. Thus two open semicircles cover the entire circle, contradiction. It follows that if the polygon has at least one acute angle, then it has either one acute angle or two acute angles occurring consecutively. In particular, there is a unique pair of consecutive vertices Q, Q in counterclockwise order for which Q is acute and Q is not acute. Then the remaining points all lie in the arc from the antipode of Q to Q, but Q cannot lie in the arc, and the remaining points cannot all lie in the arc from the antipode of Q to the antipode of Q. Given the choice of Q, Q, let x be the measure of the counterclockwise arc from Q to Q ; then the probability that the other points fall into position is n+ x n if x / and otherwise. Hence the probability that the polygon has at least one acute angle with a given choice of which two points will act as Q and Q is / ( n+ x n dx n n n+. Since there are n(n choices for which two points act as Q and Q, the probability of at least one acute angle is n(n n+. Second solution: (by Calvin Lin As in the first solution, we may compute the probability that for a particular one of the points Q, the angle at Q is not acute but the following angle is, and then multiply by n. Imagine picking the points by first choosing Q, then picking n pairs of antipodal points and then picking one member of each pair. Let R,..., R n be the points of the pairs which lie in the semicircle, taken in order away from Q, and let S,..., S n be the antipodes of these. Then to get the desired situation, we must choose from the pairs to end up with all but one of the S i, and we cannot take R n and the other S i or else Q will be acute. That gives us (n good choices out of n ; since we could have chosen Q to be any of the n points, the probability is again n(n n+. B Take P (x, y (y x(y x. To see that this works, first note that if m a, then m is an integer less than or equal to a, so m a. On the other hand, m + is an integer strictly greater than a, so m + is an integer strictly greater than a, so a m +. B By the arithmetic-harmonic mean inequality or the Cauchy-Schwarz inequality, ( (k + + k n + + n. k k n We must thus have 5n 4 n, so n 4. Without loss of generality, we may suppose that k k n. If n, we must have k, which works. Note that hereafter we cannot have k. If n, we have (k, k {(, 4, (3, 3}, neither of which work. If n 3, we have k + k + k 3, so k 3. Hence (k, k, k 3 {(,, 7, (, 3, 6, (, 4, 5, (3, 3, 5, (3, 4, 4}, and only (, 3, 6 works. If n 4, we must have equality in the AM-HM inequality, which only happens when k k k 3 k 4 4. Hence the solutions are n and k, n 3 and (k, k, k 3 is a permutation of (, 3, 6, and n 4 and (k, k, k 3, k 4 (4, 4, 4, 4. Remark: In the cases n, 3, Greg Kuperberg suggests the alternate approach of enumerating the solutions of /k + +/k n with k k n. This is easily done by proceeding in lexicographic order: one obtains (, for n, and (, 3, 6, (, 4, 4, (3, 3, 3 for n 3, and only (, 3, 6 contributes to the final answer. B3 First solution: The functions are precisely f(x cx d for c, d > arbitrary except that we must take c in case d. To see that these work, note that f (a/x dc(a/x d and x/f(x /(cx d, so the given equation holds if and only if dc a d. If d, we may solve for a no matter what c is; if d, we must have c. (Thanks to Brad Rodgers for pointing out the d restriction. To check that these are all solutions, put b log(a and y log(a/x; rewrite the given equation as Put f(e b y f (e y e b y. g(y log f(e y ; then the given equation rewrites as or g(b y + log g (y + g(y y b y, log g (y b g(y g(b y. By the symmetry of the right side, we have g (b y g (y. Hence the function g(y + g(b y has zero derivative and so is constant, as then is g (y. From this we deduce that f(x cx d for some c, d, both necessarily positive since f (x > for all x. Second solution: (suggested by several people Substitute a/x for x in the given equation: Differentiate: f (x a xf(a/x. f a (x x f(a/x + a f (a/x x 3 f(a/x.
6 5 Now substitute to eliminate evaluations at a/x: f (x f (x x Clear denominators: + f (x f(x. xf(xf (x + f(xf (x xf (x. Divide through by f(x and rearrange: f (x f(x + xf (x xf (x f(x f(x. The right side is the derivative of xf (x/f(x, so that quantity is constant. That is, for some d, f (x f(x d x. Integrating yields f(x cx d, as desired. B4 First solution: Define f(m, n, k as the number of n- tuples (x, x,..., x n of integers such that x + + x n m and exactly k of x,..., x n are nonzero. To choose such a tuple, we may choose the k nonzero positions, the signs of those k numbers, and then an ordered ( k-tuple of positive integers with sum m. There are n k options for the first choice, and k for the second. As for the third, we have ( m k options by a stars and bars argument: depict the k-tuple by drawing a number of stars for each term, separated by bars, and adding stars at the end to get a total of m stars. Then each tuple corresponds to placing k bars, each in a different position behind one of the m fixed stars. We conclude that f(m, n, k k ( m k ( n f(n, m, k; k summing over k gives f(m, n f(n, m. (One may also extract easily a bijective interpretation of the equality. Second solution: (by Greg Kuperberg It will be convenient to extend the definition of f(m, n to m, n, in which case we have f(, m f(n,. Let S m,n be the set of n-tuples (x,..., x n of integers such that x + + x n m. Then elements of S m,n can be classified into three types. Tuples with x + + x n < m also belong to S m,n. Tuples with x + + x n m and x n correspond to elements of S m,n by dropping x n. Tuples with x + + x n m and x n < correspond to elements of S m,n by dropping x n. It follows that f(m, n f(m, n + f(m, n + f(m, n, so f satisfies a symmetric recurrence with symmetric boundary conditions f(, m f(n,. Hence f is symmetric. Third solution: (by Greg Martin As in the second solution, it is convenient to allow f(m, f(, n. Define the generating function G(x, y m n f(m, nx m y n. As equalities of formal power series (or convergent series on, say, the region x, y < 3, we have G(x, y x m y n m n n n y n y n x x k,..., k n Z k + + k n m k,..., k n Z m k + + k n k,..., k n Z y n( n k Z ( + x y n x n x k + + kn x x k n n x y( + x/( x x y xy. x m Since G(x, y G(y, x, it follows that f(m, n f(n, m for all m, n. B5 First solution: Put Q x + + x n. Since Q is homogeneous, P is divisible by Q if and only if each of the homogeneous components of P is divisible by Q. It is thus sufficient to solve the problem in case P itself is homogeneous, say of degree d. Suppose that we have a factorization P Q m R for some m >, where R is homogeneous of degree d and not divisible by Q; note that the homogeneity implies that n i x i R x i dr. Write as shorthand for + + x x ; then n P mnq m R + Q m R + n i Q m R + (mn + 4mdQ m R. m R mx i Q x i Since m >, this forces R to be divisible by Q, contradiction. Second solution: (by Noam Elkies Retain notation as in the first solution. Let P d be the set of homogeneous
7 6 polynomials of degree d, and let H d be the subset of P d of polynomials killed by, which has dimension dim(p d dim(p d ; the given problem amounts to showing that this inequality is actually an equality. Consider the operator Q (i.e., apply then multiply by Q on P d ; its zero eigenspace is precisely H d. By the calculation from the first solution, if R P d, then (QR Q R (n + 4dR. Consequently, Q j H d j is contained in the eigenspace of Q on P d of eigenvalue (n + 4(d j + + (n + 4(d. In particular, the Q j H d j lie in distinct eigenspaces, so are linearly independent within P d. But by dimension counting, their total dimension is at least that of P d. Hence they exhaust P d, and the zero eigenspace cannot have dimension greater than dim(p d dim(p d, as desired. Third solution: (by Richard Stanley Write x (x,..., x n and ( x,..., x n. Suppose that P (x Q(x(x + + x n. Then P ( P (x Q( ( P (x. On the other hand, if P (x α c αx α (where α (α,..., α n and x α x α xαn n, then the constant term of P ( P (x is seen to be α c α. Hence c α for all α. Remarks: The first two solutions apply directly over any field of characteristic zero. (The result fails in characteristic p > because we may take P (x + + x n p x p + + xp n. The third solution can be extended to complex coefficients by replacing P ( by its complex conjugate, and again the result may be deduced for any field of characteristic zero. Stanley also suggests Section 5 of the arxiv e-print math.co/5363 for some algebraic background for this problem. B6 First solution: Let I be the identity matrix, and let J x be the matrix with x s on the diagonal and s elsewhere. Note that J x (x I, being the all s matrix, has rank and trace n, so has n eigenvalues equal to and one equal to n. Hence J x has n eigenvalues equal to x and one equal to x + n, implying det J x (x + n (x n. On the other hand, we may expand the determinant as a sum indexed by permutations, in which case we get det J x sgn(πx ν(π. Integrating both sides from to (and substituting y x yields sgn(π ν(π + as desired. (x + n (x n dx ( n+ (n yy n dy ( n+ n n +, Second solution: We start by recalling a form of the principle of inclusion-exclusion: if f is a function on the power set of {,..., n}, then f(s T S ( T S U T f(u. In this case we take f(s to be the sum of σ(π over all permutations π whose fixed points are exactly S. Then U T f(u if T n and otherwise (since a permutation group on or more symbols has as many even and odd permutations, so f(s ( n S ( n + S. The desired sum can thus be written, by grouping over fixed point sets, as n ( n ( n i n + i i i + i n ( n n ( ( n i ( n i n n i i + i i i n ( ( n i n n + n + i + i ( n+ n n +. Third solution: (by Richard Stanley The cycle indicator of the symmetric group S n is defined by Z n (x,..., x n x c(π n, x cn(π where c i (π is the number of cycles of π of length i. Put F n σ(πx ν(π Z n (x,,,,,... and f(n σ(π ν(π + F n (x dx.
8 7 A standard argument in enumerative combinatorics (the Exponential Formula gives Z n (x,..., x n tn n! exp t k x k k, n yielding n f(n tn n! k exp (xt t + t33 dx e (x t+log(+t dx ( + te (x t dx t ( e t ( + t. Expanding the right side as a Taylor series and comparing coefficients yields the desired result. Fourth solution (sketch: (by David Savitt We prove the identity of rational functions σ(π ν(π + x ( n+ n!(x + n x(x + (x + n by induction on n, which for x implies the desired result. (This can also be deduced as in the other solutions, but in this argument it is necessary to formulate the strong induction hypothesis. Let R(n, x be the right hand side of the above equation. It is easy to verify that R(x, n R(x +, n + (n! ( n+ x n l (n! + ( R(x, n l, (n l! l since the sum telescopes. To prove the desired equality, it suffices to show that the left hand side satisfies the same recurrence. This follows because we can classify each π S n as either fixing n, being an n-cycle, or having n in an l-cycle for one of l,..., n ; writing the sum over these classes gives the desired recurrence.
Solutions to Calculus problems. b k A = limsup n. a n limsup b k,
Solutions to Calculus problems. We will prove the statement. Let {a n } be the sequence and consider limsupa n = A [, ]. If A = ±, we can easily find a nondecreasing (nonincreasing) subsequence of {a n
More informationThe 70th William Lowell Putnam Mathematical Competition Saturday, December 5, 2009
The 7th William Lowell Putnam Mathematical Competition Saturday, December 5, 9 A1 Let f be a real-valued function on the plane such that for every square ABCD in the plane, f(a) + f(b) + f(c) + f(d) =.
More informationSolutions to the 74th William Lowell Putnam Mathematical Competition Saturday, December 7, 2013
Solutions to the 74th William Lowell Putnam Mathematical Competition Saturday, December 7, 213 Kiran Kedlaya and Lenny Ng A1 Suppose otherwise. Then each vertex v is a vertex for five faces, all of which
More informationPUTNAM TRAINING EASY PUTNAM PROBLEMS
PUTNAM TRAINING EASY PUTNAM PROBLEMS (Last updated: September 24, 2018) Remark. This is a list of exercises on Easy Putnam Problems Miguel A. Lerma Exercises 1. 2017-A1. Let S be the smallest set of positive
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationUSA Mathematical Talent Search Round 1 Solutions Year 27 Academic Year
1/1/27. Fill in the spaces of the grid to the right with positive integers so that in each 2 2 square with top left number a, top right number b, bottom left number c, and bottom right number d, either
More informationPUTNAM TRAINING PROBLEMS
PUTNAM TRAINING PROBLEMS (Last updated: December 3, 2003) Remark This is a list of Math problems for the NU Putnam team to be discussed during the training sessions Miguel A Lerma 1 Bag of candies In a
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationEASY PUTNAM PROBLEMS
EASY PUTNAM PROBLEMS (Last updated: December 11, 2017) Remark. The problems in the Putnam Competition are usually very hard, but practically every session contains at least one problem very easy to solve
More informationAS PURE MATHS REVISION NOTES
AS PURE MATHS REVISION NOTES 1 SURDS A root such as 3 that cannot be written exactly as a fraction is IRRATIONAL An expression that involves irrational roots is in SURD FORM e.g. 2 3 3 + 2 and 3-2 are
More informationMath Final Exam Review
Math - Final Exam Review. Find dx x + 6x +. Name: Solution: We complete the square to see if this function has a nice form. Note we have: x + 6x + (x + + dx x + 6x + dx (x + + Note that this looks a lot
More informationN E W S A N D L E T T E R S
N E W S A N D L E T T E R S 74th Annual William Lowell Putnam Mathematical Competition Editor s Note: Additional solutions will be printed in the Monthly later in the year. PROBLEMS A1. Recall that a regular
More informationSUMS PROBLEM COMPETITION, 2000
SUMS ROBLEM COMETITION, 2000 SOLUTIONS 1 The result is well known, and called Morley s Theorem Many proofs are known See for example HSM Coxeter, Introduction to Geometry, page 23 2 If the number of vertices,
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationGRE Math Subject Test #5 Solutions.
GRE Math Subject Test #5 Solutions. 1. E (Calculus) Apply L Hôpital s Rule two times: cos(3x) 1 3 sin(3x) 9 cos(3x) lim x 0 = lim x 2 x 0 = lim 2x x 0 = 9. 2 2 2. C (Geometry) Note that a line segment
More information= 10 such triples. If it is 5, there is = 1 such triple. Therefore, there are a total of = 46 such triples.
. Two externally tangent unit circles are constructed inside square ABCD, one tangent to AB and AD, the other to BC and CD. Compute the length of AB. Answer: + Solution: Observe that the diagonal of the
More informationPearson Mathematics Algebra 2 Common Core 2015
A Correlation of Pearson Mathematics Algebra 2 Common Core 2015 to the Common Core State Standards for Bid Category 13-050-10 A Correlation of Pearson Common Core Pearson Number and Quantity The Real Number
More informationTHE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION. Sunday, March 14, 2004 Time: hours No aids or calculators permitted.
THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION Sunday, March 1, Time: 3 1 hours No aids or calculators permitted. 1. Prove that, for any complex numbers z and w, ( z + w z z + w w z +
More informationComplex numbers, the exponential function, and factorization over C
Complex numbers, the exponential function, and factorization over C 1 Complex Numbers Recall that for every non-zero real number x, its square x 2 = x x is always positive. Consequently, R does not contain
More informationThe Advantage Testing Foundation Solutions
The Advantage Testing Foundation 2016 Problem 1 Let T be a triangle with side lengths 3, 4, and 5. If P is a point in or on T, what is the greatest possible sum of the distances from P to each of the three
More informationMADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking
MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationSolutions to the 69th William Lowell Putnam Mathematical Competition Saturday, December 6, 2008
Solutions to the 69th William Lowell Putnam Mathematical Competition Saturday, December 6, 2008 Kiran Kedlaya and Lenny Ng A 1 The function g(x) = f (x, 0) works. Substituting (x, y, z) = (0, 0, 0) into
More informationMS 3011 Exercises. December 11, 2013
MS 3011 Exercises December 11, 2013 The exercises are divided into (A) easy (B) medium and (C) hard. If you are particularly interested I also have some projects at the end which will deepen your understanding
More informationCommon Core State Standards for Mathematics - High School PARRC Model Content Frameworks Mathematics Algebra 2
A Correlation of CME Project Algebra 2 Common Core 2013 to the Common Core State Standards for , Common Core Correlated to the Number and Quantity The Real Number System N RN Extend the properties of exponents
More informationax 2 + bx + c = 0 where
Chapter P Prerequisites Section P.1 Real Numbers Real numbers The set of numbers formed by joining the set of rational numbers and the set of irrational numbers. Real number line A line used to graphically
More informationSome notes on Coxeter groups
Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three
More informationCalculus First Semester Review Name: Section: Evaluate the function: (g o f )( 2) f (x + h) f (x) h. m(x + h) m(x)
Evaluate the function: c. (g o f )(x + 2) d. ( f ( f (x)) 1. f x = 4x! 2 a. f( 2) b. f(x 1) c. f (x + h) f (x) h 4. g x = 3x! + 1 Find g!! (x) 5. p x = 4x! + 2 Find p!! (x) 2. m x = 3x! + 2x 1 m(x + h)
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationConformal maps. Lent 2019 COMPLEX METHODS G. Taylor. A star means optional and not necessarily harder.
Lent 29 COMPLEX METHODS G. Taylor A star means optional and not necessarily harder. Conformal maps. (i) Let f(z) = az + b, with ad bc. Where in C is f conformal? cz + d (ii) Let f(z) = z +. What are the
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group
More informationHOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)
HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION) PROFESSOR STEVEN MILLER: BROWN UNIVERSITY: SPRING 2007 1. CHAPTER 1: MATRICES AND GAUSSIAN ELIMINATION Page 9, # 3: Describe
More informationTEST CODE: MMA (Objective type) 2015 SYLLABUS
TEST CODE: MMA (Objective type) 2015 SYLLABUS Analytical Reasoning Algebra Arithmetic, geometric and harmonic progression. Continued fractions. Elementary combinatorics: Permutations and combinations,
More information= , AD = 1, BE = 1, and F G = 1. By Pythagoras, BD = AB 2 + AD 2 = 2. By similar triangles on DEF and ABD, we have that AF.
RMT 0 Team Test Solutions February 0, 0 How many squares are there in the xy-plane such that both coordinates of each vertex are integers between 0 and 00 inclusive, and the sides are parallel to the axes?
More informationMTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.
MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:
More informationProblem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
More informationAuerbach bases and minimal volume sufficient enlargements
Auerbach bases and minimal volume sufficient enlargements M. I. Ostrovskii January, 2009 Abstract. Let B Y denote the unit ball of a normed linear space Y. A symmetric, bounded, closed, convex set A in
More informationProblems for Putnam Training
Problems for Putnam Training 1 Number theory Problem 1.1. Prove that for each positive integer n, the number is not prime. 10 1010n + 10 10n + 10 n 1 Problem 1.2. Show that for any positive integer n,
More information1. Introduction. 2. Outlines
1. Introduction Graphs are beneficial because they summarize and display information in a manner that is easy for most people to comprehend. Graphs are used in many academic disciplines, including math,
More informationbesides your solutions of these problems. 1 1 We note, however, that there will be many factors in the admission decision
The PRIMES 2015 Math Problem Set Dear PRIMES applicant! This is the PRIMES 2015 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 2015. For complete rules,
More informationTennessee s State Mathematics Standards - Algebra II
Domain Cluster Standard Scope and Clarifications The Real Number System (N-RN) Extend the properties of exponents to rational exponents 1. Explain how the definition of the meaning of rational exponents
More informationProblem 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 informationb n x n + b n 1 x n b 1 x + b 0
Math Partial Fractions Stewart 7.4 Integrating basic rational functions. For a function f(x), we have examined several algebraic methods for finding its indefinite integral (antiderivative) F (x) = f(x)
More informationMath Homework 2
Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is
More informationLinear Algebra. Session 12
Linear Algebra. Session 12 Dr. Marco A Roque Sol 08/01/2017 Example 12.1 Find the constant function that is the least squares fit to the following data x 0 1 2 3 f(x) 1 0 1 2 Solution c = 1 c = 0 f (x)
More informationSOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2
SOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2 Here are the solutions to the additional exercises in betsepexercises.pdf. B1. Let y and z be distinct points of L; we claim that x, y and z are not
More informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More informationThe Advantage Testing Foundation Olympiad Solutions
The Advantage Testing Foundation 015 Olympiad Problem 1 Prove that every positive integer has a unique representation in the form d i i, where k is a nonnegative integer and each d i is either 1 or. (This
More informationReference Material /Formulas for Pre-Calculus CP/ H Summer Packet
Reference Material /Formulas for Pre-Calculus CP/ H Summer Packet Week # 1 Order of Operations Step 1 Evaluate expressions inside grouping symbols. Order of Step 2 Evaluate all powers. Operations Step
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationReal 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 informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationINEQUALITIES OF SYMMETRIC FUNCTIONS. 1. Introduction to Symmetric Functions [?] Definition 1.1. A symmetric function in n variables is a function, f,
INEQUALITIES OF SMMETRIC FUNCTIONS JONATHAN D. LIMA Abstract. We prove several symmetric function inequalities and conjecture a partially proved comprehensive theorem. We also introduce the condition of
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Awards Screening Test. February 25, Time Allowed: 90 Minutes Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Awards Screening Test February 25, 2006 Time Allowed: 90 Minutes Maximum Marks: 40 Please read, carefully, the instructions on the following page before you
More informationThe University of Sydney
The University of Sydney School of Mathematics and Statistics NSW 006 Australia Sydney University Mathematical Society Problem Competition 008 1. Imagine an analogue watch with the usual hour hand, minute
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationPreliminary algebra. Polynomial equations. and three real roots altogether. Continue an investigation of its properties as follows.
978-0-51-67973- - Student Solutions Manual for Mathematical Methods for Physics and Engineering: 1 Preliminary algebra Polynomial equations 1.1 It can be shown that the polynomial g(x) =4x 3 +3x 6x 1 has
More informationAlgebra II/Math III Curriculum Map
6 weeks Unit Unit Focus Common Core Math Standards 1 Simplify and perform operations with one variable involving rational, exponential and quadratic functions. 2 Graph and evaluate functions to solve problems.
More information0 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 informationProblem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A.
Problem 1A Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1 (Hint: 1 1 (something)dz) Solution: The volume is 1 1 4xydz where x = y = 1 z 2 This integral has value 16/3 Problem 2A Let f(x)
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationMY PUTNAM PROBLEMS. log(1 + x) dx = π2
MY PUTNAM PROBLEMS These are the problems I proposed when I was on the Putnam Problem Committee for the 984 86 Putnam Exams. Problems intended to be A or B (and therefore relatively easy) are marked accordingly.
More informationNotes on generating functions in automata theory
Notes on generating functions in automata theory Benjamin Steinberg December 5, 2009 Contents Introduction: Calculus can count 2 Formal power series 5 3 Rational power series 9 3. Rational power series
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Scholarships Screening Test Saturday, February 2, 2008 Time Allowed: Two Hours Maximum Marks: 40 Please read, carefully, the instructions on the following
More informationTHE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION March, 2005
THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION March, 5 Time: 3 1 hours No aids or calculators permitted. It is not necessary to do all the problems. Complete solutions to fewer problems
More informationEXAMPLES OF PROOFS BY INDUCTION
EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming
More information(x 3)(x + 5) = (x 3)(x 1) = x + 5. sin 2 x e ax bx 1 = 1 2. lim
SMT Calculus Test Solutions February, x + x 5 Compute x x x + Answer: Solution: Note that x + x 5 x x + x )x + 5) = x )x ) = x + 5 x x + 5 Then x x = + 5 = Compute all real values of b such that, for fx)
More informationStandards-Based Learning Power Standards. High School- Algebra
Standards-Based Learning Power Standards Mathematics Algebra 3,4 The high school standards specify the mathematics that all students should study in order to be college and career ready. High School Number
More informationThis class will demonstrate the use of bijections to solve certain combinatorial problems simply and effectively.
. Induction This class will demonstrate the fundamental problem solving technique of mathematical induction. Example Problem: Prove that for every positive integer n there exists an n-digit number divisible
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationClassnotes - MA Series and Matrices
Classnotes - MA-2 Series and Matrices Department of Mathematics Indian Institute of Technology Madras This classnote is only meant for academic use. It is not to be used for commercial purposes. For suggestions
More information18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS
18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS Note. The terms root and zero of a polynomial are synonyms. Those problems which appeared on the Putnam Exam are stated as they appeared verbatim (except
More informationEIGENVALUES AND EIGENVECTORS 3
EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More informationMA22S3 Summary Sheet: Ordinary Differential Equations
MA22S3 Summary Sheet: Ordinary Differential Equations December 14, 2017 Kreyszig s textbook is a suitable guide for this part of the module. Contents 1 Terminology 1 2 First order separable 2 2.1 Separable
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More information1. Let g(x) and h(x) be polynomials with real coefficients such that
1. Let g(x) and h(x) be polynomials with real coefficients such that g(x)(x 2 3x + 2) = h(x)(x 2 + 3x + 2) and f(x) = g(x)h(x) + (x 4 5x 2 + 4). Prove that f(x) has at least four real roots. 2. Let M be
More informationMath 378 Spring 2011 Assignment 4 Solutions
Math 3 Spring 2011 Assignment 4 Solutions Brualdi 6.2. The properties are P 1 : is divisible by 4. P 2 : is divisible by 6. P 3 : is divisible by. P 4 : is divisible by 10. Preparing to use inclusion-exclusion,
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, January 20, Time Allowed: 150 Minutes Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Scholarships Screening Test Saturday, January 2, 218 Time Allowed: 15 Minutes Maximum Marks: 4 Please read, carefully, the instructions that follow. INSTRUCTIONS
More information5.4 - Quadratic Functions
Fry TAMU Spring 2017 Math 150 Notes Section 5.4 Page! 92 5.4 - Quadratic Functions Definition: A function is one that can be written in the form f (x) = where a, b, and c are real numbers and a 0. (What
More informationThird In-Class Exam Solutions Math 246, Professor David Levermore Thursday, 3 December 2009 (1) [6] Given that 2 is an eigenvalue of the matrix
Third In-Class Exam Solutions Math 26, Professor David Levermore Thursday, December 2009 ) [6] Given that 2 is an eigenvalue of the matrix A 2, 0 find all the eigenvectors of A associated with 2. Solution.
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationB 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.
Math 6342/7350: Topology and Geometry Sample Preliminary Exam Questions 1. For each of the following topological spaces X i, determine whether X i and X i X i are homeomorphic. (a) X 1 = [0, 1] (b) X 2
More informationCourse 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 informationWeek Quadratic forms. Principal axes theorem. Text reference: this material corresponds to parts of sections 5.5, 8.2,
Math 051 W008 Margo Kondratieva Week 10-11 Quadratic forms Principal axes theorem Text reference: this material corresponds to parts of sections 55, 8, 83 89 Section 41 Motivation and introduction Consider
More informationChapter 9: Systems of Equations and Inequalities
Chapter 9: Systems of Equations and Inequalities 9. Systems of Equations Solve the system of equations below. By this we mean, find pair(s) of numbers (x, y) (if possible) that satisfy both equations.
More informationa k 0, then k + 1 = 2 lim 1 + 1
Math 7 - Midterm - Form A - Page From the desk of C. Davis Buenger. https://people.math.osu.edu/buenger.8/ Problem a) [3 pts] If lim a k = then a k converges. False: The divergence test states that if
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationMath 61CM - Solutions to homework 6
Math 61CM - Solutions to homework 6 Cédric De Groote November 5 th, 2018 Problem 1: (i) Give an example of a metric space X such that not all Cauchy sequences in X are convergent. (ii) Let X be a metric
More informationCore A-level mathematics reproduced from the QCA s Subject criteria for Mathematics document
Core A-level mathematics reproduced from the QCA s Subject criteria for Mathematics document Background knowledge: (a) The arithmetic of integers (including HCFs and LCMs), of fractions, and of real numbers.
More informationSolutions to the 60th William Lowell Putnam Mathematical Competition Saturday, December 4, 1999
Solutions to the 60th William Lowell Putnam Mathematical Competition Saturday, December 4, 1999 Manjul Bhargava, iran edlaya, and Lenny g A 1 ote that if rx) and sx) are any two functions, then maxr, s)
More information