val 0.3.6

An arbitrary precision calculator language
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

fn is_prime(n) {
  if (n <= 1) {
    return false
  }

  if (n <= 3) {
    return true
  }

  if (n % 2 == 0 || n % 3 == 0) {
    return false
  }

  i = 5

  while (i * i <= n) {
    if (n % i == 0 || n % (i + 2) == 0) {
      return false
    }

    i = i + 6
  }

  return true
}

fn find_primes(start, end) {
  println("Prime numbers between " + start + " and " + end + ":")

  count = 0

  current = start

  while (current <= end) {
    if (is_prime(current)) {
      print(current + " ")

      count = count + 1

      if (count % 10 == 0) {
        println("")
      }
    }

    current = current + 1
  }

  if (count % 10 != 0) {
    println("")
  }

  println("Found " + count + " prime numbers.")
}

lower = int(input("Enter lower bound: "))
upper = int(input("Enter upper bound: "))

find_primes(lower, upper)