17
18
19function main() {
20	let p = [];21	generatePrimes(p, 1e6);
22	return p[10000];
23};

 1function generatePrimes(primes, MAX_SIZE){
 2	let IsPrime = Array(MAX_SIZE).fill(true);
 3	 
 4	let p,i; 5	for (p = 2; p * p < MAX_SIZE;p++) {
 6		if (IsPrime[p] == true) {
 7			for(i = p * p; i < MAX_SIZE; i += p)

12	let n = [];
13	for (let i = 100; i < 1000; i++ ) {
14		for (let j = 100; j < 1000; j++) {
15			let k = i * j;16			if (isPalendromic(k)) {
17				n.push(k);
18			};

 1function main() {
 2	let total = 0;
 3	let a = 1; 4	let b = 2;
 5	while (a <= 4000000) {
 6		if (a % 2 === 0) {

 1function main() {
 2	let total = 0;
 3	let a = 1;
 4	let b = 2; 5	while (a <= 4000000) {
 6		if (a % 2 === 0) {
 7			total += a;