
Recent Posts
Archives
 March 2020
 June 2018
 July 2016
 June 2016
 May 2016
 March 2015
 February 2015
 January 2015
 December 2014
 December 2013
 November 2013
 July 2013
 June 2013
 May 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
 April 2012
 March 2012
 February 2012
 January 2012
 December 2011
 November 2011
 October 2011
Categories
Meta
Pages
Monthly Archives: December 2011
Symmetric Polynomials (III)
Now we generalise this to n variables: . It’s clear what the corresponding building blocks of symmetric polynomials would be: ; ; ; … . We call these ei‘s the elementary symmetric polynomials in the xi‘s. Note that each ei is the coefficient of Ti in the … Continue reading
Symmetric Polynomials (II)
When we move on to n=3 variables, we now have, as basic building blocks, These are just the coefficients of in the expansion of . Once again, any symmetric polynomial in x, y, z with integer coefficients can be expressed as a polynomial … Continue reading
Symmetric Polynomials (I)
[ Background required: knowledge of basic algebra and polynomial operations. ] After a spate of posts on nonIMO related topics, we’re back on track. Here, we shall look at polynomials in n variables, e.g. P(x, y, z) when n = 3. Such … Continue reading
What is Curvature? (II)
[ Background required: rudimentary vector calculus. ] The aforementioned definition of curvature is practical but a little aesthetically displeasing. Specifically, one seeks a definition which is independent of the parametrization of the curve. The advantage of such a definition is … Continue reading
What is Curvature? (I)
[ Background required: calculus, specifically differentiation. ] In this post, we will give a little background intuition on the definition of curvature. One possible approach is given in wikipedia, ours is another. Note that this is not IMOrelated (my apologies … Continue reading
Pick’s Theorem and Some Interesting Applications
[ Background required: none. ] A lattice point on the cartesian plane is a point where both coordinates are integers. Let P be a polygon on the cartesian plane such that every vertex is a lattice point (we call it a lattice polygon). … Continue reading
Posted in Extra
Tagged arithmetic, farey sequences, ford circles, geometry, intermediate, lattice points, pick's theorem
1 Comment
Modular Arithmetic Deluxe Edition
[ Background required: standard modular arithmetic. ] Consider the following two problems: Problem 1. Prove that if p > 2 is prime, then when is expressed in lowest terms , m must be a multiple of p. Problem 2. Prove that if … Continue reading
Posted in Notes
Tagged basic, congruence, modular arithmetic, notes, number theory, rational numbers
Leave a comment