Find largest left truncatable prime in a given base: Difference between revisions
Content added Content deleted
(→{{header|Haskell}}: make prime filter more ghetto for speed; result of 18 and 19) |
m (→{{header|Haskell}}: add back source code ref.) |
||
| Line 12: | Line 12: | ||
=={{header|Haskell}}== |
=={{header|Haskell}}== |
||
Miller-Rabin test code from [http://www.haskell.org/haskellwiki/Testing_primality#Miller-Rabin_Primality_Test HaskellWiki], with modifications. |
|||
<lang haskell>primesTo100 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97] |
<lang haskell>primesTo100 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97] |
||