Breaking News: Grepper is joining You.com. Read the official announcement!

distinct prime factors count of a number

PrashantUnity answered on February 26, 2022 Popularity 8/10 Helpfulness 5/10

answer distinct prime factors count of a number

distinct prime factors count of a number

Comment

       public static int PrimeFactorsCount(int n)
        {
            if(n==1)
            {
                return 0;
            }
            var num = 0;
            if (n % 2 == 0)
            {
                num++;

                while (n % 2 == 0)
                {
                    n /= 2;
                }
            }

            for (int i = 3; i <= Math.Sqrt(n); i += 2)
            {
                if (n % i == 0)
                {
                    num++;

                    while (n % i == 0)
                    {
                        n /= i;
                    }
                }
            }

            if (n > 2)
                num++;
            return num;
       }

Popularity 8/10 Helpfulness 5/10 Language csharp

Source: Grepper

Tags: c# count distinct factors

Link to this answer
Share Copy Link

Contributed on Feb 26 2022

PrashantUnity

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

distinct prime factors count of a number

Contents

More Related Answers

distinct prime factors count of a number

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.