Babbage problem: Difference between revisions

Content deleted Content added
Hout (talk | contribs)
m →‎{{header|Haskell}}: Applicative tidying of the test, plus slight rearrangement of the filter (fractionally faster)
Line 731:
</pre>
=={{header|Haskell}}==
<lang Haskell>--calculate theCalculate squares of integer , testing for the last 6 digits
findBabbageNumber :: Integer
findBabbageNumber = head $ filter myCondition [1..]
head (filter ((269696 ==) . flip mod 1000000 . (^ 2)) [1 ..])
where
myCondition :: Integer -> Bool
myCondition n = mod ( n ^ 2 ) 1000000 == 269696
 
--print out the result
main :: IO ( )
main = do
let babbageNumber = findBabbageNumber
let squareOfNumber = babbageNumber ^ 2
putStr $ show babbageNumber
putStr " ^ 2 equals "
putStr $ show squareOfNumber
putStrLn " !"</lang>
 
main :: IO ( )
main = do
(putStrLn ". !"</lang>unwords)
(zipWith
(++)
(show <$> ([id, (^ 2)] <*> [findBabbageNumber]))
putStr [" ^ 2 equals", " !"])</lang>
{{out}}
<pre>25264 ^ 2 equals 638269696 !</pre>
</pre>
 
=={{header|J}}==