<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>New Zealand Maths Olympiad Committee online &#187; Links</title>
	<atom:link href="http://www.mathsolympiad.org.nz/category/links/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.mathsolympiad.org.nz</link>
	<description></description>
	<lastBuildDate>Mon, 16 Jan 2012 03:45:30 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>A very useful list &#8230;</title>
		<link>http://www.mathsolympiad.org.nz/2010/09/a-very-useful-list/</link>
		<comments>http://www.mathsolympiad.org.nz/2010/09/a-very-useful-list/#comments</comments>
		<pubDate>Wed, 15 Sep 2010 19:40:05 +0000</pubDate>
		<dc:creator>Michael</dc:creator>
				<category><![CDATA[Links]]></category>

		<guid isPermaLink="false">http://www.mathsolympiad.org.nz/?p=1000</guid>
		<description><![CDATA[Having the right mental habits is one of the keys to being a successful problem solver. One of the best lists I&#8217;ve seen was recently posted at a math education blog. The list is supposedly for sixth grade (i.e. year six) students, but is much more universal than that. You should go there and read [...]]]></description>
			<content:encoded><![CDATA[<p>Having the right mental habits is one of the keys to being a successful problem solver. One of the best lists I&#8217;ve seen was recently posted at <a href="http://mathteacherorstudent.blogspot.com/2010/09/habits-of-mind.html">a math education blog</a>. The list is supposedly for sixth grade (i.e. year six) students, but is much more universal than that. You should go there and read the whole thing, but even the excerpted headings are worth knowing:</p>
<p><strong>Pattern Sniff</strong><br />
<strong>Experiment, Guess and Conjecture</strong><br />
<strong>Organize and Simplify</strong><br />
<strong>Describe</strong><br />
<strong>Tinker and Invent</strong><br />
<strong>Visualize</strong><br />
<strong>Strategize, Reason and Prove</strong><br />
<strong>Connect</strong><br />
<strong>Listen and Collaborate</strong><br />
<strong>Contextualize, Reflect and Persevere</strong></p>
<p style="text-align: right;"><em><a>Michael</a></em></p>
]]></content:encoded>
			<wfw:commentRss>http://www.mathsolympiad.org.nz/2010/09/a-very-useful-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Chrystal&#8217;s Algebra</title>
		<link>http://www.mathsolympiad.org.nz/2009/12/chrystals-algebra/</link>
		<comments>http://www.mathsolympiad.org.nz/2009/12/chrystals-algebra/#comments</comments>
		<pubDate>Wed, 09 Dec 2009 20:31:18 +0000</pubDate>
		<dc:creator>Michael</dc:creator>
				<category><![CDATA[Links]]></category>
		<category><![CDATA[Algebra]]></category>
		<category><![CDATA[textbook]]></category>

		<guid isPermaLink="false">http://www.mathsolympiad.org.nz/?p=705</guid>
		<description><![CDATA[A classic (pre 1900) textbook on algebra by Chrystal has recently been scanned and made available electronically. Volume 1 is not likely to be of much interest for training purposes but chapters 23 and 24 (on combinatorics), 32 through 34 (continued fractions), and 35 (number theory), of volume 2 are. However, be warned, the scanned [...]]]></description>
			<content:encoded><![CDATA[<p>A classic (pre 1900) textbook on algebra by Chrystal has recently been scanned and <a href="http://onlinebooks.library.upenn.edu/webbin/book/lookupid?key=olbp36404">made available electronically</a>. Volume 1 is not likely to be of much interest for training purposes but chapters 23 and 24 (on combinatorics), 32 through 34 (continued fractions), and 35 (number theory), of volume 2 are. However, be warned, the scanned PDF is about 30M, so don&#8217;t try this on a slow or expensive connection!</p>
<p style="text-align: right;"><em><a href="mailto:malbert@cs.otago.ac.nz">Michael</a></em></p>
]]></content:encoded>
			<wfw:commentRss>http://www.mathsolympiad.org.nz/2009/12/chrystals-algebra/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Polynomials, pure mathematics, Princeton Companion</title>
		<link>http://www.mathsolympiad.org.nz/2009/04/pure-mathematics-princeton-companion/</link>
		<comments>http://www.mathsolympiad.org.nz/2009/04/pure-mathematics-princeton-companion/#comments</comments>
		<pubDate>Thu, 02 Apr 2009 00:23:49 +0000</pubDate>
		<dc:creator>Heather</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Links]]></category>

		<guid isPermaLink="false">http://www.mathsolympiad.org.nz/?p=475</guid>
		<description><![CDATA[Round about sixth form one learns that every polynomial can be factorized, as a product of linear factors.  Why?  Well, here&#8217;s a polynomial, see.  It&#8217;s probably a cubic with integer coefficients &#8212; after all, most nontrivial polynomials that one encounters are.  You play with it until you discover a root, likely by looking at integer [...]]]></description>
			<content:encoded><![CDATA[<p>Round about sixth form one learns that every polynomial can be factorized, as a product of linear factors.  Why?  Well, here&#8217;s a polynomial, see.  It&#8217;s probably a cubic with integer coefficients &#8212; after all, most nontrivial polynomials that one encounters are.  You play with it until you discover a root, likely by looking at integer factors of the highest and lowest coefficients.  Then you polynomial-divide through by the linear factor which that root gives you, and get a quadratic, whose roots there&#8217;s a formula for finding.  Tada!</p>
<p>Of course, there&#8217;s a problem with this algorithm:  it depends on figuring out how to break down your polynomial into only linear and quadratic factors.</p>
<p><span id="more-475"></span></p>
<p>Perhaps you know (at least in theory) the formulae for roots of general <a href="http://en.wikipedia.org/wiki/Cubic_formula#Roots_of_a_cubic_function">cubics</a> and <a href="http://en.wikipedia.org/wiki/Quartic_function#Solving_a_quartic_equation">quartics</a>.  Then you can carry out the above algorithm even if initially you can only see how to break down your polynomial into linear, quadratic, cubic and quartic factors.  That certainly covers most of the polynomials you&#8217;ll ever encounter at school.</p>
<p>But then problems arise.  The <a href="http://pcm.tandtproductions.com/resources/samples/pcm0036.pdf">Fundamental Theorem of Algebra</a> is the aforementioned factorization theorem.  More precisely, it states that every polynomial with integer, rational, real, and, importantly, even complex coefficients has a unique decomposition into linear complex-coefficiented factors.  Its proof is one of the coolest things you&#8217;ll learn in university complex analysis.  On the other hand, Galois theory, one of the coolest things you&#8217;ll learn in university abstract algebra, shows that <a href="http://pcm.tandtproductions.com/resources/samples/pcm0195.pdf">there&#8217;s no general formula for the roots of greater-than-fourth degree polynomials</a>.  The result is the kind of paradox that logicians love to hate:  polynomials with roots that you know exist, but which you have no algorithm for constructing.</p>
<p>The two links in the paragraph above are to sample articles of the <a href="http://books.google.com/books?id=Ry1tzhh8_sEC"><em>Princeton Companion to Mathematics</em></a>, a recently-published &#8220;encyclopedia of modern pure mathematics&#8221; edited by mathematician, <a href="http://www.ams.org/featurecolumn/archive/gowers.html">Fields medallist</a>, <a href="http://www.imo-official.org/participant_r.aspx?id=11101">British 1981 IMO perfect scorer</a>, and <a href="http://gowers.wordpress.com/">blogger</a> Timothy Gowers.  More sample articles available <a href="http://pcm.tandtproductions.com/index.php">here</a> (log in with username Guest and password PCM, and click the link to Resources).  Two others which I especially like are: a quick tour of <a href="http://pcm.tandtproductions.com/resources/samples/pcm0031.pdf">fundamental definitions and structures</a> (Section Four is a great introduction to the notions of limit and continuity, which, as an Olympiad hopeful, you may well have struggled through lately); and a discussion of <a href="http://pcm.tandtproductions.com/resources/samples/pcm0176.pdf">how professional mathematicians go about problem-solving</a>.</p>
<p>Olympiad mathematics is full of beautiful ideas, which show up all the better for being restricted to within a tightly-contained syllabus.  Modern pure mathematics, as the <em>Companion</em> does an exhilarating job of showing, takes the beautiful ideas and lets them loose.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.mathsolympiad.org.nz/2009/04/pure-mathematics-princeton-companion/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Number theory texts</title>
		<link>http://www.mathsolympiad.org.nz/2009/02/number-theory-texts/</link>
		<comments>http://www.mathsolympiad.org.nz/2009/02/number-theory-texts/#comments</comments>
		<pubDate>Tue, 24 Feb 2009 03:26:44 +0000</pubDate>
		<dc:creator>Heather</dc:creator>
				<category><![CDATA[Links]]></category>
		<category><![CDATA[Number Theory]]></category>

		<guid isPermaLink="false">http://www.mathsolympiad.org.nz/?p=434</guid>
		<description><![CDATA[(At least!) a couple of good, comprehensive introductions to elementary number theory are available online.  These notes by Jim Hefferon and W. Edwin Clark are nicely written and gently-paced.  These ones by Naoki Sato are a bit more Olympiad-focused.]]></description>
			<content:encoded><![CDATA[<p>(At least!) a couple of good, comprehensive introductions to elementary number theory are available online.  <a href="ftp://joshua.smcvt.edu/pub/hefferon/numbertheory/book.pdf">These notes</a> by Jim Hefferon and W. Edwin Clark are nicely written and gently-paced.  <a href="http://www.artofproblemsolving.com/Resources/Papers/SatoNT.pdf">These ones</a> by Naoki Sato are a bit more Olympiad-focused.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.mathsolympiad.org.nz/2009/02/number-theory-texts/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Proof style guide</title>
		<link>http://www.mathsolympiad.org.nz/2009/01/proof-style-guide/</link>
		<comments>http://www.mathsolympiad.org.nz/2009/01/proof-style-guide/#comments</comments>
		<pubDate>Sat, 24 Jan 2009 13:29:32 +0000</pubDate>
		<dc:creator>Heather</dc:creator>
				<category><![CDATA[Links]]></category>

		<guid isPermaLink="false">http://www.mathsolympiad.org.nz/?p=367</guid>
		<description><![CDATA[Clear mathematical writing often leads to clearer thinking.  Of course, in Olympiad problems, it also reduces the risk of losing marks for small errors! If you want to work on your exposition, I heartily recommend this style guide for writing up solutions to mathematical problems, by John M. Lee.  It&#8217;s aimed mainly at people writing [...]]]></description>
			<content:encoded><![CDATA[<p style="text-align: justify;">Clear mathematical writing often leads to clearer thinking.  Of course, in Olympiad problems, it also reduces the risk of losing marks for small errors!</p>
<p>If you want to work on your exposition, I heartily recommend <a href="http://www.math.washington.edu/~lee/Courses/544-2006/writing-proofs.pdf">this style guide</a> for writing up solutions to mathematical problems, by <a href="http://www.math.washington.edu/~lee/">John M. Lee</a>.  It&#8217;s aimed mainly at people writing university mathematics assignments, with lots of time to spare, so some of the details in the last section are more pedantic than Olympiad contestants will need to bother with.  But the general instructions in the first half are excellent.</p>
<p>One sometimes-helpful trick (Lee mentions it at the start of the second page) is to try to break down your solution to a question into several sub-arguments.  In long complicated questions, clarity, and keeping track of small details, seem to arise much more easily out of a nice sequence of Propositions and Lemmas &#8212; each stated clearly, then proved before going on to the next &#8212; than out of a single essay-style answer.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.mathsolympiad.org.nz/2009/01/proof-style-guide/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Linkage: Abstract Math</title>
		<link>http://www.mathsolympiad.org.nz/2009/01/linkage-abstract-math/</link>
		<comments>http://www.mathsolympiad.org.nz/2009/01/linkage-abstract-math/#comments</comments>
		<pubDate>Thu, 22 Jan 2009 22:09:55 +0000</pubDate>
		<dc:creator>Michael</dc:creator>
				<category><![CDATA[Links]]></category>

		<guid isPermaLink="false">http://www.mathsolympiad.org.nz/?p=339</guid>
		<description><![CDATA[The site Abstract Math by Charles Wells presents some useful insights on writing and doing proofs. The author&#8217;s opinions in some areas are arguable (so you should read and think about them, rather than follow the advice slavishly &#8212; the only piece of advice which you should in general follow slavishly!) For instance, I wouldn&#8217;t [...]]]></description>
			<content:encoded><![CDATA[<p>The site <a href="http://www.abstractmath.org/">Abstract Math</a> by <a href="http://www.cwru.edu/artsci/math/wells/home.html">Charles Wells</a> presents some useful insights on writing and doing proofs. The author&#8217;s opinions in some areas are arguable (so you should read and think about them, rather than follow the advice slavishly &#8212; the only piece of advice which you should in general follow slavishly!) For instance, I wouldn&#8217;t recommend the &#8220;Languages of Math&#8221; section which is far too detailed at present. However, there are little gems to be found everywhere, and from within that section comes the link to <a href="http://gowers.wordpress.com/">Timothy Gowers</a> article, <a href="http://www.dpmms.cam.ac.uk/~wtg10/grammar.pdf">&#8220;The language and grammar of mathematics.&#8221;</a>. By the way, the &#8220;Tricki&#8221; which he (Gowers) promises should be live soon will certainly be a great resource.</p>
<p>Returning to <a href="http://www.abstractmath.org/">Abstract Math</a>, I particularly recommend the section entitled <a href="http://www.abstractmath.org/MM/MMDoingMath.htm">Doing Math</a>. Just in case you&#8217;re too lazy to click a link and explore I will briefly quote one particularly important concept from the &#8220;Useful Behaviors&#8221; section:</p>
<blockquote><p><strong>METHOD</strong>: <em>To prove that a statement involving a concept is true,start by rewriting the statement using the definition of the concept.</em></p></blockquote>
<p>So very simple, and yet so true. But, don&#8217;t wait, go and explore <a href="http://www.abstractmath.org/">Abstract Math</a> now!</p>
<p style="text-align: right;"><em>Michael</em></p>
]]></content:encoded>
			<wfw:commentRss>http://www.mathsolympiad.org.nz/2009/01/linkage-abstract-math/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

