<?xml version="1.0" encoding="iso-8859-1"?>
<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/">
	<channel>
		<title>Counting &amp; Probability</title>
		<link>http://themathforum.forumotion.com/counting-probability-f5/-t1.htm</link>
		<description></description>
		<lastBuildDate>Mon, 15 Sep 2008 02:32:16 GMT</lastBuildDate>
		<ttl>10</ttl>
		<image>
			<title>Counting &amp; Probability</title>
			<url>http://www.cyneer.com/nxtwiki/uploads/Main/favicon1.ico</url>
			<link>http://themathforum.forumotion.com/counting-probability-f5/-t1.htm</link>
		</image>
		<item>
			<title>SPAM!!</title>
			<link>http://themathforum.forumotion.com/counting-probability-f5/spam-t121.htm</link>
			<dc:creator>spammer</dc:creator>
			<description><![CDATA[<img src="http://illiweb.com/fa/i/smiles/icon_twisted.gif" alt="Twisted Evil" longdesc="13" />  <img src="http://illiweb.com/fa/i/smiles/icon_evil.gif" alt="Evil or Very Mad" longdesc="12" />  <img src="http://illiweb.com/fa/i/smiles/icon_twisted.gif" alt="Twisted Evil" longdesc="13" />  <img src="http://illiweb.com/fa/i/smiles/icon_evil.gif" alt="Evil or Very Mad" longdesc="12" />  <img src="http://illiweb.com/fa/i/smiles/icon_basketball.gif" alt="Basketball" longdesc="41" />]]></description>
			<category>Counting &amp; Probability</category>
			<pubDate>Mon, 15 Sep 2008 02:32:16 GMT</pubDate>
			<comments>http://themathforum.forumotion.com/counting-probability-f5/spam-t121.htm#609</comments>
			<guid>http://themathforum.forumotion.com/counting-probability-f5/spam-t121.htm</guid>
		</item>
		<item>
			<title>Combinatorics</title>
			<link>http://themathforum.forumotion.com/counting-probability-f5/combinatorics-t109.htm</link>
			<dc:creator>hunter34</dc:creator>
			<description><![CDATA[How many of the first 100 positive integers are expressible as a sum of three or fewer members of the set
<br />
{3^0, 3^1, 3^2, 3^3, 3^4} if we are allowed to use the same power more than once. For example, 5 can be represented, but 8 cannot.
<br />

<br />
1994 UNC Charlotte Comprehensive Exam]]></description>
			<category>Counting &amp; Probability</category>
			<pubDate>Sun, 07 Sep 2008 17:02:02 GMT</pubDate>
			<comments>http://themathforum.forumotion.com/counting-probability-f5/combinatorics-t109.htm#577</comments>
			<guid>http://themathforum.forumotion.com/counting-probability-f5/combinatorics-t109.htm</guid>
		</item>
		<item>
			<title>Easy Counting</title>
			<link>http://themathforum.forumotion.com/counting-probability-f5/easy-counting-t17.htm</link>
			<dc:creator>skittles</dc:creator>
			<description>Find the number of ways the letters from the word SUPERCALIFRAGILISTICEXPEALIDOCIOUS can be arranged, using all of the letters.</description>
			<category>Counting &amp; Probability</category>
			<pubDate>Thu, 14 Aug 2008 00:50:47 GMT</pubDate>
			<comments>http://themathforum.forumotion.com/counting-probability-f5/easy-counting-t17.htm#30</comments>
			<guid>http://themathforum.forumotion.com/counting-probability-f5/easy-counting-t17.htm</guid>
		</item>
		<item>
			<title>Simple Problem:</title>
			<link>http://themathforum.forumotion.com/counting-probability-f5/simple-problem-t7.htm</link>
			<dc:creator>AIME15</dc:creator>
			<description><![CDATA[Ed, Edd, and Eddy want to go to the movie theater.  In how many orders can they sit in?
<br />

<br />
Answer:  Ed has 3 choices, Edd has 2, and Eddy has one.  So our answer is 3*2*1=6.
<br />

<br />
Note: 3*2*1 is the same as 3!.  In general, n!=n*(n-1)(n-2)...*2*1.]]></description>
			<category>Counting &amp; Probability</category>
			<pubDate>Wed, 13 Aug 2008 21:48:41 GMT</pubDate>
			<comments>http://themathforum.forumotion.com/counting-probability-f5/simple-problem-t7.htm#8</comments>
			<guid>http://themathforum.forumotion.com/counting-probability-f5/simple-problem-t7.htm</guid>
		</item>
	</channel>
</rss>