// Functions and loops: prime numbers use basic fun is_prime(n) { if (n < 2) { return false } for (d = 2; d * d <= n; d++) { if (n % d == 0) { return false } } return true } fun main() { found = [] n = 2 while (found.len() < 20) { if (is_prime(n)) { found.add(n) } n++ } printl("first 20 primes:", found) printl("sum:", found.sum(), "biggest:", found.max()) }