<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: Patterns in the Last Digits of the Positive Powers of Two</title>
	<atom:link href="http://www.exploringbinary.com/patterns-in-the-last-digits-of-the-positive-powers-of-two/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.exploringbinary.com/patterns-in-the-last-digits-of-the-positive-powers-of-two/</link>
	<description>Binary Numbers, Binary Code, and Binary Logic</description>
	<lastBuildDate>Mon, 30 Jan 2012 01:37:52 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Rick Regan</title>
		<link>http://www.exploringbinary.com/patterns-in-the-last-digits-of-the-positive-powers-of-two/comment-page-1/#comment-4458</link>
		<dc:creator>Rick Regan</dc:creator>
		<pubDate>Wed, 15 Dec 2010 19:53:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.exploringbinary.com/?p=249#comment-4458</guid>
		<description>David,

Yes, &lt;a href=&quot;http://www.exploringbinary.com/cycle-length-of-powers-of-two-mod-powers-of-ten/&quot; title=&quot;Read Rick Regan&#039;s Article &#8220;Cycle Length of Powers of Two Mod Powers of Ten&#8221;&quot; rel=&quot;nofollow&quot;&gt;my proof&lt;/a&gt; is a little long, though I was happy the way it turned out (it took quite a bit of work to do). If your proof is simpler, I&#039;d love to see it, or at least some more of the details.

BTW, would your technique work for proving the &lt;a href=&quot;http://www.exploringbinary.com/cycle-length-of-powers-of-five-mod-powers-of-ten/&quot; title=&quot;Read Rick Regan&#039;s Article &#8220;Cycle Length of Powers of Five Mod Powers of Ten&#8221;&quot; rel=&quot;nofollow&quot;&gt;cycle length of powers of &lt;em&gt;five&lt;/em&gt; mod powers of ten&lt;/a&gt;? I rather liked how I did that one, with the recursive factoring of differences of squares.</description>
		<content:encoded><![CDATA[<p>David,</p>
<p>Yes, <a href="http://www.exploringbinary.com/cycle-length-of-powers-of-two-mod-powers-of-ten/" title="Read Rick Regan's Article &ldquo;Cycle Length of Powers of Two Mod Powers of Ten&rdquo;" rel="nofollow">my proof</a> is a little long, though I was happy the way it turned out (it took quite a bit of work to do). If your proof is simpler, I&#8217;d love to see it, or at least some more of the details.</p>
<p>BTW, would your technique work for proving the <a href="http://www.exploringbinary.com/cycle-length-of-powers-of-five-mod-powers-of-ten/" title="Read Rick Regan's Article &ldquo;Cycle Length of Powers of Five Mod Powers of Ten&rdquo;" rel="nofollow">cycle length of powers of <em>five</em> mod powers of ten</a>? I rather liked how I did that one, with the recursive factoring of differences of squares.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: David Bandel</title>
		<link>http://www.exploringbinary.com/patterns-in-the-last-digits-of-the-positive-powers-of-two/comment-page-1/#comment-4457</link>
		<dc:creator>David Bandel</dc:creator>
		<pubDate>Wed, 15 Dec 2010 18:38:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.exploringbinary.com/?p=249#comment-4457</guid>
		<description>I also noticed the digits of the powers of two cycled with a period growing by a factor of five per digit. Never thought to google the result.

I proved it as well but I did it more simply using group theory. Starting from the assumption that the period didn&#039;t multiply by five per digit I arrived at a non-commutative cyclic group. But we know that all cyclic groups are Abelian.</description>
		<content:encoded><![CDATA[<p>I also noticed the digits of the powers of two cycled with a period growing by a factor of five per digit. Never thought to google the result.</p>
<p>I proved it as well but I did it more simply using group theory. Starting from the assumption that the period didn&#8217;t multiply by five per digit I arrived at a non-commutative cyclic group. But we know that all cyclic groups are Abelian.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Carnival of Mathematics #59 &#171; The Number Warrior</title>
		<link>http://www.exploringbinary.com/patterns-in-the-last-digits-of-the-positive-powers-of-two/comment-page-1/#comment-4240</link>
		<dc:creator>Carnival of Mathematics #59 &#171; The Number Warrior</dc:creator>
		<pubDate>Fri, 06 Nov 2009 07:08:18 +0000</pubDate>
		<guid isPermaLink="false">http://www.exploringbinary.com/?p=249#comment-4240</guid>
		<description>[...] Rick Regan of Exploring Binary finds patterns in the last digits of the positive powers of two. [...]</description>
		<content:encoded><![CDATA[<p>[...] Rick Regan of Exploring Binary finds patterns in the last digits of the positive powers of two. [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

