<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: A-Math P &amp; C Qn!</title>
	<atom:link href="http://www.singaporeolevelmaths.com/2007/09/22/a-math-p-c-qn/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.singaporeolevelmaths.com/2007/09/22/a-math-p-c-qn/</link>
	<description>Simple, Practical Tips for Better Maths Results!</description>
	<lastBuildDate>Tue, 07 Sep 2010 02:10:00 +0800</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.5</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: alwaysLovely</title>
		<link>http://www.singaporeolevelmaths.com/2007/09/22/a-math-p-c-qn/comment-page-1/#comment-54</link>
		<dc:creator>alwaysLovely</dc:creator>
		<pubDate>Fri, 21 Sep 2007 12:40:00 +0000</pubDate>
		<guid isPermaLink="false">http://singaporeolevelmaths.com/2007/09/22/a-math-p-c-qn/#comment-54</guid>
		<description>well done!&lt;br/&gt;Good job!</description>
		<content:encoded><![CDATA[<p>well done!<br />Good job!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: lijun(:</title>
		<link>http://www.singaporeolevelmaths.com/2007/09/22/a-math-p-c-qn/comment-page-1/#comment-53</link>
		<dc:creator>lijun(:</dc:creator>
		<pubDate>Fri, 21 Sep 2007 12:07:00 +0000</pubDate>
		<guid isPermaLink="false">http://singaporeolevelmaths.com/2007/09/22/a-math-p-c-qn/#comment-53</guid>
		<description>hey..&lt;br/&gt;&lt;br/&gt;my amaths really isn&#039;t strong, so i hope you&#039;ll help me and correct my mistakes. thanks.&lt;br/&gt;&lt;br/&gt;anyway. here are my answers:&lt;br/&gt;&lt;br/&gt;(i)no. of ways in which 6 applicants can be selceted for the interview = 15C6 = 5005&lt;br/&gt;&lt;br/&gt;(ii)no. of ways in which the order of the six interviews can be arranged = 6! = 720&lt;br/&gt;&lt;br/&gt;number of ways in which the order of the 6 interviews can be arranged, when applicants having the same background are interviewed in succesion = 3!X2!X3! = 72&lt;br/&gt;&lt;br/&gt;&lt;br/&gt;i&#039;m quite doubtful of the last answer. haha. but i decided to try anyway. (:</description>
		<content:encoded><![CDATA[<p>hey..</p>
<p>my amaths really isn&#8217;t strong, so i hope you&#8217;ll help me and correct my mistakes. thanks.</p>
<p>anyway. here are my answers:</p>
<p>(i)no. of ways in which 6 applicants can be selceted for the interview = 15C6 = 5005</p>
<p>(ii)no. of ways in which the order of the six interviews can be arranged = 6! = 720</p>
<p>number of ways in which the order of the 6 interviews can be arranged, when applicants having the same background are interviewed in succesion = 3!X2!X3! = 72</p>
<p>i&#8217;m quite doubtful of the last answer. haha. but i decided to try anyway. (:</p>
]]></content:encoded>
	</item>
</channel>
</rss>
