JSFiddle - React, Tailwind, and code Playground
by Konstantin Mamaev
JavaScript
const getPrimes = (n) => {
const bound = Math.floor((n - 1) / 2);
const sieve = [];
const limit = Math.floor((Math.floor(Math.sqrt(n)) - 1) / 2);
for (let i = 1; i <= limit; i++) {
if (!sieve[i - 1]) {
let j = 2 * i * (i + 1);
while (j <= bound) {
sieve[j - 1] = true;
j += 2 * i + 1;
}
}
}
const primes = [2];
for (let i = 1; i <= bound; i++) {
if (!sieve[i - 1]) {
primes.push(2 * i + 1);
}
}
return primes;
}
const getDivisors = (number, primes) => {
let divisors = 1;
for (let i = 0; i <= primes.length; i++) {
if (primes[i] * primes[i] > number) {
break;
}
let exponent = 1;
while (number % primes[i] == 0) {
exponent++;
number /= primes[i];
}
divisors *= exponent;
}
return divisors;
}
const solve = (n) => {
const primes = getPrimes(n);
let count = 0;
let solutions = 0;
while (solutions <= n) {
count++;
const divisors = getDivisors(count * count, primes);
solutions = (divisors + 1) / 2;
}
return solutions;
}
console.log(solve(2));