<?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 for Math Tricks</title>
	<atom:link href="http://mathtricks.org/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://mathtricks.org</link>
	<description>Math Tricks + Math Games = Math Fun!</description>
	<lastBuildDate>Thu, 12 Apr 2012 21:54:15 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>Comment on The Fantastic 6174 by Lesego</title>
		<link>http://mathtricks.org/mysterious-numbers/the-fantastic-6174/comment-page-1/#comment-370</link>
		<dc:creator>Lesego</dc:creator>
		<pubDate>Thu, 12 Apr 2012 21:54:15 +0000</pubDate>
		<guid isPermaLink="false">http://mathtricks.org/?p=788#comment-370</guid>
		<description>I&#039;m not a mathematician or anything but I do find this very interesting.

I would like help with solving the equation (if there is any) to get the other n-digit numbers.

2-digits : 9 or the loop shown
3-digits : 495
4-digits : 6174
5-digits : 61974
6-digits : 851742

I&#039;m trying to find the equation that can give me the numbers for any number of digits (nth-digit).

I&#039;m not sure of it exists but I&#039;m trying to incorporate 9 in the equation. Please help.

Thanks :)</description>
		<content:encoded><![CDATA[<p>I&#8217;m not a mathematician or anything but I do find this very interesting.</p>
<p>I would like help with solving the equation (if there is any) to get the other n-digit numbers.</p>
<p>2-digits : 9 or the loop shown<br />
3-digits : 495<br />
4-digits : 6174<br />
5-digits : 61974<br />
6-digits : 851742</p>
<p>I&#8217;m trying to find the equation that can give me the numbers for any number of digits (nth-digit).</p>
<p>I&#8217;m not sure of it exists but I&#8217;m trying to incorporate 9 in the equation. Please help.</p>
<p>Thanks :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Math Brain Teaser &#8211; Extra Space by Shayz</title>
		<link>http://mathtricks.org/math-tricks/math-brain-teaser-extra-space/comment-page-1/#comment-369</link>
		<dc:creator>Shayz</dc:creator>
		<pubDate>Wed, 11 Apr 2012 03:40:16 +0000</pubDate>
		<guid isPermaLink="false">http://mathtricks.org/?p=203#comment-369</guid>
		<description>The slopes of the hypotenuse for both the red and green triangles are slightly different, causing the hypotenuse of the first triangle to bend in, and the hypotenuse of the second triangle to bend out.

The slope of the green triangle is 2/5 and the slope of the red triangle is 3/8

To test this, put a straightedge up to the picture from the top right corner to the bottom left, and you will see how the hypotenuse is ever so slightly bent at the junction of these two different slopes</description>
		<content:encoded><![CDATA[<p>The slopes of the hypotenuse for both the red and green triangles are slightly different, causing the hypotenuse of the first triangle to bend in, and the hypotenuse of the second triangle to bend out.</p>
<p>The slope of the green triangle is 2/5 and the slope of the red triangle is 3/8</p>
<p>To test this, put a straightedge up to the picture from the top right corner to the bottom left, and you will see how the hypotenuse is ever so slightly bent at the junction of these two different slopes</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Fantastic 6174 by Garrett Hildebrand</title>
		<link>http://mathtricks.org/mysterious-numbers/the-fantastic-6174/comment-page-1/#comment-366</link>
		<dc:creator>Garrett Hildebrand</dc:creator>
		<pubDate>Wed, 04 Apr 2012 21:57:28 +0000</pubDate>
		<guid isPermaLink="false">http://mathtricks.org/?p=788#comment-366</guid>
		<description>I now agree with the statement that with the exception of numbers composed of the same digit (only 10 of them), all others will yield 6174. That makes this number even more remarkable to me!

The zero results I was seeing turn out to be a bug in my code. 

What was happening is that although I made sure the initial number was R#4 (right-justified in a field of zeroes), I was not doing this on the subtraction result. Consequently, certain number combinations would yield 999 as a result (for example, 5554 and 5556). So instead of subtracting 999 from 9990, it was subtracting 999 from 999.</description>
		<content:encoded><![CDATA[<p>I now agree with the statement that with the exception of numbers composed of the same digit (only 10 of them), all others will yield 6174. That makes this number even more remarkable to me!</p>
<p>The zero results I was seeing turn out to be a bug in my code. </p>
<p>What was happening is that although I made sure the initial number was R#4 (right-justified in a field of zeroes), I was not doing this on the subtraction result. Consequently, certain number combinations would yield 999 as a result (for example, 5554 and 5556). So instead of subtracting 999 from 9990, it was subtracting 999 from 999.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Fantastic 6174 by Garrett Hildebrand</title>
		<link>http://mathtricks.org/mysterious-numbers/the-fantastic-6174/comment-page-1/#comment-365</link>
		<dc:creator>Garrett Hildebrand</dc:creator>
		<pubDate>Tue, 03 Apr 2012 22:12:18 +0000</pubDate>
		<guid isPermaLink="false">http://mathtricks.org/?p=788#comment-365</guid>
		<description>I created a program to go through all 10,000 possible numbers. What I found out is that there are 383 numbers that when factored-out (high digits to low, low digits to high) yield 20 unique pairs that produce the Kaprekar constant in one subtraction. I also found out that there are certain numbers that take 7 iterations of the algorithm to produce the expected result. This was an unexpected side-benefit of my wondering, &quot;how many of the 10,000 possible numbers produce a zero result?&quot;

I have found that exactly 80 numbers will produce a zero result with this process (including ones such as 1111, 2222,
3333, etc., that we already knew about).

Here are 8 in the 2xxx range:

2111
2122
2212
2221
2222
2223
2232
2322
2333

There are only 4 in the 9xxx range:

9888
9899
9989
9998

If you are interested in all the details of this, send me an email. I wrote the whole thing up with all numbers included to share with some friends who are into math. But it is kind of long to post here. I would also be glad to share the program. It is written in Perl.</description>
		<content:encoded><![CDATA[<p>I created a program to go through all 10,000 possible numbers. What I found out is that there are 383 numbers that when factored-out (high digits to low, low digits to high) yield 20 unique pairs that produce the Kaprekar constant in one subtraction. I also found out that there are certain numbers that take 7 iterations of the algorithm to produce the expected result. This was an unexpected side-benefit of my wondering, &#8220;how many of the 10,000 possible numbers produce a zero result?&#8221;</p>
<p>I have found that exactly 80 numbers will produce a zero result with this process (including ones such as 1111, 2222,<br />
3333, etc., that we already knew about).</p>
<p>Here are 8 in the 2xxx range:</p>
<p>2111<br />
2122<br />
2212<br />
2221<br />
2222<br />
2223<br />
2232<br />
2322<br />
2333</p>
<p>There are only 4 in the 9xxx range:</p>
<p>9888<br />
9899<br />
9989<br />
9998</p>
<p>If you are interested in all the details of this, send me an email. I wrote the whole thing up with all numbers included to share with some friends who are into math. But it is kind of long to post here. I would also be glad to share the program. It is written in Perl.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

