<?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</title>
	<atom:link href="http://homeworkhowto.com/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>Dedekind Cuts</title>
		<link>http://homeworkhowto.com/dedekind-cuts/</link>
		<comments>http://homeworkhowto.com/dedekind-cuts/#comments</comments>
		<pubDate>Wed, 06 Jan 2010 01:52:05 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[algebra]]></category>
		<category><![CDATA[between]]></category>
		<category><![CDATA[cut]]></category>
		<category><![CDATA[Dedekind]]></category>
		<category><![CDATA[elements]]></category>
		<category><![CDATA[empty]]></category>
		<category><![CDATA[gap]]></category>
		<category><![CDATA[greater]]></category>
		<category><![CDATA[integer]]></category>
		<category><![CDATA[irrational]]></category>
		<category><![CDATA[less]]></category>
		<category><![CDATA[line]]></category>
		<category><![CDATA[non]]></category>
		<category><![CDATA[non-empty]]></category>
		<category><![CDATA[numbers]]></category>
		<category><![CDATA[partition]]></category>
		<category><![CDATA[rational]]></category>
		<category><![CDATA[Richard]]></category>
		<category><![CDATA[sets]]></category>
		<category><![CDATA[than]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/dedekind-cuts/</guid>
		<description><![CDATA[How to Determine Dedekind Cuts


Description

A detailed tutorial on how to determine Dedekind cuts. Step by step tutorial including several examples of Dedekind cuts for reference.

Overview

A Dedekind cut is a partition of rational numbers into two non-empty sets A and B, such that all elements of A are less than elements of B, and A has [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>How to Determine Dedekind Cuts</strong></h3>
<p><a href="http://homeworkhowto.com/dedekind-cuts/"><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 how to determine Dedekind cuts. Step by step tutorial including several examples of Dedekind cuts for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>A <strong>Dedekind cut </strong>is a partition of rational numbers into two non-empty sets A and B, such that all elements of A are less than elements of B, and A has no greatest element. The cut itself is a gap that is located between A and B, which is normally found by creating a new, irrational number, and setting it in the gap. What irrational number you use depends on what numbers you have partitioned into the two sets. It is like the number line of advanced algebra, that has both rational and irrational numbers on it instead of just integers. The Dedekind cut was named after Richard Dedekind.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/dedekind-cuts/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Cantor-Bernstein-Schroeder Theorem</title>
		<link>http://homeworkhowto.com/cantor-bernstein-schroeder-theorem/</link>
		<comments>http://homeworkhowto.com/cantor-bernstein-schroeder-theorem/#comments</comments>
		<pubDate>Wed, 06 Jan 2010 01:43:30 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[Bernstein]]></category>
		<category><![CDATA[bijective]]></category>
		<category><![CDATA[Cantor]]></category>
		<category><![CDATA[cardinality]]></category>
		<category><![CDATA[denoted]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[equal]]></category>
		<category><![CDATA[equipollent]]></category>
		<category><![CDATA[Ernst]]></category>
		<category><![CDATA[Felix]]></category>
		<category><![CDATA[function]]></category>
		<category><![CDATA[Georg]]></category>
		<category><![CDATA[injective]]></category>
		<category><![CDATA[Schroeder]]></category>
		<category><![CDATA[theorem]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/cantor-bernstein-schroeder-theorem/</guid>
		<description><![CDATA[An Overview of the Cantor-Bernstein-Schroeder Theorem


Description

A detailed tutorial on the Cantor-Bernstein-Schroeder Theorem. Step by step tutorial including several examples of the Cantor-Bernstein-Schroeder Theorem for reference.

Overview

The Cantor-Bernstein-Schroeder Theorem states that if there exist injective functions f: A&#160;&#8211;&#62; B and g: B&#160;&#8211;&#62; A between the sets A and B, then there exists a bijective function h: A&#160;&#8211;&#62; [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>An Overview of the Cantor-Bernstein-Schroeder Theorem</strong></h3>
<p><a href="http://homeworkhowto.com/cantor-bernstein-schroeder-theorem/"><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 Cantor-Bernstein-Schroeder Theorem. Step by step tutorial including several examples of the Cantor-Bernstein-Schroeder Theorem for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>The Cantor-Bernstein-Schroeder Theorem states that if there exist injective functions f: A&nbsp;&#8211;&gt; B and g: B&nbsp;&#8211;&gt; A between the sets A and B, then there exists a bijective function h: A&nbsp;&#8211;&gt; B.&nbsp; This means that if |A| &lt; |B| and |B| &lt; |A|, then they are equipollent. Equipollent is a term that is similar to equal, and is denoted in the same way. However, the word equipollent means equal in cardinality, but not in any other way.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/cantor-bernstein-schroeder-theorem/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Isomorphism</title>
		<link>http://homeworkhowto.com/isomorphism/</link>
		<comments>http://homeworkhowto.com/isomorphism/#comments</comments>
		<pubDate>Tue, 05 Jan 2010 21:49:55 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[abstract]]></category>
		<category><![CDATA[algebra]]></category>
		<category><![CDATA[concept]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[group]]></category>
		<category><![CDATA[homomorphic]]></category>
		<category><![CDATA[homomorphism]]></category>
		<category><![CDATA[image]]></category>
		<category><![CDATA[isomorphic]]></category>
		<category><![CDATA[isomorphism]]></category>
		<category><![CDATA[ring]]></category>
		<category><![CDATA[topic]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/isomorphism/</guid>
		<description><![CDATA[Introduction to Isomorphism


Description

A detailed tutorial on isomorphism. Step by step tutorial including several examples of isomorphism for reference.

Overview

Isomorphism&#160;is a topic and concept that is commonly used in abstract algebra.&#160;Let (G, o) and (H, *) be groups. A homomorphism h: (G, o) &#8211;&#62; (H, *) that is one-to-one and onto H is called an isomorphism. If [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>Introduction to Isomorphism</strong></h3>
<p><a href="http://homeworkhowto.com/isomorphism/"><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 isomorphism. Step by step tutorial including several examples of isomorphism for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>Isomorphism&nbsp;is a topic and concept that is commonly used in abstract algebra.&nbsp;Let (G, o) and (H, *) be groups. A homomorphism h: (G, o) &#8211;&gt; (H, *) that is one-to-one and onto H is called an <strong>isomorphism</strong>. If h is an isomorphism, we say that (G, o) and (H, *) are <strong>isomorphic</strong>. Homomorphism is the inverse of isomorphism.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/isomorphism/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Homomorphism</title>
		<link>http://homeworkhowto.com/homomorphism/</link>
		<comments>http://homeworkhowto.com/homomorphism/#comments</comments>
		<pubDate>Tue, 05 Jan 2010 21:48:03 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[abstract]]></category>
		<category><![CDATA[algebra]]></category>
		<category><![CDATA[concept]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[group]]></category>
		<category><![CDATA[homomorphic]]></category>
		<category><![CDATA[homomorphism]]></category>
		<category><![CDATA[image]]></category>
		<category><![CDATA[isomorphic]]></category>
		<category><![CDATA[isomorphism]]></category>
		<category><![CDATA[ring]]></category>
		<category><![CDATA[topic]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/homomorphism/</guid>
		<description><![CDATA[Introduction to Homomorphism


Description

A detailed tutorial on homomorphism. Step by step tutorial including several examples of homomorphism for reference.

Overview

Homomorphism is a topic and concept that is commonly used in abstract algebra. Let (G, o) and (H, *) be groups. An&#160;mapping of&#160;h: (G, o)&#160;&#8211;&#62; (H, *) is called a homomorphism from (G, o) to (H, *). The [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>Introduction to Homomorphism</strong></h3>
<p><a href="http://homeworkhowto.com/homomorphism/"><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 homomorphism. Step by step tutorial including several examples of homomorphism for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>Homomorphism is a topic and concept that is commonly used in abstract algebra. Let (G, o) and (H, *) be groups. An&nbsp;mapping of&nbsp;h: (G, o)&nbsp;&#8211;&gt; (H, *) is called a <strong>homomorphism </strong>from (G, o) to (H, *). The range of h is called the <strong>homomorphic image </strong>of (G, o) under h. Isomorphism is the inverse of homomorphism.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/homomorphism/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bridge</title>
		<link>http://homeworkhowto.com/bridge/</link>
		<comments>http://homeworkhowto.com/bridge/#comments</comments>
		<pubDate>Tue, 05 Jan 2010 20:10:45 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[bridge]]></category>
		<category><![CDATA[connected]]></category>
		<category><![CDATA[disconnected]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[edge]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[resulting]]></category>
		<category><![CDATA[structure]]></category>
		<category><![CDATA[subgraph]]></category>
		<category><![CDATA[vertex]]></category>
		<category><![CDATA[vertices]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/bridge/</guid>
		<description><![CDATA[An Introduction to Bridges


Description

A detailed tutorial on mathematical bridges. Step by step tutorial including several examples of mathematical bridges for reference.

Overview

The bridge is a type of mathematical structure. When an edge is taken off of a connected graph, and the resulting graph is disconnected, that edge is considered to be a bridge. Either way, the [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>An Introduction to Bridges</strong></h3>
<p><a href="http://homeworkhowto.com/bridge/"><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 mathematical bridges. Step by step tutorial including several examples of mathematical bridges for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>The bridge is a type of mathematical structure. When an edge is taken off of a connected graph, and the resulting graph is disconnected, that edge is considered to be a bridge. Either way, the resulting graph is called a subgraph. The name &#8220;bridge&#8221; was thought up for these edges because they connect one part of the structure to another part of the structure, and are extremely important in a graph.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/bridge/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Step Function</title>
		<link>http://homeworkhowto.com/step-function/</link>
		<comments>http://homeworkhowto.com/step-function/#comments</comments>
		<pubDate>Thu, 31 Dec 2009 22:51:18 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[closed]]></category>
		<category><![CDATA[combination]]></category>
		<category><![CDATA[constant]]></category>
		<category><![CDATA[diconnected]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[ends]]></category>
		<category><![CDATA[finite]]></category>
		<category><![CDATA[function]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[intervals]]></category>
		<category><![CDATA[line]]></category>
		<category><![CDATA[linear]]></category>
		<category><![CDATA[lines]]></category>
		<category><![CDATA[open]]></category>
		<category><![CDATA[piecewise]]></category>
		<category><![CDATA[staircase]]></category>
		<category><![CDATA[step]]></category>
		<category><![CDATA[test]]></category>
		<category><![CDATA[vertical]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/step-function/</guid>
		<description><![CDATA[How to Write Step Functions


Description

A detailed tutorial on how to write step functions. Step by step tutorial including several examples of how to write step functions for reference.

Overview

A step function, also called a staircase function, is a finite linear combination composed of several different intervals.&#160; They are considered to be a piecewise constant function. The [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>How to Write Step Functions</strong></h3>
<p><a href="http://homeworkhowto.com/step-function/"><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 how to write step functions. Step by step tutorial including several examples of how to write step functions for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>A <strong>step function</strong>, also called a staircase function, is a finite linear combination composed of several different intervals.&nbsp; They are considered to be a piecewise constant function. The graph of a step function is often expressed as steps, or a staircase, which is how it got its name. It simply looks like several disconnected lines, with alternate open and closed&nbsp;ends so that it easily passes the vertical line test for functions.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/step-function/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Universe of Discourse</title>
		<link>http://homeworkhowto.com/universe-of-discourse/</link>
		<comments>http://homeworkhowto.com/universe-of-discourse/#comments</comments>
		<pubDate>Thu, 31 Dec 2009 21:22:33 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[considerations]]></category>
		<category><![CDATA[context]]></category>
		<category><![CDATA[discourse]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[element]]></category>
		<category><![CDATA[problem]]></category>
		<category><![CDATA[set]]></category>
		<category><![CDATA[subset]]></category>
		<category><![CDATA[truth]]></category>
		<category><![CDATA[universe]]></category>
		<category><![CDATA[value]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/universe-of-discourse/</guid>
		<description><![CDATA[Overview of the Universe of Discourse


Description

A detailed tutorial on the universe of discourse. Step by step tutorial including several examples of the universe of discourse for reference.

Overview

The universe of discourse is normally just referred to simply as the universe of a set. The universe of discourse can also be the universe of a certain truth [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>Overview of the Universe of Discourse</strong></h3>
<p><a href="http://homeworkhowto.com/universe-of-discourse/"><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 universe of discourse. Step by step tutorial including several examples of the universe of discourse for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>The <strong>universe of discourse </strong>is normally just referred to simply as the universe of a set. The universe of discourse can also be the universe of a certain truth set. Basically, it is all possible considerations for a truth set. It is also a set itself, one where many different subsets are taken from. As you can tell, the universe of discourse has different meanings depending on the exact branch of math you are studying. However, all definitions have one thing in common: the universe is a set where many other sets are taken from. Normally it is easy to figure out what the universe of dicourse is based on the context of the problem you are trying to solve.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/universe-of-discourse/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Disconnected Graphs</title>
		<link>http://homeworkhowto.com/disconnected-graphs/</link>
		<comments>http://homeworkhowto.com/disconnected-graphs/#comments</comments>
		<pubDate>Wed, 30 Dec 2009 01:49:38 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[closed]]></category>
		<category><![CDATA[connected]]></category>
		<category><![CDATA[direct]]></category>
		<category><![CDATA[disconnected]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[edge]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[hexagon]]></category>
		<category><![CDATA[open]]></category>
		<category><![CDATA[opposite]]></category>
		<category><![CDATA[path]]></category>
		<category><![CDATA[rectangle]]></category>
		<category><![CDATA[shape]]></category>
		<category><![CDATA[star]]></category>
		<category><![CDATA[triangle]]></category>
		<category><![CDATA[vertex]]></category>
		<category><![CDATA[vertices]]></category>
		<category><![CDATA[walk]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/disconnected-graphs/</guid>
		<description><![CDATA[How to Identify a Disconnected Graph


Description

A detailed tutorial on how to identify disconnected graphs. Step by step tutorial including several examples of disconnected graphs for reference.

Overview

A disconnected graph is a graph where not every single vertex is connected to all other vertices. Typically, graphs will have paths from all vertices, but if there is not [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>How to Identify a Disconnected Graph</strong></h3>
<p><a href="http://homeworkhowto.com/disconnected-graphs/"><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 how to identify disconnected graphs. Step by step tutorial including several examples of disconnected graphs for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>A disconnected graph is a graph where not every single vertex is connected to all other vertices. Typically, graphs will have paths from all vertices, but if there is not a direct path from each and every vertex, then it is considered to be a disconnected graph. Some common shapes that are seen that are disconnected graphs are stars, rectangles, and hexagons. The opposite of a disconnected graph is a connected graph.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/disconnected-graphs/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Connected Graphs</title>
		<link>http://homeworkhowto.com/connected-graphs/</link>
		<comments>http://homeworkhowto.com/connected-graphs/#comments</comments>
		<pubDate>Wed, 30 Dec 2009 01:46:12 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[closed]]></category>
		<category><![CDATA[connected]]></category>
		<category><![CDATA[direct]]></category>
		<category><![CDATA[disconnected]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[edge]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[hexagon]]></category>
		<category><![CDATA[open]]></category>
		<category><![CDATA[opposite]]></category>
		<category><![CDATA[path]]></category>
		<category><![CDATA[rectangle]]></category>
		<category><![CDATA[shape]]></category>
		<category><![CDATA[star]]></category>
		<category><![CDATA[triangle]]></category>
		<category><![CDATA[vertex]]></category>
		<category><![CDATA[vertices]]></category>
		<category><![CDATA[walk]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/connected-graphs/</guid>
		<description><![CDATA[How to Identify a Connected Graph

Description
 

A detailed tutorial on how to identify connected graphs. Step by step tutorial including several examples of connected graphs for reference.

 

Overview
 

A connected graph is a graph where every single vertex is connected to every other vertex. This does not mean to simply have a clear path from one vertex to [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>How to Identify a Connected Graph</strong></h3>
<p><a href="http://homeworkhowto.com/connected-graphs/"><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 on how to identify connected graphs. Step by step tutorial including several examples of connected graphs for reference.</p>
<div><strong></strong></div>
<p> </p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p> </p>
<p></strong></p>
<p>A connected graph is a graph where every single vertex is connected to every other vertex. This does not mean to simply have a clear path from one vertex to another &#8211; it means there needs to be a direct path, or an edge, between two vertices. A triangle is a commonly seen shape that is a connected graph. The opposite of a connected graph is a disconnected graph.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/connected-graphs/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Axioms and Postulates</title>
		<link>http://homeworkhowto.com/axioms-and-postulates/</link>
		<comments>http://homeworkhowto.com/axioms-and-postulates/#comments</comments>
		<pubDate>Wed, 30 Dec 2009 00:59:59 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[axioms]]></category>
		<category><![CDATA[conclusion]]></category>
		<category><![CDATA[deduced]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[examples]]></category>
		<category><![CDATA[given]]></category>
		<category><![CDATA[information]]></category>
		<category><![CDATA[postulates]]></category>
		<category><![CDATA[proofs]]></category>
		<category><![CDATA[statements]]></category>
		<category><![CDATA[terms]]></category>
		<category><![CDATA[theorems]]></category>
		<category><![CDATA[undefined]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/axioms-and-postulates/</guid>
		<description><![CDATA[How to Use Axioms and Postulates in Proofs


Description

A detailed tutorial on axioms and postulates. Step by step tutorial including several examples of axioms and postulates for reference.

Overview

Axioms, sometimes called postulates, are parts of a proof. When you write a proof, there are several important parts: the given information and statements explaining the given information, the [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>How to Use Axioms and Postulates in Proofs</strong></h3>
<p><a href="http://homeworkhowto.com/axioms-and-postulates/"><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 axioms and postulates. Step by step tutorial including several examples of axioms and postulates for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>Axioms, sometimes called postulates, are parts of a proof. When you write a proof, there are several important parts: the given information and statements explaining the given information, the proof itself along with examples, and the conclusion. Axioms and postulates are the first set of statements that contain the given information. These statements are all assumed to be true. An important part of axioms and postulates are undefined terms, from which new concepts can be assumed, and new theorems can be deduced.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/axioms-and-postulates/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
