Facebook
From İrem Öztürk, 1 Week ago, written in JavaScript.
Embed
Download Paste or View Raw
Hits: 68
  1. function isPrime(n) {
  2.     if (n <= 1) return false;
  3.     if (n <= 3) return true;
  4.     if (n % 2 === 0 || n % 3 === 0) return false;
  5.     let i = 5;
  6.     while (i * i <= n) {
  7.         if (n % i === 0 || n % (i + 2) === 0) return false;
  8.         i += 6;
  9.     }
  10.     return true;
  11. }
  12.  
  13. function findPrimeNumbers() {
  14.     const primeNumbers = [];
  15.     for (let num = 500; num < 600; num++) {
  16.         if (String(num)[0] === '5' && isPrime(num)) {
  17.             primeNumbers.push(num);
  18.         }
  19.     }
  20.     return primeNumbers;
  21. }
  22.  
  23. function main() {
  24.     const primeNumbers = findPrimeNumbers();
  25.     console.log("Prime numbers with three digits starting with 5:");
  26.     console.log(primeNumbers);
  27. }
  28.  
  29. main();
  30.