<?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>Thoughts &#187; Mathematics</title>
	<atom:link href="http://aravinthan.in/blog/category/mathematics/feed/" rel="self" type="application/rss+xml" />
	<link>http://aravinthan.in/blog</link>
	<description>When neurons respond to a stimuli</description>
	<lastBuildDate>Thu, 22 Dec 2011 11:44:04 +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>Sphenic number</title>
		<link>http://aravinthan.in/blog/2008/06/12/sphenic-number/</link>
		<comments>http://aravinthan.in/blog/2008/06/12/sphenic-number/#comments</comments>
		<pubDate>Thu, 12 Jun 2008 09:30:50 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Number]]></category>

		<guid isPermaLink="false">http://aravinthan.wordpress.com/?p=85</guid>
		<description><![CDATA[In Mathematics Sphenic number is a postive integer which is a product of three distinct  prime numbers. All sphenic numbers have exactly eight divisors. If we express the sphenic number as n=p.q.r, where p, q, and r are distinct primes, then the set of divisors of n will be:  {1,p,q,r,pq,pr,qr, n}. Refer to Sphenic Number in &#8230; </p><p><a class="more-link block-button" href="http://aravinthan.in/blog/2008/06/12/sphenic-number/">Continue reading &#187;</a>]]></description>
			<content:encoded><![CDATA[<p>In Mathematics <a href="http://en.wikipedia.org/wiki/Sphenic_number">Sphenic number</a> is a postive integer which is a product of three distinct  prime numbers.</p>
<p>All sphenic numbers have exactly eight divisors. If we express the sphenic number as n=p.q.r, where <em>p</em>, <em>q</em>, and <em>r</em> are distinct primes, then the set of divisors of <em>n</em> will be:  {1,p,q,r,pq,pr,qr, n}.</p>
<p>Refer to <a href="http://en.wikipedia.org/wiki/Sphenic_number">Sphenic Number in Wiki</a> for more details.</p>
<dl>
<dd> </dd>
</dl>
]]></content:encoded>
			<wfw:commentRss>http://aravinthan.in/blog/2008/06/12/sphenic-number/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

