<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.2.2" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: Verhoeff&#8217;s Dihedral Group D5 Check</title>
	<link>http://en.dahnielson.com/2006/09/verhoeff.html</link>
	<description>Misleading the public since 1979</description>
	<pubDate>Sat, 22 Nov 2008 09:26:32 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.2.2</generator>

	<item>
		<title>By: Anders Dahnielson</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2119</link>
		<author>Anders Dahnielson</author>
		<pubDate>Tue, 10 Apr 2007 09:57:52 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2119</guid>
		<description>I believe this document &lt;a href="http://labs.dahnielson.com/files/2006/09/19/adfa.pdf" rel="nofollow"&gt;"Numeric Department Identifiers"&lt;/a&gt; by the Australian Defense Force Academy was my main reference when implementing the Verhoeff algorithm.</description>
		<content:encoded><![CDATA[<p>I believe this document <a href="http://labs.dahnielson.com/files/2006/09/19/adfa.pdf" rel="nofollow">&#8220;Numeric Department Identifiers&#8221;</a> by the Australian Defense Force Academy was my main reference when implementing the Verhoeff algorithm.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Harding</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2064</link>
		<author>Peter Harding</author>
		<pubDate>Wed, 04 Apr 2007 11:15:16 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2064</guid>
		<description>It turns out that my client has made up lots of "units" using the numerical recipes version, so right or wrong they're going to go with that. I've retrieved Verhoeff's original paper but it's hard group theory maths -it looks the same upside down to me! I see the wikipedia article discussion cites yet another rendering of the scheme, also held to be incorrect.

Without the input of a skilled mathematician (Verhoeff - are you reading us?) I guess nobody will ever really know! If you find your references I'd be interested to hear about them.

Thanks for your input!</description>
		<content:encoded><![CDATA[<p>It turns out that my client has made up lots of &#8220;units&#8221; using the numerical recipes version, so right or wrong they&#8217;re going to go with that. I&#8217;ve retrieved Verhoeff&#8217;s original paper but it&#8217;s hard group theory maths -it looks the same upside down to me! I see the wikipedia article discussion cites yet another rendering of the scheme, also held to be incorrect.</p>
<p>Without the input of a skilled mathematician (Verhoeff - are you reading us?) I guess nobody will ever really know! If you find your references I&#8217;d be interested to hear about them.</p>
<p>Thanks for your input!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anders Dahnielson</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2010</link>
		<author>Anders Dahnielson</author>
		<pubDate>Fri, 30 Mar 2007 14:44:30 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2010</guid>
		<description>Here is a live version of my script to play around with:

&lt;code&gt;http://labs.dahnielson.com/tmp/verhoeff-test.php?f=calc&#038;n=142857&lt;/code&gt;

&lt;ul&gt;&lt;li&gt;&lt;code&gt;f&lt;/code&gt; can either be &lt;em&gt;calc&lt;/em&gt; or &lt;em&gt;check&lt;/em&gt;&lt;/li&gt;&lt;li&gt;&lt;code&gt;n&lt;/code&gt; is the number to calculate a check digit for or check&lt;/li&gt;&lt;/ul&gt;

If you calculate the check digit for &lt;code&gt;142857&lt;/code&gt; it return &lt;code&gt;0&lt;/code&gt; (and if you check &lt;code&gt;1428570&lt;/code&gt; it return &lt;code&gt;0&lt;/code&gt;). So my code looks like to be on the Wikipedia side of the table.</description>
		<content:encoded><![CDATA[<p>Here is a live version of my script to play around with:</p>
<p><code><a href="http://labs.dahnielson.com/tmp/verhoeff-test.php?f=calc&#038;n=142857" rel="nofollow">http://labs.dahnielson.com/tmp/verhoeff-test.php?f=calc&#038;n=142857</a></code></p>
<ul>
<li><code>f</code> can either be <em>calc</em> or <em>check</em></li>
<li><code>n</code> is the number to calculate a check digit for or check</li>
</ul>
<p>If you calculate the check digit for <code>142857</code> it return <code>0</code> (and if you check <code>1428570</code> it return <code>0</code>). So my code looks like to be on the Wikipedia side of the table.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Harding</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2008</link>
		<author>Peter Harding</author>
		<pubDate>Fri, 30 Mar 2007 12:49:17 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2008</guid>
		<description>I can't run PHP. If we take the example 142857, the wikipedia version gives 0 and the Numerical Recipes version gives 6. This site http://www.augustana.ab.ca/~mohrj/algorithms/checkdigit.html agrees with wikipedia, this one http://web.mit.edu/kenta/www/three/verhoeff-checksum.html.gz goes with Numerical Recipes. Num Rec has shot me in the foot before (giving code in a typeface where "one" and "ell" are identical!!), but it's generally held to be scholarly. I was going to try and surf some pictures of old german banknotes...!</description>
		<content:encoded><![CDATA[<p>I can&#8217;t run PHP. If we take the example 142857, the wikipedia version gives 0 and the Numerical Recipes version gives 6. This site <a href="http://www.augustana.ab.ca/~mohrj/algorithms/checkdigit.html" rel="nofollow">http://www.augustana.ab.ca/~mohrj/algorithms/checkdigit.html</a> agrees with wikipedia, this one <a href="http://web.mit.edu/kenta/www/three/verhoeff-checksum.html.gz" rel="nofollow">http://web.mit.edu/kenta/www/three/verhoeff-checksum.html.gz</a> goes with Numerical Recipes. Num Rec has shot me in the foot before (giving code in a typeface where &#8220;one&#8221; and &#8220;ell&#8221; are identical!!), but it&#8217;s generally held to be scholarly. I was going to try and surf some pictures of old german banknotes&#8230;!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anders Dahnielson</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2006</link>
		<author>Anders Dahnielson</author>
		<pubDate>Fri, 30 Mar 2007 09:56:28 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2006</guid>
		<description>I don't remember what text I used, don't think it was the Wikipedia article but some textbook or report on check digits. I probably have a couple PDF files with the text that I've downloaded somewhere, I will try to find them.

Hmm... wonder what result my implementation match? Scary.</description>
		<content:encoded><![CDATA[<p>I don&#8217;t remember what text I used, don&#8217;t think it was the Wikipedia article but some textbook or report on check digits. I probably have a couple PDF files with the text that I&#8217;ve downloaded somewhere, I will try to find them.</p>
<p>Hmm&#8230; wonder what result my implementation match? Scary.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Harding</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2005</link>
		<author>Peter Harding</author>
		<pubDate>Fri, 30 Mar 2007 09:42:30 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-2005</guid>
		<description>The results of the wikipedia article differ from the results of the recipe given in the "Numerical Recipes in C" book. I've found a website that agrees with the book (but maybe they used it!). I've retrieved Verhoeff's original paper but I'm not up on group theory - it looks the same upside down to me!

Anyone know for sure that the wikipedia article is good? Are there any good other references around?

Many thanks</description>
		<content:encoded><![CDATA[<p>The results of the wikipedia article differ from the results of the recipe given in the &#8220;Numerical Recipes in C&#8221; book. I&#8217;ve found a website that agrees with the book (but maybe they used it!). I&#8217;ve retrieved Verhoeff&#8217;s original paper but I&#8217;m not up on group theory - it looks the same upside down to me!</p>
<p>Anyone know for sure that the wikipedia article is good? Are there any good other references around?</p>
<p>Many thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anders Dahnielson</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-1831</link>
		<author>Anders Dahnielson</author>
		<pubDate>Wed, 07 Mar 2007 09:45:37 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-1831</guid>
		<description>The &lt;code&gt;calcsum($number)&lt;/code&gt; function return the checksum digit for the series of digits used as argument, if you give it &lt;code&gt;142857&lt;/code&gt; as argument it will return the checksum digit &lt;code&gt;0&lt;/code&gt;. Append the digit to the number so it now reads &lt;code&gt;1428570&lt;/code&gt;.

The &lt;code&gt;checksum($number)&lt;/code&gt; do the opposite. Give it a number with check digit to check, like &lt;code&gt;1428570&lt;/code&gt;, as argument and will return a &lt;code&gt;0&lt;/code&gt; if the number is valid (it will always be a zero if valid no matter what the check digit was).

The Verhoeff algorithm have no limitation on the number of digits (as many other algorithms have) it can check, it's unlimited.</description>
		<content:encoded><![CDATA[<p>The <code>calcsum($number)</code> function return the checksum digit for the series of digits used as argument, if you give it <code>142857</code> as argument it will return the checksum digit <code>0</code>. Append the digit to the number so it now reads <code>1428570</code>.</p>
<p>The <code>checksum($number)</code> do the opposite. Give it a number with check digit to check, like <code>1428570</code>, as argument and will return a <code>0</code> if the number is valid (it will always be a zero if valid no matter what the check digit was).</p>
<p>The Verhoeff algorithm have no limitation on the number of digits (as many other algorithms have) it can check, it&#8217;s unlimited.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: mauricio</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-1826</link>
		<author>mauricio</author>
		<pubDate>Wed, 07 Mar 2007 01:03:37 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-1826</guid>
		<description>thanks, still not clear what is the role of the calcsum() function. Also, what do you do when you have numbers with more than 8 digits total (like in a credit card)?</description>
		<content:encoded><![CDATA[<p>thanks, still not clear what is the role of the calcsum() function. Also, what do you do when you have numbers with more than 8 digits total (like in a credit card)?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anders Dahnielson</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-1780</link>
		<author>Anders Dahnielson</author>
		<pubDate>Wed, 28 Feb 2007 09:41:55 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-1780</guid>
		<description>For the benefit of all, I've realized that I could post my reply here as well:

You asked about where the previous &lt;em&gt;c&lt;/em&gt; value came from. I guess it is easier to follow the &lt;a href="http://en.wikipedia.org/wiki/Verhoeff_algorithm#Example" rel="nofollow"&gt;example on Wikipedia&lt;/a&gt; if you take a look at my PHP implementation while following it along, not that it is any complicated matter. The &lt;em&gt;c&lt;/em&gt; start with a value of zero, when the algorithm iterates over the string of digits &lt;em&gt;c&lt;/em&gt; is both input to the &lt;em&gt;d(j,k)&lt;/em&gt; function (the &lt;em&gt;j&lt;/em&gt; value) and the output replacing the previous or default value. Thus, in the Wikipedia example, previous &lt;em&gt;c&lt;/em&gt; represent the &lt;em&gt;c&lt;/em&gt; value from the previous iteration or the default value on the first iteration.</description>
		<content:encoded><![CDATA[<p>For the benefit of all, I&#8217;ve realized that I could post my reply here as well:</p>
<p>You asked about where the previous <em>c</em> value came from. I guess it is easier to follow the <a href="http://en.wikipedia.org/wiki/Verhoeff_algorithm#Example" rel="nofollow">example on Wikipedia</a> if you take a look at my PHP implementation while following it along, not that it is any complicated matter. The <em>c</em> start with a value of zero, when the algorithm iterates over the string of digits <em>c</em> is both input to the <em>d(j,k)</em> function (the <em>j</em> value) and the output replacing the previous or default value. Thus, in the Wikipedia example, previous <em>c</em> represent the <em>c</em> value from the previous iteration or the default value on the first iteration.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ANTHONY</title>
		<link>http://en.dahnielson.com/2006/09/verhoeff.html#comment-1656</link>
		<author>ANTHONY</author>
		<pubDate>Mon, 12 Feb 2007 08:56:47 +0000</pubDate>
		<guid>http://en.dahnielson.com/2006/09/verhoeff.html#comment-1656</guid>
		<description>IVE BEEN READING WIKIPEDIAS EXPLANATION OF TH VERHOEFF SCHEME. but when it comes to their example am not able to figure out where they get the values for the column titled previous c. please help me on this. send expalnation to my email.</description>
		<content:encoded><![CDATA[<p>IVE BEEN READING WIKIPEDIAS EXPLANATION OF TH VERHOEFF SCHEME. but when it comes to their example am not able to figure out where they get the values for the column titled previous c. please help me on this. send expalnation to my email.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
