The problem is:
Print the sum of numbers less than 1000 that are divisble by 5 or 3.
Already, we're exposed to a few nifty features of Groovy - ranges, and the functional methods on arrays like findAll:
// print the sum of numbers less than 1000 that are divisble by 5 …
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number?
It seems a bit cumbersome, but use a sieve of erasthonenes to generate primes until we have collected the 10001st. Basically …
Find the sum of all even fibonacci numbers that do not exceed four million
Warning, there's a slightly crude appending to an array below (I learn how to properly append in later exercises). findAll gets another working out:
fibos = []
a1 = 0
a2 = 1
while (true) {
curr_term = a1 + a2
if (4000000 …
Maps are great quick-and-dirty data structures or caches in many programming languages. But there's a least one way that Groovy maps aren't so friendly. Observe:
groovysh> m1 = [1:1]
===> {1=1}
groovysh> m1[1]
===> 1
groovysh> m1[(int) 1]
===> 1
groovysh> m1[(long) 1]
===> null
So, map keys are using …