A simple, inefficient algorithm for generating prime numbers.

prime.js

const fs = require('fs');

let last = 0;

const p = () => {
  const n = last + 1;

  for (let i = 2; i < n; i++) {
    if (n % i === 0) {
      return;
    }
  }

  fs.appendFileSync(__dirname + '/primes', n + '\n');
}

for (;;) {
  p();
  last = last + 1;
}