James Iry pointed out that I could have used a fold left in my solution to the first ProjectEuler problem. Ah, now I remember reading about folds! So, I went back and looked at it. Right he is, of course. Here's his solution: val nums = 3 until 1000 val somenums = nums filter (x => (x % 3 == 0...