first10000primes/first_10000_prims.htm at master · generatorOf/first10000primes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
<!DOCTYPE html>

<html>

<head>
    <title>js </title>
    <meta charset="utf-8">
</head>

<body>
<div id="ausgabe">Öffne die Konsole mit strg+shift+K</div>
<script>
    "use strict";
    const getPrimeNumbers = (howMany, primeNumbers=[2], candidate=3)=>{
      if (howMany==primeNumbers.length) return primeNumbers;
      if(primeNumbers.some(a=>candidate%a===0)){
        return getPrimeNumbers(howMany,primeNumbers, candidate+1)
      } else {
        primeNumbers.push(candidate);
        //console.log(primeNumbers);
      }
      //hier wird der Array mit einer neu gefundenen Primzahl ausgegeben
      return getPrimeNumbers(howMany, primeNumbers, candidate+1)
    }


console.log(getPrimeNumbers(2000));
// becose of 'too much recursion' works only ca till 2000 primes
// es funktioniert!!!

</script>
</body>

</html>