<?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: Luhn formula</title>
	<atom:link href="http://www.darkcoding.net/credit-card/luhn-formula/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.darkcoding.net/credit-card/luhn-formula/</link>
	<description>Solvitas perambulum</description>
	<lastBuildDate>Thu, 02 Feb 2012 03:15:03 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Sanjeev Thakur</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-624</link>
		<dc:creator>Sanjeev Thakur</dc:creator>
		<pubDate>Tue, 04 Oct 2011 04:17:49 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-624</guid>
		<description>&lt;p&gt;Great content Man.. hats off :D&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Great content Man.. hats off :D</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Cosmos</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-623</link>
		<dc:creator>Cosmos</dc:creator>
		<pubDate>Fri, 08 Jul 2011 11:51:25 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-623</guid>
		<description>&lt;p&gt;infact u are the best site ever i have seen because u have done a good calculation.thank u for your formula it is working now .&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>infact u are the best site ever i have seen because u have done a good calculation.thank u for your formula it is working now .</p>]]></content:encoded>
	</item>
	<item>
		<title>By: john</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-622</link>
		<dc:creator>john</dc:creator>
		<pubDate>Sat, 24 Apr 2010 21:34:19 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-622</guid>
		<description>&lt;p&gt;when you reverse and take off the check digit. for a 16 digit for example, do you simply just disregard the fact that it was an odd number and then start by multiplying 14th digit and the 12 digit, and skipping the last even digit? and then comming back to it later for the even multiplications?&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>when you reverse and take off the check digit. for a 16 digit for example, do you simply just disregard the fact that it was an odd number and then start by multiplying 14th digit and the 12 digit, and skipping the last even digit? and then comming back to it later for the even multiplications?</p>]]></content:encoded>
	</item>
	<item>
		<title>By: will</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-621</link>
		<dc:creator>will</dc:creator>
		<pubDate>Sat, 27 Mar 2010 02:11:47 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-621</guid>
		<description>&lt;p&gt;nice, i used the formula for websites where they want you to put your credit card # in.(websites that dont charge but want your number) i personally thought what idiot would do that so i checked out your website and found this! Good Work.Is this as a hobby or does your job like need you to do this?  Well anyways kool and i&#039;ll probaly have to re-visit the site so i can tell my friends how to make there credit card numbers into fake ones.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>nice, i used the formula for websites where they want you to put your credit card # in.(websites that dont charge but want your number) i personally thought what idiot would do that so i checked out your website and found this! Good Work.Is this as a hobby or does your job like need you to do this?  Well anyways kool and i&#8217;ll probaly have to re-visit the site so i can tell my friends how to make there credit card numbers into fake ones.</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Free Credit Cards (kind of) &#124; Villager With Wheel</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-620</link>
		<dc:creator>Free Credit Cards (kind of) &#124; Villager With Wheel</dc:creator>
		<pubDate>Sat, 19 Apr 2008 04:54:34 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-620</guid>
		<description>&lt;p&gt;[...] number&#8221; means reverse the whole credit card number. The Darkcoding site explanations right here and right here as well as the Wikipedia explanation here help clarify what is going on. The [...]&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>[...] number&#8221; means reverse the whole credit card number. The Darkcoding site explanations right here and right here as well as the Wikipedia explanation here help clarify what is going on. The [...]</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Rand Al'Thor</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-619</link>
		<dc:creator>Rand Al'Thor</dc:creator>
		<pubDate>Sun, 20 Jan 2008 20:09:26 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-619</guid>
		<description>&lt;p&gt;though this is a bit freighting, its fun to see things like this everyday. its not everyday you get a funny bunch like this :) thanks John&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>though this is a bit freighting, its fun to see things like this everyday. its not everyday you get a funny bunch like this :) thanks John</p>]]></content:encoded>
	</item>
	<item>
		<title>By: James Brown</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-618</link>
		<dc:creator>James Brown</dc:creator>
		<pubDate>Mon, 03 Sep 2007 21:45:50 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-618</guid>
		<description>&lt;p&gt;It would seem to me that step 7 of your algorithm is overly complicated.  Let me suggest three alternatives to make the algorithm simpler.&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;&lt;p&gt;If you insist on calculating and comparing to the check digit removed in step 1, then this calculation seems simpler: 10 - (sum % 10).&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;An even easier solution is to add in the check digit removed in step 1 and confirm that the sum % 10 == 0.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;One more simplification presents itself if you opt for solution 2 above.  Simply do not remove the check digit at all (skip step 1), change step 3 to double all the digits in EVEN positions, and change step 4 to add in the digits in ODD positions.  With these changes the new instructions become ...&lt;/p&gt;&lt;/li&gt;
