<?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>Homework How-to &#187; infinite</title>
	<atom:link href="http://homeworkhowto.com/tag/infinite/feed/" rel="self" type="application/rss+xml" />
	<link>http://homeworkhowto.com</link>
	<description>Homework. Easy.</description>
	<lastBuildDate>Wed, 06 Jan 2010 21:14:39 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Cardinal Numbers</title>
		<link>http://homeworkhowto.com/cardinal-numbers/</link>
		<comments>http://homeworkhowto.com/cardinal-numbers/#comments</comments>
		<pubDate>Sat, 19 Dec 2009 00:43:37 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[abstract]]></category>
		<category><![CDATA[algebra]]></category>
		<category><![CDATA[analysis]]></category>
		<category><![CDATA[cardinal]]></category>
		<category><![CDATA[cardinality]]></category>
		<category><![CDATA[combinatorics]]></category>
		<category><![CDATA[elements]]></category>
		<category><![CDATA[finite]]></category>
		<category><![CDATA[infinite]]></category>
		<category><![CDATA[mathematical]]></category>
		<category><![CDATA[measure]]></category>
		<category><![CDATA[natural]]></category>
		<category><![CDATA[number]]></category>
		<category><![CDATA[set]]></category>
		<category><![CDATA[set theory]]></category>
		<category><![CDATA[size]]></category>
		<category><![CDATA[transfinite]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/cardinal-numbers/</guid>
		<description><![CDATA[How to Define Cardinal Numbers


Description

A detailed tutorial on the definition of cardinal numbers. Step by step tutorial including several examples of how to define cardinal numbers for reference.

Overview

Cardinal numbers are natural numbers that are used to measure cardinality of sets. Cardinality is a fancy way of saying the size of a set. This means the [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>How to Define Cardinal Numbers</strong></h3>
<p><a href="http://homeworkhowto.com/cardinal-numbers/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p></strong></p>
<p>A detailed tutorial on the definition of cardinal numbers. Step by step tutorial including several examples of how to define cardinal numbers for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p><strong>Cardinal numbers </strong>are natural numbers that are used to measure cardinality of sets. <strong>Cardinality </strong>is a fancy way of saying the size of a set. This means the cardinality is the number of elements in a set, provided that the set is finite. If the set is infinite, something called a transfinite cardinal number is used to describe the cardinality of the set. Cardinal numbers are a very important part of set theory, even though they are not studied often or used constantly.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/cardinal-numbers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Pigeon-Hole Principle</title>
		<link>http://homeworkhowto.com/pigeon-hole-principle/</link>
		<comments>http://homeworkhowto.com/pigeon-hole-principle/#comments</comments>
		<pubDate>Sat, 19 Dec 2009 00:32:43 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[algebra]]></category>
		<category><![CDATA[box]]></category>
		<category><![CDATA[counting]]></category>
		<category><![CDATA[Dirichlet]]></category>
		<category><![CDATA[drawer]]></category>
		<category><![CDATA[elements]]></category>
		<category><![CDATA[extension]]></category>
		<category><![CDATA[finite]]></category>
		<category><![CDATA[infinite]]></category>
		<category><![CDATA[leftover]]></category>
		<category><![CDATA[more]]></category>
		<category><![CDATA[pigeon-hole]]></category>
		<category><![CDATA[principle]]></category>
		<category><![CDATA[remainder]]></category>
		<category><![CDATA[sets]]></category>
		<category><![CDATA[shelf]]></category>
		<category><![CDATA[theory]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/pigeon-hole-principle/</guid>
		<description><![CDATA[Explanation of the Pigeon-Hole Principle


Description

A detailed tutorial on the pigeon-hole principle. Step by step tutorial including several examples of the pigeon-hole principle for reference.

Overview

The pigeon-hole principle is an important principle in math that states that if n items are to be put into m pigeon-holes, and n &#62; m, then at least one pigeon-hole must [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>Explanation of the Pigeon-Hole Principle</strong></h3>
<p><a href="http://homeworkhowto.com/pigeon-hole-principle/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p></strong></p>
<p>A detailed tutorial on the pigeon-hole principle. Step by step tutorial including several examples of the pigeon-hole principle for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>The <strong>pigeon-hole principle </strong>is an important principle in math that states that if n items are to be put into m pigeon-holes, and n &gt; m, then at least one pigeon-hole must contain more than one item. It is thought of as an extension of the counting principle. The pigeon-hole principle was first referred to as the drawer principle, or the shelf principle. Because of this, it is commonly called Dirichlet&#8217;s box&nbsp;principle or Dirichlet&#8217;s drawer principle. It is most commonly used with finite sets of elements; however, this principle can also be used with infinite sets.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/pigeon-hole-principle/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Infinite Hotel</title>
		<link>http://homeworkhowto.com/infinite-hotel/</link>
		<comments>http://homeworkhowto.com/infinite-hotel/#comments</comments>
		<pubDate>Fri, 18 Dec 2009 01:44:40 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[algebra]]></category>
		<category><![CDATA[arrivals]]></category>
		<category><![CDATA[David Hilbert]]></category>
		<category><![CDATA[double]]></category>
		<category><![CDATA[down]]></category>
		<category><![CDATA[German]]></category>
		<category><![CDATA[grand]]></category>
		<category><![CDATA[Hilbert]]></category>
		<category><![CDATA[hotel]]></category>
		<category><![CDATA[induction]]></category>
		<category><![CDATA[infinite]]></category>
		<category><![CDATA[infinity]]></category>
		<category><![CDATA[k]]></category>
		<category><![CDATA[move]]></category>
		<category><![CDATA[n!]]></category>
		<category><![CDATA[new]]></category>
		<category><![CDATA[numbers]]></category>
		<category><![CDATA[paradox]]></category>
		<category><![CDATA[room]]></category>
		<category><![CDATA[set]]></category>
		<category><![CDATA[space]]></category>
		<category><![CDATA[theory]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/infinite-hotel/</guid>
		<description><![CDATA[The Story of the Infinite Hotel


Description

A detailed tale of the Infinite Hotel. Step by step story including several pictures and an explanation of the Infinite Hotel for reference.

Overview

The Infinite Hotel is a famous math story and puzzle that was thought of by David Hilbert, a German mathematician. Sometimes the Infinite Hotel is called Hilbert&#8217;s Paradox [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>The Story of the Infinite Hotel</strong></h3>
<p><a href="http://homeworkhowto.com/infinite-hotel/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p></strong></p>
<p>A detailed tale of the Infinite Hotel. Step by step story including several pictures and an explanation of the Infinite Hotel for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>The Infinite Hotel is a famous math story and puzzle that was thought of by David Hilbert, a German mathematician. Sometimes the Infinite Hotel is called Hilbert&#8217;s Paradox of the Grand Hotel. It states that if one person comes into the hotel and all the rooms are full, they can all move down one room and the person can then take the first room. If k number of people come into the hotel and all the rooms are full, everyone can move down k number of rooms to make room for the people that just arrived. And, if double the amount of people that are already there are looking for rooms, everyone in room n can move to room 2n, making room for all the new arrivals in the odd-numbered rooms. This example of the Infinite Hotel can be used in certain forms of mathematical induction, and also in set theory and studies dealing with infinite numbers.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/infinite-hotel/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Saddle-Point Approximation</title>
		<link>http://homeworkhowto.com/saddle-point-approximation/</link>
		<comments>http://homeworkhowto.com/saddle-point-approximation/#comments</comments>
		<pubDate>Fri, 06 Nov 2009 01:44:54 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Calculus]]></category>
		<category><![CDATA[a]]></category>
		<category><![CDATA[approximation]]></category>
		<category><![CDATA[b]]></category>
		<category><![CDATA[descent]]></category>
		<category><![CDATA[differentiable]]></category>
		<category><![CDATA[function]]></category>
		<category><![CDATA[infinite]]></category>
		<category><![CDATA[infinity]]></category>
		<category><![CDATA[integral]]></category>
		<category><![CDATA[Laplace]]></category>
		<category><![CDATA[large]]></category>
		<category><![CDATA[m]]></category>
		<category><![CDATA[method]]></category>
		<category><![CDATA[number]]></category>
		<category><![CDATA[point]]></category>
		<category><![CDATA[saddle]]></category>
		<category><![CDATA[saddle-point]]></category>
		<category><![CDATA[steepest]]></category>
		<category><![CDATA[twice]]></category>
		<category><![CDATA[twice-differentiable]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/saddle-point-approximation/</guid>
		<description><![CDATA[Saddle-Point Approximation Explained


Description

A detailed tutorial on saddle-point approximation. Step by step tutorial including several examples of saddle-point approximation for reference.

Overview

Saddle-point approximation is also referred to as the method of steepest descent and Laplace&#8217;s method. It is a way of approximating integrals in the form f(x) is some twice-differentiable function, M is a large number, and [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>Saddle-Point Approximation Explained</strong></h3>
<p><a href="http://homeworkhowto.com/saddle-point-approximation/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p></strong></p>
<p>A detailed tutorial on saddle-point approximation. Step by step tutorial including several examples of saddle-point approximation for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>Saddle-point approximation is also referred to as the method of steepest descent and Laplace&#8217;s method. It is a way of approximating integrals in the form <img src='http://s.wordpress.com/latex.php?latex=%5Cint_a%5Eb%5C%21%20e%5E%7BM%20f%28x%29%7Ddx%5C%2C&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\int_a^b\! e^{M f(x)}dx\,' title='\int_a^b\! e^{M f(x)}dx\,' class='latex' />. f(x) is some twice-differentiable function, M is a large number, and the integral endpoints a and b have a possibilty of being infinite.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/saddle-point-approximation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Infinite Sets</title>
		<link>http://homeworkhowto.com/infinite-sets/</link>
		<comments>http://homeworkhowto.com/infinite-sets/#comments</comments>
		<pubDate>Thu, 15 Oct 2009 23:34:31 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[algebra]]></category>
		<category><![CDATA[countable]]></category>
		<category><![CDATA[element]]></category>
		<category><![CDATA[endpoint]]></category>
		<category><![CDATA[finite]]></category>
		<category><![CDATA[infinite]]></category>
		<category><![CDATA[infinity]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[number]]></category>
		<category><![CDATA[set]]></category>
		<category><![CDATA[trailing]]></category>
		<category><![CDATA[uncountable]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/infinite-sets/</guid>
		<description><![CDATA[Introduction to Infinite Sets


Description

A detailed tutorial on infinite sets. Step by step tutorial including several examples of infinite sets and how to identify them for reference.

Overview

There are two types of sets, finite sets and infinite sets. The tutorial will focus on infinite sets. An infinite set is a set that has at least one endpoint [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>Introduction to Infinite Sets</strong></h3>
<p><a href="http://homeworkhowto.com/infinite-sets/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p></strong></p>
<p>A detailed tutorial on infinite sets. Step by step tutorial including several examples of infinite sets and how to identify them for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>There are two types of sets, finite sets and infinite sets. The tutorial will focus on infinite sets. An <strong>infinite set </strong>is a set that has at least one endpoint of infinity, which can be implied either by having infinity in the set or by having a trailing end of the set, with no number at the end. Infinite sets can either be countable or uncountable &#8211; meaning they either have a pattern you can use to follow to infinity, or there is no pattern present.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/infinite-sets/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Finite Sets</title>
		<link>http://homeworkhowto.com/finite-sets/</link>
		<comments>http://homeworkhowto.com/finite-sets/#comments</comments>
		<pubDate>Tue, 06 Oct 2009 17:14:13 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[algebra]]></category>
		<category><![CDATA[cardinality]]></category>
		<category><![CDATA[element]]></category>
		<category><![CDATA[elements]]></category>
		<category><![CDATA[empty set]]></category>
		<category><![CDATA[finite]]></category>
		<category><![CDATA[infinite]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[natural number]]></category>
		<category><![CDATA[set]]></category>
		<category><![CDATA[sets]]></category>
		<category><![CDATA[zero]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/finite-sets/</guid>
		<description><![CDATA[Definition of a Finite Set


Description

A detailed tutorial on the definition of a finite set. Step by step tutorial including several examples of finite sets for reference.

Overview

There are many different types of sets, but one of the most common ones to run into a finite sets. A finite set is a set that has a finite [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>Definition of a Finite Set</strong></h3>
<p><a href="http://homeworkhowto.com/finite-sets/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p></strong></p>
<p>A detailed tutorial on the definition of a finite set. Step by step tutorial including several examples of finite sets for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>There are many different types of sets, but one of the most common ones to run into a <strong>finite sets</strong>. A finite set is a set that has a finite number of elements &#8211; meaning a set with a definite number of elements, such as five, or ten. The number of elements in the set must be a natural number, and it is called the cardinality of a set. An empty set is considered to be finite, with a cardiality of zero, even though zero is not considered to be a natural number.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/finite-sets/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Pascal&#8217;s Triangle</title>
		<link>http://homeworkhowto.com/pascals-triangle/</link>
		<comments>http://homeworkhowto.com/pascals-triangle/#comments</comments>
		<pubDate>Tue, 29 Sep 2009 17:12:43 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Arithmetic]]></category>
		<category><![CDATA[addition]]></category>
		<category><![CDATA[arithmetic]]></category>
		<category><![CDATA[binomial coefficients]]></category>
		<category><![CDATA[Blaise Pascal]]></category>
		<category><![CDATA[elements]]></category>
		<category><![CDATA[geometric arrangement]]></category>
		<category><![CDATA[geometric shapes]]></category>
		<category><![CDATA[infinite]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[Pascal's Rule]]></category>
		<category><![CDATA[Pascal's Triangle]]></category>
		<category><![CDATA[rows]]></category>
		<category><![CDATA[sums]]></category>
		<category><![CDATA[triangle]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/pascals-triangle/</guid>
		<description><![CDATA[An Overview of Pascal&#8217;s Triangle

Description
 

A detailed tutorial of how to use Pascal&#8217;s Triangle. Step by step tutorial including several examples of how to use Pascal&#8217;s Triangle for reference. Knowledge of Pascal&#8217;s Triangle will prove useful in several branches of mathematics.

 

Overview
 

Pascal&#8217;s Triangle is a useful device in mathematics that can reveal the sums of almost any [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>An Overview of Pascal&#8217;s Triangle</strong></h3>
<p><a href="http://homeworkhowto.com/pascals-triangle/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p> </p>
<p></strong></p>
<p>A detailed tutorial of how to use Pascal&#8217;s Triangle. Step by step tutorial including several examples of how to use Pascal&#8217;s Triangle for reference. Knowledge of Pascal&#8217;s Triangle will prove useful in several branches of mathematics.</p>
<div><strong></strong></div>
<p> </p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p> </p>
<p></strong></p>
<p><strong>Pascal&#8217;s Triangle </strong>is a useful device in mathematics that can reveal the sums of almost any number. There are an infinite number of rows but it can be shortened to any number. The triangle traditionally starts at Row 0 with one number &#8211; 1. Then Row 1 has two numbers &#8211; 1 and 1. And Row 2 has three numbers &#8211; 1, 2, and 1. The number 1 lines the side of the triangle. Every other number is the sum of the two numbers found directly above it. Pascal&#8217;s triangle is constructed by using geometric shapes.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/pascals-triangle/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

