Prime factors of a number

Jittery Jay answered on May 13, 2021 Popularity 10/10 Helpfulness 1/10

answer Prime factors of a number

related prime factors of a number

related Prime Factors of a Number

related prime factors of a number

Prime factors of a number

Comment

public List<Integer> factorsOf(int n) {
  ArrayList<Integer> factors = new ArrayList<>();

  for (int d = 2; n > 1; d++)
    for (; n % d == 0; n /= d)
      factors.add(d);

  return factors;
}

Popularity 10/10 Helpfulness 1/10 Language java

Source: blog.cleancoder.com

Tags: factors java

Link to this answer
Share Copy Link

Contributed on May 13 2021

Jittery Jay

0 Answers Avg Quality 2/10

Closely Related Answers

prime factors of a number

Comment

public static List<int> PrimeFactors(int n)
{
    if (n == 1)
    {
        return null;
    }
    var list = new List<int>();
    if (n % 2 == 0)
    {
        list.Add(2);

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

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

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

    if (n > 2)
        list.Add(n);
    return list;
}

Popularity 10/10 Helpfulness 2/10 Language csharp

Source: Grepper

Tags: c# c

Link to this answer
Share Copy Link

Contributed on Feb 26 2022

PrashantUnity

0 Answers Avg Quality 2/10

Prime Factors of a Number

Comment

-2

def primeFactors(n):
  global factors
  if(n==1):
    return
  elif((n%factors)== 0):
    print(factors)
    primeFactors(n//factors)
  else:
    factors+=1
    primeFactors(n)
factors = 2

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: studyeze.in

Tags: factors

Link to this answer
Share Copy Link

Contributed on Aug 17 2021

Ugly Unicorn

0 Answers Avg Quality 2/10

prime factors of a number

Comment

-2

public static List<int> PrimeFactors(int n)
{
    if (n == 1)
    {
        return null;
    }
    var list = new List<int>();
    if (n % 2 == 0)
    {
        list.Add(2);

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

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

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

    if (n > 2)
        list.Add(n);
    return list;
}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: factors

Link to this answer
Share Copy Link

Contributed on Apr 08 2022

HARSH MESHRAM

0 Answers Avg Quality 2/10

Prime factors of a number

Contents

More Related Answers

Prime factors of a number

Closely Related Answers

prime factors of a number

Prime Factors of a Number

prime factors of a number

Grepper

Documentation

Social

Legal

Contact

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