Write an application that takes numeric input (N) from a user and outputs a multiplication table of (N) prime numbers.

git clone https://github.com/Leo-ajc/prime_node.git

cd prime_node

npm install

node ./src/cli.js 7

$ [ 2, 3, 5, 7, 11, 13, 17 ]

npm test

node ./benchmark/benchmark.js

./benchmark/regression_worksheet.xlsx

n = 30

O(n^c) Fractional Power

y = 174.37x0.8671

R^2 = 0.99115

n = 30

O(n) Linear

y = 91.766x + 335.8

R^2 = 0.99794

Able to implement a segmented sieve.

1. Created an output multiplication table.
2. Used more functional syntax, map and reduce than iteration I used.
3. Removed the crazy code replication in the tests.