<?xml version="1.0" encoding="utf-8"?>
			
			<rss version="2.0" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:cc="http://web.resource.org/cc/" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd">

			<channel>
			<title>Coder&apos;s Revolution - Mathmatics</title>
			<link>http://www.codersrevolution.com/index.cfm</link>
			<description>Following RIA&apos;s, Adobe products, and coding in general.</description>
			<language>en-us</language>
			<pubDate>Thu, 02 Sep 2010 17:35:15 -0500</pubDate>
			<lastBuildDate>Fri, 14 Aug 2009 23:24:00 -0500</lastBuildDate>
			<generator>BlogCFC</generator>
			<docs>http://blogs.law.harvard.edu/tech/rss</docs>
			<managingEditor>brad@codersrevolution.com</managingEditor>
			<webMaster>brad@codersrevolution.com</webMaster>
			<itunes:subtitle></itunes:subtitle>
			<itunes:summary></itunes:summary>
			<itunes:category text="Technology" />
			<itunes:category text="Technology">
				<itunes:category text="Podcasting" />
			</itunes:category>
			<itunes:category text="Technology">
				<itunes:category text="Tech News" />
			</itunes:category>
			<itunes:keywords></itunes:keywords>
			<itunes:author></itunes:author>
			<itunes:owner>
				<itunes:email>brad@codersrevolution.com</itunes:email>
				<itunes:name></itunes:name>
			</itunes:owner>
			
			<itunes:explicit>no</itunes:explicit>
			
			
			
			
			
			<item>
				<title>ColdFusion UDF: Calculate A Number&apos;s Divisors</title>
				<link>http://www.codersrevolution.com/index.cfm/2009/8/14/ColdFusion-UDF-Calculate-A-Numbers-Divisors</link>
				<description>
				
				Here&apos;s another UDF I was tinkering with last week.  I wanted to be able to count all of the numbers that divided evenly into a given integer.  I couldn&apos;t find a ColdFusion implementation, so after getting some advice from &lt;a href=&quot;http://stackoverflow.com/questions/110344/algorithm-to-calculate-the-number-of-divisors-of-a-given-number&quot; target=&quot;_new&quot;&gt;Stack Overflow&lt;/a&gt; I created my own.
				 [More]
				</description>
						
				
				<category>Mathmatics</category>				
				
				<category>Performance</category>				
				
				<category>ColdFusion</category>				
				
				<pubDate>Fri, 14 Aug 2009 23:24:00 -0500</pubDate>
				<guid>http://www.codersrevolution.com/index.cfm/2009/8/14/ColdFusion-UDF-Calculate-A-Numbers-Divisors</guid>
				
				
			</item>
			
		 	
			
			
			<item>
				<title>Calculate Prime Numbers: Sieve of Eratosthenes</title>
				<link>http://www.codersrevolution.com/index.cfm/2009/8/13/Calculate-Prime-Numbers-Sieve-of-Eratosthenes</link>
				<description>
				
				Ahh... the quintessential math problem-- finding prime numbers.  Last week while tinkering with a &lt;a target=&quot;_new&quot; href=&quot;http://thedailywtf.com/Articles/Nerds,-Jocks,-and-Lockers.aspx&quot;&gt;math challenge&lt;/a&gt; I needed to find all of the primes up to a given number.  There was &lt;a target=&quot;_new&quot; href=&quot;http://www.cflib.org/udf/GetPrimes&quot;&gt;a version&lt;/a&gt; on &lt;a target=&quot;_new&quot; href=&quot;http://www.cflib.org/&quot;&gt;cflib.org&lt;/a&gt;, but I thought I could do it in less code, so I dug in myself.
				 [More]
				</description>
						
				
				<category>Mathmatics</category>				
				
				<category>Performance</category>				
				
				<category>ColdFusion</category>				
				
				<pubDate>Thu, 13 Aug 2009 23:34:00 -0500</pubDate>
				<guid>http://www.codersrevolution.com/index.cfm/2009/8/13/Calculate-Prime-Numbers-Sieve-of-Eratosthenes</guid>
				
				
			</item>
			
		 	
			</channel></rss>