<?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>SAMO &#8211; Mathemafrica</title>
	<atom:link href="http://www.mathemafrica.org/?feed=rss2&#038;tag=samo" rel="self" type="application/rss+xml" />
	<link>http://www.mathemafrica.org</link>
	<description>All about maths in Africa</description>
	<lastBuildDate>Mon, 20 Apr 2020 06:44:50 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=4.4.2</generator>
	<item>
		<title>The 2018 South African Mathematics Olympiad — Problem 6</title>
		<link>http://www.mathemafrica.org/?p=15416</link>
		<comments>http://www.mathemafrica.org/?p=15416#comments</comments>
		<pubDate>Tue, 23 Jul 2019 14:29:33 +0000</pubDate>
		<dc:creator><![CDATA[Dylan Nelson]]></dc:creator>
				<category><![CDATA[Competition]]></category>
		<category><![CDATA[English]]></category>
		<category><![CDATA[combinatorics]]></category>
		<category><![CDATA[contest]]></category>
		<category><![CDATA[problem solving]]></category>
		<category><![CDATA[SAMO]]></category>

		<guid isPermaLink="false">http://www.mathemafrica.org/?p=15416</guid>
		<description><![CDATA[<p>The final round of the <a href="http://www.mathemafrica.org/?p=15190" target="_blank">South African Mathematics Olympiad</a> will be taking place on Thursday, 28 July 2019. I have been writing about some of the problems from the senior paper from 2018. A list of all of the problems can be found <a href="http://www.mathemafrica.org/?p=15215" target="_blank">here</a>.</p>
<p>Today we will look at the sixth and final problem from the 2018 South African Mathematics Olympiad:</p>
<blockquote>
<p>Let <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" /> be a positive integer, and let <img src="//s0.wp.com/latex.php?latex=x_1%2C+x_2%2C+%5Cdots%2C+x_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_1, x_2, &#92;dots, x_n" title="x_1, x_2, &#92;dots, x_n" class="latex" /> be distinct positive integers with <img src="//s0.wp.com/latex.php?latex=x_1+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_1 = 1" title="x_1 = 1" class="latex" />. Construct an <img src="//s0.wp.com/latex.php?latex=n+%5Ctimes+3&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n &#92;times 3" title="n &#92;times 3" class="latex" /> table where the entries of the <img src="//s0.wp.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="k" title="k" class="latex" />-th row are <img src="//s0.wp.com/latex.php?latex=x_k%2C+2x_k%2C+3x_k&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_k, 2x_k, 3x_k" title="x_k, 2x_k, 3x_k" class="latex" /> for <img src="//s0.wp.com/latex.php?latex=k+%3D+1%2C+2%2C+%5Cdots%2C+n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="k = 1, 2, &#92;dots, n" title="k = 1, 2, &#92;dots, n" class="latex" />. Now follow a procedure where, in each step, two identical entries are removed from the table. This continues until there are no more identical entries in the table.</p>
<ol>
<li>Prove that at least three entries remain at the end of the procedure.</li>
<li>Prove that there are infinitely many possible choices for <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" /> and <img src="//s0.wp.com/latex.php?latex=x_1%2C+x_2%2C+%5Cdots%2C+x_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_1, x_2, &#92;dots, x_n" title="x_1, x_2, &#92;dots, x_n" class="latex" /> such that only three entries remain,</li>
</ol>
</blockquote>
<p>There are some heuristics that are often helpful when solving a problem, such as</p>
<ul>
<li><b>Looking at small cases:</b>
<p>This helps us to understand the problem and how the various pieces in the problem relate to each other.</p></li></ul>&#8230;]]></description>
				<content:encoded><![CDATA[<p>The final round of the <a href="http://www.mathemafrica.org/?p=15190" target="_blank">South African Mathematics Olympiad</a> will be taking place on Thursday, 28 July 2019. I have been writing about some of the problems from the senior paper from 2018. A list of all of the problems can be found <a href="http://www.mathemafrica.org/?p=15215" target="_blank">here</a>.</p>
<p>Today we will look at the sixth and final problem from the 2018 South African Mathematics Olympiad:</p>
<blockquote>
<p>Let <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" /> be a positive integer, and let <img src="//s0.wp.com/latex.php?latex=x_1%2C+x_2%2C+%5Cdots%2C+x_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_1, x_2, &#92;dots, x_n" title="x_1, x_2, &#92;dots, x_n" class="latex" /> be distinct positive integers with <img src="//s0.wp.com/latex.php?latex=x_1+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_1 = 1" title="x_1 = 1" class="latex" />. Construct an <img src="//s0.wp.com/latex.php?latex=n+%5Ctimes+3&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n &#92;times 3" title="n &#92;times 3" class="latex" /> table where the entries of the <img src="//s0.wp.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="k" title="k" class="latex" />-th row are <img src="//s0.wp.com/latex.php?latex=x_k%2C+2x_k%2C+3x_k&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_k, 2x_k, 3x_k" title="x_k, 2x_k, 3x_k" class="latex" /> for <img src="//s0.wp.com/latex.php?latex=k+%3D+1%2C+2%2C+%5Cdots%2C+n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="k = 1, 2, &#92;dots, n" title="k = 1, 2, &#92;dots, n" class="latex" />. Now follow a procedure where, in each step, two identical entries are removed from the table. This continues until there are no more identical entries in the table.</p>
<ol>
<li>Prove that at least three entries remain at the end of the procedure.</li>
<li>Prove that there are infinitely many possible choices for <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" /> and <img src="//s0.wp.com/latex.php?latex=x_1%2C+x_2%2C+%5Cdots%2C+x_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_1, x_2, &#92;dots, x_n" title="x_1, x_2, &#92;dots, x_n" class="latex" /> such that only three entries remain,</li>
</ol>
</blockquote>
<p>There are some heuristics that are often helpful when solving a problem, such as</p>
<ul>
<li><b>Looking at small cases:</b>
<p>This helps us to understand the problem and how the various pieces in the problem relate to each other.</p></li></ul>&hellip;]]></content:encoded>
			<wfw:commentRss>http://www.mathemafrica.org/?feed=rss2&#038;p=15416</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>The 2018 South African Mathematics Olympiad — Problem 5</title>
		<link>http://www.mathemafrica.org/?p=15351</link>
		<comments>http://www.mathemafrica.org/?p=15351#comments</comments>
		<pubDate>Sun, 21 Jul 2019 12:03:57 +0000</pubDate>
		<dc:creator><![CDATA[Dylan Nelson]]></dc:creator>
				<category><![CDATA[Competition]]></category>
		<category><![CDATA[English]]></category>
		<category><![CDATA[contest]]></category>
		<category><![CDATA[number theory]]></category>
		<category><![CDATA[SAMO]]></category>
		<category><![CDATA[sequences]]></category>

		<guid isPermaLink="false">http://www.mathemafrica.org/?p=15351</guid>
		<description><![CDATA[<p>The final round of the <a href="http://www.mathemafrica.org/?p=15190" target="_blank">South African Mathematics Olympiad</a> will be taking place on Thursday, 28 July 2019. I have been writing about some of the problems from the senior paper from 2018. A list of all of the problems can be found <a href="http://www.mathemafrica.org/?p=15215" target="_blank">here</a>.</p>
<p>Today we will look at the fifth problem from the 2018 South African Mathematics Olympiad:<br />
<blockquote>
<p>Determine all sequences <img src="//s0.wp.com/latex.php?latex=a_1%2C+a_2%2C+a_3%2C+%5Cldots&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_1, a_2, a_3, &#92;ldots" title="a_1, a_2, a_3, &#92;ldots" class="latex" /> of nonnegative integers such that <img src="//s0.wp.com/latex.php?latex=a_1+%3C+a_2+%3C+a_3+%3C+%5Cldots&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_1 &#60; a_2 &#60; a_3 &#60; &#92;ldots" title="a_1 &#60; a_2 &#60; a_3 &#60; &#92;ldots" class="latex" />, and <img src="//s0.wp.com/latex.php?latex=a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_n" title="a_n" class="latex" /> divides <img src="//s0.wp.com/latex.php?latex=a_%7Bn+-+1%7D+%2B+n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_{n - 1} + n" title="a_{n - 1} + n" class="latex" /> for all <img src="//s0.wp.com/latex.php?latex=n+%5Cgeq+2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n &#92;geq 2" title="n &#92;geq 2" class="latex" />.</p>
</blockquote>
</p><p>Since the sequence <img src="//s0.wp.com/latex.php?latex=a_1%2C+a_2%2C+%5Cldots&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_1, a_2, &#92;ldots" title="a_1, a_2, &#92;ldots" class="latex" /> is strictly increasing, we know that <img src="//s0.wp.com/latex.php?latex=a_n+%5Cgeq+n+-+1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_n &#92;geq n - 1" title="a_n &#92;geq n - 1" class="latex" /> for all positive integers <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />. (We could prove this rigorously by induction.) This means that <img src="//s0.wp.com/latex.php?latex=a_%7Bn+-+1%7D+%2B+n+%5Cleq+%28a_n+-+1%29+%2B+%28a_n+%2B+1%29+%3D+2a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_{n - 1} + n &#92;leq (a_n - 1) + (a_n + 1) = 2a_n" title="a_{n - 1} + n &#92;leq (a_n - 1) + (a_n + 1) = 2a_n" class="latex" /> for all <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />, and so we know that <img src="//s0.wp.com/latex.php?latex=a_%7Bn+-+1%7D+%2B+n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_{n - 1} + n" title="a_{n - 1} + n" class="latex" /> is equal to either <img src="//s0.wp.com/latex.php?latex=a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_n" title="a_n" class="latex" />, or to <img src="//s0.wp.com/latex.php?latex=2a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="2a_n" title="2a_n" class="latex" /> for all positive integers <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />. Perhaps we should try to figure out exactly when it is equal to <img src="//s0.wp.com/latex.php?latex=a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_n" title="a_n" class="latex" />, and when it is equal to <img src="//s0.wp.com/latex.php?latex=2a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="2a_n" title="2a_n" class="latex" />. If we knew, for example, that we always have that <img src="//s0.wp.com/latex.php?latex=a_%7Bn+-+1%7D+%2B+n+%3D+a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_{n - 1} + n = a_n" title="a_{n - 1} + n = a_n" class="latex" />, then we have reduced the problem to solving this recurrence relation.&#8230;</p>]]></description>
				<content:encoded><![CDATA[<p>The final round of the <a href="http://www.mathemafrica.org/?p=15190" target="_blank">South African Mathematics Olympiad</a> will be taking place on Thursday, 28 July 2019. I have been writing about some of the problems from the senior paper from 2018. A list of all of the problems can be found <a href="http://www.mathemafrica.org/?p=15215" target="_blank">here</a>.</p>
<p>Today we will look at the fifth problem from the 2018 South African Mathematics Olympiad:<br />
<blockquote>
<p>Determine all sequences <img src="//s0.wp.com/latex.php?latex=a_1%2C+a_2%2C+a_3%2C+%5Cldots&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_1, a_2, a_3, &#92;ldots" title="a_1, a_2, a_3, &#92;ldots" class="latex" /> of nonnegative integers such that <img src="//s0.wp.com/latex.php?latex=a_1+%3C+a_2+%3C+a_3+%3C+%5Cldots&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_1 &lt; a_2 &lt; a_3 &lt; &#92;ldots" title="a_1 &lt; a_2 &lt; a_3 &lt; &#92;ldots" class="latex" />, and <img src="//s0.wp.com/latex.php?latex=a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_n" title="a_n" class="latex" /> divides <img src="//s0.wp.com/latex.php?latex=a_%7Bn+-+1%7D+%2B+n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_{n - 1} + n" title="a_{n - 1} + n" class="latex" /> for all <img src="//s0.wp.com/latex.php?latex=n+%5Cgeq+2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n &#92;geq 2" title="n &#92;geq 2" class="latex" />.</p>
</blockquote>
</p><p>Since the sequence <img src="//s0.wp.com/latex.php?latex=a_1%2C+a_2%2C+%5Cldots&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_1, a_2, &#92;ldots" title="a_1, a_2, &#92;ldots" class="latex" /> is strictly increasing, we know that <img src="//s0.wp.com/latex.php?latex=a_n+%5Cgeq+n+-+1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_n &#92;geq n - 1" title="a_n &#92;geq n - 1" class="latex" /> for all positive integers <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />. (We could prove this rigorously by induction.) This means that <img src="//s0.wp.com/latex.php?latex=a_%7Bn+-+1%7D+%2B+n+%5Cleq+%28a_n+-+1%29+%2B+%28a_n+%2B+1%29+%3D+2a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_{n - 1} + n &#92;leq (a_n - 1) + (a_n + 1) = 2a_n" title="a_{n - 1} + n &#92;leq (a_n - 1) + (a_n + 1) = 2a_n" class="latex" /> for all <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />, and so we know that <img src="//s0.wp.com/latex.php?latex=a_%7Bn+-+1%7D+%2B+n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_{n - 1} + n" title="a_{n - 1} + n" class="latex" /> is equal to either <img src="//s0.wp.com/latex.php?latex=a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_n" title="a_n" class="latex" />, or to <img src="//s0.wp.com/latex.php?latex=2a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="2a_n" title="2a_n" class="latex" /> for all positive integers <img src="//s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />. Perhaps we should try to figure out exactly when it is equal to <img src="//s0.wp.com/latex.php?latex=a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_n" title="a_n" class="latex" />, and when it is equal to <img src="//s0.wp.com/latex.php?latex=2a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="2a_n" title="2a_n" class="latex" />. If we knew, for example, that we always have that <img src="//s0.wp.com/latex.php?latex=a_%7Bn+-+1%7D+%2B+n+%3D+a_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a_{n - 1} + n = a_n" title="a_{n - 1} + n = a_n" class="latex" />, then we have reduced the problem to solving this recurrence relation.&hellip;</p>]]></content:encoded>
			<wfw:commentRss>http://www.mathemafrica.org/?feed=rss2&#038;p=15351</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>The 2018 South African Mathematics Olympiad — Problem 2</title>
		<link>http://www.mathemafrica.org/?p=15219</link>
		<comments>http://www.mathemafrica.org/?p=15219#comments</comments>
		<pubDate>Mon, 15 Jul 2019 13:10:50 +0000</pubDate>
		<dc:creator><![CDATA[Dylan Nelson]]></dc:creator>
				<category><![CDATA[Competition]]></category>
		<category><![CDATA[contest]]></category>
		<category><![CDATA[geometry]]></category>
		<category><![CDATA[ratios]]></category>
		<category><![CDATA[SAMO]]></category>
		<category><![CDATA[similar triangles]]></category>

		<guid isPermaLink="false">http://www.mathemafrica.org/?p=15219</guid>
		<description><![CDATA[<p>The final round of the <a href="http://www.mathemafrica.org/?p=15190" target="_blank">South African Mathematics Olympiad</a> will be taking place on Thursday, 28 July 2019. In the week and half leading up the the contest, I plan to take a look at some of the problems from the senior paper in 2018, and have already written about the <a href="http://www.mathemafrica.org/?p=15210" target="_blank">first problem</a></p>
<p>The second problem from the 2018 South African Mathematics Olympiad was</p>
<blockquote>
<p>In triangle <img src="//s0.wp.com/latex.php?latex=ABC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="ABC" title="ABC" class="latex" />, <img src="//s0.wp.com/latex.php?latex=AB+%3D+AC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="AB = AC" title="AB = AC" class="latex" />, and <img src="//s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D" title="D" class="latex" /> is on <img src="//s0.wp.com/latex.php?latex=BC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="BC" title="BC" class="latex" />. A point <img src="//s0.wp.com/latex.php?latex=E&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="E" title="E" class="latex" /> is chosen on <img src="//s0.wp.com/latex.php?latex=AC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="AC" title="AC" class="latex" />, and a point <img src="//s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> is chosen on <img src="//s0.wp.com/latex.php?latex=AB&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="AB" title="AB" class="latex" />, such that <img src="//s0.wp.com/latex.php?latex=DE+%3D+DC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="DE = DC" title="DE = DC" class="latex" /> and <img src="//s0.wp.com/latex.php?latex=DF+%3D+DB&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="DF = DB" title="DF = DB" class="latex" />. It is given that <img src="//s0.wp.com/latex.php?latex=%5Cfrac%7BDC%7D%7BBD%7D+%3D+2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;frac{DC}{BD} = 2" title="&#92;frac{DC}{BD} = 2" class="latex" /> and <img src="//s0.wp.com/latex.php?latex=%5Cfrac%7BAF%7D%7BAE%7D+%3D+5&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;frac{AF}{AE} = 5" title="&#92;frac{AF}{AE} = 5" class="latex" />. Determine the value of <img src="//s0.wp.com/latex.php?latex=%5Cfrac%7BAB%7D%7BBC%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;frac{AB}{BC}" title="&#92;frac{AB}{BC}" class="latex" />.</p>
</blockquote>
<p>The first step of solving any geometry problem should always be to draw a sketch. This helps you to understand how different parts of the figure relate to each other, and an accurate sketch may help you to form conjectures. Sometimes having a deliberately inaccurate sketch on hand is also helpful as it may help to avoid circular reasoning.&#8230;</p>]]></description>
				<content:encoded><![CDATA[<p>The final round of the <a href="http://www.mathemafrica.org/?p=15190" target="_blank">South African Mathematics Olympiad</a> will be taking place on Thursday, 28 July 2019. In the week and half leading up the the contest, I plan to take a look at some of the problems from the senior paper in 2018, and have already written about the <a href="http://www.mathemafrica.org/?p=15210" target="_blank">first problem</a></p>
<p>The second problem from the 2018 South African Mathematics Olympiad was</p>
<blockquote>
<p>In triangle <img src="//s0.wp.com/latex.php?latex=ABC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="ABC" title="ABC" class="latex" />, <img src="//s0.wp.com/latex.php?latex=AB+%3D+AC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="AB = AC" title="AB = AC" class="latex" />, and <img src="//s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D" title="D" class="latex" /> is on <img src="//s0.wp.com/latex.php?latex=BC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="BC" title="BC" class="latex" />. A point <img src="//s0.wp.com/latex.php?latex=E&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="E" title="E" class="latex" /> is chosen on <img src="//s0.wp.com/latex.php?latex=AC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="AC" title="AC" class="latex" />, and a point <img src="//s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> is chosen on <img src="//s0.wp.com/latex.php?latex=AB&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="AB" title="AB" class="latex" />, such that <img src="//s0.wp.com/latex.php?latex=DE+%3D+DC&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="DE = DC" title="DE = DC" class="latex" /> and <img src="//s0.wp.com/latex.php?latex=DF+%3D+DB&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="DF = DB" title="DF = DB" class="latex" />. It is given that <img src="//s0.wp.com/latex.php?latex=%5Cfrac%7BDC%7D%7BBD%7D+%3D+2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;frac{DC}{BD} = 2" title="&#92;frac{DC}{BD} = 2" class="latex" /> and <img src="//s0.wp.com/latex.php?latex=%5Cfrac%7BAF%7D%7BAE%7D+%3D+5&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;frac{AF}{AE} = 5" title="&#92;frac{AF}{AE} = 5" class="latex" />. Determine the value of <img src="//s0.wp.com/latex.php?latex=%5Cfrac%7BAB%7D%7BBC%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;frac{AB}{BC}" title="&#92;frac{AB}{BC}" class="latex" />.</p>
</blockquote>
<p>The first step of solving any geometry problem should always be to draw a sketch. This helps you to understand how different parts of the figure relate to each other, and an accurate sketch may help you to form conjectures. Sometimes having a deliberately inaccurate sketch on hand is also helpful as it may help to avoid circular reasoning.&hellip;</p>]]></content:encoded>
			<wfw:commentRss>http://www.mathemafrica.org/?feed=rss2&#038;p=15219</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>The 2018 South African Mathematics Olympiad — Problem 1</title>
		<link>http://www.mathemafrica.org/?p=15210</link>
		<comments>http://www.mathemafrica.org/?p=15210#comments</comments>
		<pubDate>Sat, 13 Jul 2019 10:28:18 +0000</pubDate>
		<dc:creator><![CDATA[Dylan Nelson]]></dc:creator>
				<category><![CDATA[Competition]]></category>
		<category><![CDATA[contest]]></category>
		<category><![CDATA[diophantine equations]]></category>
		<category><![CDATA[SAMO]]></category>

		<guid isPermaLink="false">http://www.mathemafrica.org/?p=15210</guid>
		<description><![CDATA[<p><!-- Title: The 2018 South African Mathematics Olympiad — Problem 1 --></p>
<p>The final round of the <a href="http://www.mathemafrica.org/?p=15190" target="_blank">South African Mathematics Olympiad</a> will be taking place on Thursday, 28 July 2019. In the two weeks leading up to the contest, I plan to take a look at some of the problems from the senior paper from 2018.</p>
<p>The first problem from the 2018 South African Mathematics Olympiad was</p>
<blockquote><p>
One hundred empty glasses are arranged in a <img src="//s0.wp.com/latex.php?latex=10+%5Ctimes+10&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="10 &#92;times 10" title="10 &#92;times 10" class="latex" /> array. Now we pick <img src="//s0.wp.com/latex.php?latex=a&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a" title="a" class="latex" /> of the rows and pour blue liquid into all glasses in these rows, so that they are half full. The remaining rows are filled halfway with yellow liquid. Afterwards, we pick <img src="//s0.wp.com/latex.php?latex=b&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="b" title="b" class="latex" /> of the columns and fill them up with blue liquid. The remaining columns are filled with yellow liquid. The mixture of blue and yellow liquid turns green. If both halves have the same colour, then that colour remains as is.</p>
<ol>
<li>Determine all possible combinations of values for <img src="//s0.wp.com/latex.php?latex=a&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a" title="a" class="latex" /> and <img src="//s0.wp.com/latex.php?latex=b&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="b" title="b" class="latex" /> so that exactly half of the glasses contain green liquid at the end.</li></ol></blockquote>&#8230;]]></description>
				<content:encoded><![CDATA[<p><!-- Title: The 2018 South African Mathematics Olympiad — Problem 1 --></p>
<p>The final round of the <a href="http://www.mathemafrica.org/?p=15190" target="_blank">South African Mathematics Olympiad</a> will be taking place on Thursday, 28 July 2019. In the two weeks leading up to the contest, I plan to take a look at some of the problems from the senior paper from 2018.</p>
<p>The first problem from the 2018 South African Mathematics Olympiad was</p>
<blockquote><p>
One hundred empty glasses are arranged in a <img src="//s0.wp.com/latex.php?latex=10+%5Ctimes+10&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="10 &#92;times 10" title="10 &#92;times 10" class="latex" /> array. Now we pick <img src="//s0.wp.com/latex.php?latex=a&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a" title="a" class="latex" /> of the rows and pour blue liquid into all glasses in these rows, so that they are half full. The remaining rows are filled halfway with yellow liquid. Afterwards, we pick <img src="//s0.wp.com/latex.php?latex=b&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="b" title="b" class="latex" /> of the columns and fill them up with blue liquid. The remaining columns are filled with yellow liquid. The mixture of blue and yellow liquid turns green. If both halves have the same colour, then that colour remains as is.</p>
<ol>
<li>Determine all possible combinations of values for <img src="//s0.wp.com/latex.php?latex=a&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a" title="a" class="latex" /> and <img src="//s0.wp.com/latex.php?latex=b&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="b" title="b" class="latex" /> so that exactly half of the glasses contain green liquid at the end.</li></ol></blockquote>&hellip;]]></content:encoded>
			<wfw:commentRss>http://www.mathemafrica.org/?feed=rss2&#038;p=15210</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