&lt;/ol&gt;

&lt;h1&gt;Reverse the number&lt;/h1&gt;

&lt;h1&gt;Multiply all the digits in even positions (The second digit, the fourth digit, etc) by 2.&lt;/h1&gt;

&lt;h1&gt;If any one is greater than 9 subtract 9 from it.&lt;/h1&gt;

&lt;h1&gt;Sum those numbers up&lt;/h1&gt;

&lt;h1&gt;Add the digits in odd positions (the first, third, etc) to the number you got in the previous step&lt;/h1&gt;

&lt;h1&gt;Confirm that the sum is an even multiple of 10.  You can do this in code with something like (sum % 10) == 0&lt;/h1&gt;

&lt;ul&gt;
&lt;li&gt;James&lt;/li&gt;
&lt;/ul&gt;
</description>
		<content:encoded><![CDATA[<p>It would seem to me that step 7 of your algorithm is overly complicated.  Let me suggest three alternatives to make the algorithm simpler.</p>

<ol>
<li><p>If you insist on calculating and comparing to the check digit removed in step 1, then this calculation seems simpler: 10 &#8211; (sum % 10).</p></li>
<li><p>An even easier solution is to add in the check digit removed in step 1 and confirm that the sum % 10 == 0.</p></li>
<li><p>One more simplification presents itself if you opt for solution 2 above.  Simply do not remove the check digit at all (skip step 1), change step 3 to double all the digits in EVEN positions, and change step 4 to add in the digits in ODD positions.  With these changes the new instructions become &#8230;</p></li>
</ol>

<h1>Reverse the number</h1>

<h1>Multiply all the digits in even positions (The second digit, the fourth digit, etc) by 2.</h1>

<h1>If any one is greater than 9 subtract 9 from it.</h1>

<h1>Sum those numbers up</h1>

<h1>Add the digits in odd positions (the first, third, etc) to the number you got in the previous step</h1>

<h1>Confirm that the sum is an even multiple of 10.  You can do this in code with something like (sum % 10) == 0</h1>

<ul>
<li>James</li>
</ul>]]></content:encoded>
	</item>
	<item>
		<title>By: Tamlyn Rhodes</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-617</link>
		<dc:creator>Tamlyn Rhodes</dc:creator>
		<pubDate>Sat, 31 Mar 2007 11:52:03 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-617</guid>
		<description>&lt;p&gt;Thanks for this! I thought I&#039;d found a clever way to human-readably encrypt my credit card number in an email by multiplying it with a number that only me and the recipient knew. However it turns out that due to the luhn-induced redundancy it is trivial to retrieve the factors from the product. Drat!&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Thanks for this! I thought I&#8217;d found a clever way to human-readably encrypt my credit card number in an email by multiplying it with a number that only me and the recipient knew. However it turns out that due to the luhn-induced redundancy it is trivial to retrieve the factors from the product. Drat!</p>]]></content:encoded>
	</item>
	<item>
		<title>By: anon</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-616</link>
		<dc:creator>anon</dc:creator>
		<pubDate>Thu, 09 Nov 2006 20:29:39 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-616</guid>
		<description>&lt;p&gt;Thanks for the info, this helps me alot with the e-commerce site that I&#039;m making for my work right now. And it also gives me a laugh reading through the comments ;)&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Thanks for the info, this helps me alot with the e-commerce site that I&#8217;m making for my work right now. And it also gives me a laugh reading through the comments ;)</p>]]></content:encoded>
	</item>
	<item>
		<title>By: blessyn</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/#comment-615</link>
		<dc:creator>blessyn</dc:creator>
		<pubDate>Fri, 11 Aug 2006 14:44:17 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-615</guid>
		<description>&lt;p&gt;am not good at maths pls&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>am not good at maths pls</p>]]></content:encoded>
	</item>
</channel>
</rss>

