<?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: How to cheat with Frank Benford</title>
	<atom:link href="http://blog.stevemould.com/how-to-cheat-with-frank-benford/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/</link>
	<description>A geek blog by Steve Mould</description>
	<lastBuildDate>Fri, 03 Feb 2012 20:36:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Robin Nelson</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-1100</link>
		<dc:creator>Robin Nelson</dc:creator>
		<pubDate>Thu, 20 Oct 2011 05:05:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-1100</guid>
		<description>Interesting blog. It is always good if you can provide additional information about this. Thanks a lot!</description>
		<content:encoded><![CDATA[<p>Interesting blog. It is always good if you can provide additional information about this. Thanks a lot!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dana Aquirre</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-1097</link>
		<dc:creator>Dana Aquirre</dc:creator>
		<pubDate>Wed, 28 Sep 2011 04:39:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-1097</guid>
		<description>Thanks for giving such kind of great information .</description>
		<content:encoded><![CDATA[<p>Thanks for giving such kind of great information .</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Juliet Meeks</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-1084</link>
		<dc:creator>Juliet Meeks</dc:creator>
		<pubDate>Tue, 19 Jul 2011 11:47:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-1084</guid>
		<description>Thank you a lot for your interesting article. I have been looking for such message for a very long time.</description>
		<content:encoded><![CDATA[<p>Thank you a lot for your interesting article. I have been looking for such message for a very long time.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Mould</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-1082</link>
		<dc:creator>Steve Mould</dc:creator>
		<pubDate>Tue, 28 Jun 2011 13:25:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-1082</guid>
		<description>That&#039;s awesome. Thanks Ewerton</description>
		<content:encoded><![CDATA[<p>That&#8217;s awesome. Thanks Ewerton</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ewerton Miglioranza</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-1081</link>
		<dc:creator>Ewerton Miglioranza</dc:creator>
		<pubDate>Tue, 28 Jun 2011 13:21:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-1081</guid>
		<description>Just in case someone else want to take a look: http://testingbenfordslaw.com/
Great post dude!</description>
		<content:encoded><![CDATA[<p>Just in case someone else want to take a look: http://testingbenfordslaw.com/<br />
Great post dude!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Mould</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-1038</link>
		<dc:creator>Steve Mould</dc:creator>
		<pubDate>Fri, 25 Feb 2011 02:01:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-1038</guid>
		<description>Finally someone asking the important questions!</description>
		<content:encoded><![CDATA[<p>Finally someone asking the important questions!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Henschen</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-1037</link>
		<dc:creator>John Henschen</dc:creator>
		<pubDate>Fri, 25 Feb 2011 01:59:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-1037</guid>
		<description>All this discussion is fine and dandy, but you have yet to touch upon the most important aspect. How will this help me win the lottery? ;)</description>
		<content:encoded><![CDATA[<p>All this discussion is fine and dandy, but you have yet to touch upon the most important aspect. How will this help me win the lottery? <img src='http://d5lx5634mkgoi.cloudfront.net/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mold Removal</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-1024</link>
		<dc:creator>Mold Removal</dc:creator>
		<pubDate>Thu, 03 Feb 2011 04:47:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-1024</guid>
		<description>I just stumbled upon your site and wanted to say that I have really enjoyed reading your opinions.</description>
		<content:encoded><![CDATA[<p>I just stumbled upon your site and wanted to say that I have really enjoyed reading your opinions.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Mould</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-994</link>
		<dc:creator>Steve Mould</dc:creator>
		<pubDate>Fri, 21 Jan 2011 13:24:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-994</guid>
		<description>This is brilliant! Love the php. But what your php does is find the distribution of leading digits for a fixed raffle size of 10000000000000000. If you want to find the distribution when you don&#039;t know the size UP TO 10000000000000000 you&#039;ve got to modify the rand line to be like this:

       $n = rand(1,rand(1,10000000000000000)).&quot;&quot;;

The nested rand is giving you a random raffle size to choose from up to the maximum.

When the max size of the raffle is infinite, the distribution fits Beford exactly. But if it&#039;s finite, so long as it spans several orders of magnitude it&#039;ll fit very closely. And of course the more orders of magnitude you span the better the fit gets.

</description>
		<content:encoded><![CDATA[<p>This is brilliant! Love the php. But what your php does is find the distribution of leading digits for a fixed raffle size of 10000000000000000. If you want to find the distribution when you don&#8217;t know the size UP TO 10000000000000000 you&#8217;ve got to modify the rand line to be like this:</p>
<p>       $n = rand(1,rand(1,10000000000000000)).&#8221;";</p>
<p>The nested rand is giving you a random raffle size to choose from up to the maximum.</p>
<p>When the max size of the raffle is infinite, the distribution fits Beford exactly. But if it&#8217;s finite, so long as it spans several orders of magnitude it&#8217;ll fit very closely. And of course the more orders of magnitude you span the better the fit gets.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: DampeS8N</title>
		<link>http://blog.stevemould.com/how-to-cheat-with-frank-benford/comment-page-1/#comment-993</link>
		<dc:creator>DampeS8N</dc:creator>
		<pubDate>Thu, 20 Jan 2011 21:31:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.stevemould.com/?p=173#comment-993</guid>
		<description>That&#039;s not true. If the raffle is of a finite, but unknown, size, then the data will be evenly distributed. It is only when the max size of the raffle is infinite, that your raffle metaphor works. Not for an unknown size.

Consider the results of this PHP snippet. For any maximum number, the distribution will be even.

$i = 0;
$spread = array();
while($i &lt; 1000000)
{
	$n = rand(1,10000000000000000).&quot;&quot;;
	$spread[$n[0]]++;
	$i++;
}
ksort($spread);
var_dump($spread);</description>
		<content:encoded><![CDATA[<p>That&#8217;s not true. If the raffle is of a finite, but unknown, size, then the data will be evenly distributed. It is only when the max size of the raffle is infinite, that your raffle metaphor works. Not for an unknown size.</p>
<p>Consider the results of this PHP snippet. For any maximum number, the distribution will be even.</p>
<p>$i = 0;<br />
$spread = array();<br />
while($i &lt; 1000000)<br />
{<br />
	$n = rand(1,10000000000000000).&quot;&quot;;<br />
	$spread[$n[0]]++;<br />
	$i++;<br />
}<br />
ksort($spread);<br />
var_dump($spread);</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using disk: basic
Page Caching using disk: enhanced
Database Caching 17/35 queries in 0.025 seconds using disk: basic
Content Delivery Network via Amazon Web Services: CloudFront: d5lx5634mkgoi.cloudfront.net

Served from: blog.stevemould.com @ 2012-02-05 01:56:06 -->
