for(let m = 2; m <= n/2; m++)

    if(n % m == 0) return false;

  return (n > 1);

}

​

function primeSuccessor(n) {

  while(!isPrime(++n));

  return n;

}

​

function primePredecessor(n) {

  while(!isPrime(--n));

  return n;

}

​

let nextPrime = function(n) {

  return ()=> n = primeSuccessor(n);

}(1);

​

​

function setup() {

  noCanvas(); noLoop();

​

  let a = 1

  let b = 100

  for(let p = a; p <= b;) {

    p = nextPrime(p)

    print(p)

  }

}

​

​