Permalink
Browse files

typos and tweaks

  • Loading branch information...
1 parent 015061c commit 5574d62b33a566a7485bf1323eb56391ed1ab2de @blackant blackant committed Jun 22, 2011
Showing with 11 additions and 3 deletions.
  1. +11 −3 index.html
View
@@ -69,16 +69,24 @@
</tfoot>
</table>
- <p>Chances are, the leading digit will be a <em>1</em> more often than a <em>2</em>. And <em>2</em>s would probably occur more often than <em>3</em>s, and so on.</p>
+ <p>Chances are, the leading digit will be a <em>1</em> more often than
+ a <em>2</em>. And <em>2</em>s would probably occur more often than
+ <em>3</em>s, and so on.</p>
- <p>This odd phenonenom is Benford's Law. If a set of values were truly random, the leading digits would be distributed with about <em>11%</em> for each value, but Benford's Law predicts a logarithmic distribution. It occurs so regularly that it is even used in fradulent accounting detection.</p>
+ <p>This odd phenonenom is Benford's Law. If a set of values were truly
+ random, each leading digit would appear about <em>11%</em>
+ of the time, but Benford's Law predicts a logarithmic distribution.
+ It occurs so regularly that it is even used in fraudulent accounting
+ detection.</p>
<p>See the <a href="http://en.wikipedia.org/wiki/Benfords_law">Wikipedia article</a>
for a more thorough discussion.</p>
<p>This is a simple experiment to see how many large, publicly accessible datasets satisfy Benford’s Law.</p>
- <p class="github">This site is on Github. Please <a href="https://github.com/blackant/benfords-law">help out by forking the project and adding more datasets</a>.</p>
+ <p class="github">This site is on Github. Please <a
+ href="https://github.com/blackant/benfords-law">help out by forking
+ the project and adding more datasets</a>.</p>
<footer>
<p>

0 comments on commit 5574d62

Please sign in to comment.