Skip to content

Problem 6

October 31, 2009

The problem 6 of the Euler project site was again easy to solve. Using Haskell, I wrote the following one-line function:

g = (sum [1..100] ^ 2) (sum (map (^2) [1..100]))

Advertisements
Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: