javascript 素数的两个方法

最新推荐文章于 2023-06-26 08:16:55 发布

kekel1989

最新推荐文章于 2023-06-26 08:16:55 发布

阅读量727

点赞数

分类专栏： JavaScript 文章标签： javascript 素数

JavaScript 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

觉得无聊，从其他地方那拿来的

<!DOCTYPE html>
<html>
<head lang="en">
    <meta charset="UTF-8">
    <title></title>
</head>
<body>
    <script>
        //素数：一个数的因数只有两个（1和它本身）

        //how would you verify a prime number
        function isPrime(number){
            var divisor = 2;
            while(number > divisor){
                if(number % divisor == 0){
                        return false;
                }else{
                        divisor++;
                }
            }
            return true;
        }

        //alert(isPrime(101));

        //how would you get all prime factors of a number
        function primeFactors(number){
            var factors = [];
            var divisor = 2;
            while(number > divisor){
                if(number % divisor == 0){
                    factors.push(divisor);
                    number = number / divisor;
                }else{
                    divisor++;
                }
                return factors;
            }
        }
        alert(primeFactors(4));


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