mattneary · December 11, 2015 06:39
diff --git a/prime.hs b/prime.hs
 module Main where
 
 grid range = [[i,j] | i <- range, j <- range] -- construct grid of number pairs
 multiplicationTable grid = map (\l -> foldl (*) 1 l) grid		-- multiply said pairs
 isPrime number = not $ any (==number) $ (multiplicationTable . grid) [2 .. number]	-- check for presence in table
 main = print $ map (\p -> (fst p, (isPrime . fst) p)) [(i, b) | i <- [1 .. 100], b <- [True]]		-- map all numbers to primeness
	module Main where

	grid range = [[i,j] \| i <- range, j <- range] -- construct grid of number pairs
	multiplicationTable grid = map (\l -> foldl (*) 1 l) grid -- multiply said pairs
	isPrime number = not $ any (==number) $ (multiplicationTable . grid) [2 .. number] -- check for presence in table
	main = print $ map (\p -> (fst p, (isPrime . fst) p)) [(i, b) \| i <- [1 .. 100], b <- [True]] -- map all numbers to primeness