This repo is created for kodlama.io(click to see) JS certificate course
Completed day 2's homework.
Time efficiency is taken into account for this functions(Big O Notation)
-
1 - Write a function that you can send as many parameters as you want with JavaScript. For each number you send to this function, write whether it is prime or not as the output(prime numbers)
-
2 - Write a program to find whether two numbers entered as parameters are friend numbers(amicable or friendly numbers)
-
3 - Write a program that lists all perfect numbers up to 1000(perfect numbers)
-
4 - Write a program that lists all prime numbers up to 1000