Created
November 2, 2021 19:57
-
-
Save orcunakkaya/dd8201695b8008667416c47d7c0d9e8d to your computer and use it in GitHub Desktop.
Kodlama.io JavaScript kampı ödev 1
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const findPrime = (...numbers) => { | |
numbers.map(number => ( | |
console.log(isPrimeNumber(number) ? `${number} sayısı asaldır` : `${number} sayısı asal değildir`) | |
)) | |
} | |
const isPrimeNumber = (number) => { | |
if(number < 2) return false | |
for (let i = 2; i < number; i++) { | |
if(number % i === 0){ | |
return false; | |
} | |
} | |
return true; | |
} | |
//------------------------------------------------------------ | |
const friendNumbers = (numberA, numberB) => { | |
let sumA = 0, sumB = 0; | |
for (let i = 1; i < numberA; i++) { | |
if(numberA % i === 0){ | |
sumA +=i; | |
} | |
} | |
for (let i = 1; i < numberB; i++) { | |
if(numberB % i === 0){ | |
sumB +=i; | |
} | |
} | |
if((sumA === numberB) && (sumB === numberA)){ | |
return console.log(`${numberA} ve ${numberB} arkadaş sayıdır`); | |
}else{ | |
return console.log(`${numberA} ve ${numberB} arkadaş sayı değildir`); | |
} | |
} | |
//------------------------------------------------------------ | |
const perfectNumber = (number) => { | |
let sum = 0; | |
for (let i = 1; i <= number; i++) { | |
if(number % i === 0){ | |
sum +=i; | |
} | |
} | |
if(number*2 === sum){ | |
return console.log(`${number} mükemmel sayıdır`); | |
}else{ | |
return console.log(`${number} mükemmel sayı değildir`); | |
} | |
} | |
//------------------------------------------------------------ | |
const primeNumbers = () => { | |
for (let i = 0; i < 1000; i++) { | |
if(isPrimeNumber(i) === true){ | |
console.log(`${i} sayısı asaldır`); | |
} | |
} | |
} | |
findPrime(1,9,10,22,19,2) | |
friendNumbers(220,284) | |
perfectNumber(6) | |
primeNumbers() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment