haskell, euler #5: find smallest mult divisible by 1 through 20

implementation is slow. would love to tune this.