javascript_practice/prime2.html at master · beaver84/javascript_practice · 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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
<!DOCTYPE html>
<html lang="ko">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>소수 찾기</title>
</head>
<body>
    <h1>소수 목록들</h1>
    <div id = "result"></div>
    <script>
        var numbers = {};
        numbers.all = [];
        numbers.prime = [];

        numbers.isPrime = function(number) {
            for (var i = 2; i < number; i++) {
                if (number % i == 0) {
                    return false;
                }
            }
            return true;
        };

        numbers.addAllNumber = function(max_num) {
            for (var i = 2; i <= max_num; i++) {
                   this.all.push(i);
            }
        };

        numbers.calcPrimes = function() {
            for (var i = 0; i < this.all.length; i++) {
                var n = this.all[i];
                if (this.isPrime(n)) {
                    this.prime.push(n);
                }
            }
        };

        numbers.getAllPrimeNumbers = function() {
            var ret = "";
            ret += "<h2>전체 소수의 갯수:" + this.prime.length + "</h2>\n";
            for (var i = 0; i < this.prime.length; i++) {
                ret += (i+1) + "번째 소수: " + this.prime[i] + "<br>\n";
            }
            return ret;
        };

        numbers.addAllNumber(10000);
        numbers.calcPrimes();
        document.getElementById('result').innerHTML = numbers.getAllPrimeNumbers();

    </script>
</body>
</html>