merveucer

function areTheseAmicableNumbers(number1, number2) {
    let numbers = [number1, number2]
    let sumsOfDivisors = []

    numbers.forEach(number => {
        let sumOfDivisors = 0

        for (let divisor = 1; divisor < number; divisor++) {
            if (number % divisor == 0) {
                sumOfDivisors += divisor

merveucer

function getPrimeNumbersLessThan1000() {
    let primeNumbers = []

    for (let number = 2; number < 1000; number++) {
        let isPrimeNumber = true

        for (let divisor = 2; divisor < number; divisor++) {
            if (number % divisor == 0) {
                isPrimeNumber = false
            }

merveucer

function getPerfectNumbersLessThan1000() {
    let perfectNumbers = []

    for (let number = 1; number < 1000; number++) {
        let sumOfDivisors = 0

        for (let divisor = 1; divisor < number; divisor++) {
            if (number % divisor == 0) {
                sumOfDivisors += divisor
            }

merveucer

function findPrimeNumber(...numbers) {
    numbers.forEach(number => {
        let isPrimeNumber = true

        for (let divisor = 2; divisor < number; divisor++) {
            if (number % divisor == 0) {
                isPrimeNumber = false
            }
        }