https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE701%3ANatural_Prestidigitation 2026-06-30T07:41:30Z Revision history for this page on the wiki MediaWiki 1.45.3 https://wiki.kram.nz/index.php?title=SE701:Natural_Prestidigitation&diff=91&oldid=prev 2008-02-15T20:11:11Z

<p>New page: == Description == Explores Benford&#039;s Law which basically states that the number 1 appears more as the first digit in data sets than the number 2, and that number 2 appears more than number...</p> <p><b>New page</b></p><div>== Description ==<br /> Explores Benford&#039;s Law which basically states that the number 1 appears more as the first digit in data sets than the number 2, and that number 2 appears more than number 3 etc...<br /> My project is based on one from the Nifty Assignments site: http://nifty.stanford.edu/2006/wolfman-pretid/<br /> <br /> <br /> My program will read in a list of integers from file, and an integer n, and count the frequency that the digits 0-9 appear in the nth postion in the intergers of the list. The frequencies will be displayed in some way (maybe a graph).</div>

Mark