**Paste:**#107702**Author:**1HaskellADay**Language:**Haskell**Channel:**-**Created:**2014-07-18 12:02:04 UTC**Revisions:**- 2014-07-18 19:55:20 UTC #107719 (diff): No title (1HaskellADay)
- 2014-07-18 12:02:04 UTC #107702: Ooh! π-charts! No. Wait. (1HaskellADay)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 | import Analytics.Theory.Number -- http://lpaste.net/107480 {-- Okay, geophf, a bonus-bonus? Did you take too many vitamins this morning? Spiked your triple-espresso shots with truvia and caffeine powder? What? Okay, on @AlgebraFacts it is asserted that the distribution of prime numbers looks like this: number of primes up to the number n = n / ln n This is known as the Prime Number Theorem. So. Let’s verify that. Compute or collect the prime numbers up to n and then, using your favorite graphing software, graph that distribution however you see fit (scale-wise, representation-wise, whatever) That way you can go around your office, school, or workspace and tell people you’ve verified the Prime Number Theorem, and then show them the graph worth picture = take 1000 (repeat "words") You know. --} primesUpTo :: Integer -> Integer primesUpTo n = undefined -- Solution posted at http://lpaste.net/107718 |