how to factor a number java

sum of factors of a number in java
how to find prime factors of a number in java
number of factors of a number java
write a java program to find factors of a number from 1 to 100
how to find multiples of a number in java
java program to find factors of a number using recursion
factorial of a number in java
efficient prime number program in java

I need to factorize a number like 24 to 1,2,2,2,3. My method for that:

static int[] factorsOf (int val) {
          int index = 0;
      int []numArray = new int[index];

      System.out.println("\nThe factors of " + val + " are:");
      for(int i=1; i <= val/2; i++)
      {
          if(val % i == 0)
          {   
              numArray1 [index] = i;
              index++;
          }
      }

      return numArray;

  }

however, it is not working. Can anyone help me for that?

You have a few errors, you cannot create int array without size. I used array list instead.

static Integer[] factorsOf(int val) {
    List<Integer> numArray = new ArrayList<Integer>();

    System.out.println("\nThe factors of " + val + " are:");
    for (int i = 2; i <= Math.ceil(Math.sqrt(val)); i++) {
        if (val % i == 0) {
            numArray.add(i);
            val /= i;
            System.out.print(i + ", ");
        }
    }
    numArray.add(val);
    System.out.print(val);
    return numArray.toArray(new Integer[numArray.size()]);
}

Full program using int[] according to your request.

public class Test2 {
    public static void main(String[] args) {
        int val = 5;
        int [] result = factorsOf(val);
        System.out.println("\nThe factors of " + val + " are:");
        for(int i = 0; i < result.length && result[i] != 0; i ++){
            System.out.println(result[i] + " ");
        }
    }

    static int[] factorsOf(int val) {
        int limit = (int) Math.ceil(Math.sqrt(val));
        int [] numArray = new int[limit];
        int index = 0;

        for (int i = 1; i <= limit; i++) {
            if (val % i == 0) {
                numArray[index++] = i;
                val /= i;
            }
        }
        numArray[index] = val;
        return numArray;
    }
}

how to factor a number java, In this program, you'll learn to display all factors of a given number using for loop in Java. Java Program to Find Factors of a Number First Iteration. For the first Iteration, Number = 6 and i = 1. Condition inside the For loop (1 <= 6) is TRUE. So, the compiler will start executing statements inside the For loop. Within the for loop, we have the If Statement and the condition if (6 % 1 == 0) is TRUE.

public int[] primeFactors(int num)
{
    ArrayList<Integer> factors = new ArrayList<Integer>();
    factors.add(1);
    for (int a = 2;  num>1; )
        if (num%a==0)
        {
            factors.add(a);
            num/=a;
        }
        else
            a++;
    int[] out = new int[factors.size()];
    for (int a = 0; a < out.length; a++)
        out[a] = factors.get(a);
    return out;
}

Java Program to Display Factors of a Number, Logic to find factors of a number consists of below steps. Loop from 1 till the number. In every iteration divide the number whose factors need to be determined by current loop counter and check the remainder of division. If the remainder is zero, then the current loop counter is a factor of given number else not. Initially, create a class named as factors and inside the main block, create a variable named Number to take input of number whose factors are to be Determined. Take the input of the number through the help of the scanner class of the util package.

A Working example

public class Main
{
public static void main(String[] args)
{
    System.out.println(factorsOf(24));
}

static List<Integer> factorsOf (int val) {

      List<Integer> factors  = new ArrayList<Integer>();
      for(int i=1; i <= val/2; i++)
      {
          if(val % i == 0)
          {
              factors.add(i);
          }
      }

      return factors;

  }

  }

Factors of a number in java, Write a Java Program to find Factors of a Number using For Loop, While Loop, Do While Loop, and Functions. The numbers that are completely divisible by the � how to factor a number java. Ask Question. Asked 8 years, 10 months ago. Active 1 year, 1 month ago. Viewed 18k times. 4. I need to factorize a number like 24 to 1,2,2,2,3. My method for that: static int[] factorsOf (int val) { int index = 0; int []numArray = new int[index]; System.out.println(" The factors of " + val + " are:"); for(int i=1; i <= val/2; i++) { if(val % i == 0) { numArray1 [index] = i; index++; } } return numArray; }

Are you looking a more faster way?:

static int[] getFactors(int value) {
    int[] a = new int[31]; // 2^31
    int i = 0, j;
    int num = value;
    while (num % 2 == 0) {
        a[i++] = 2;
        num /= 2;
    }
    j = 3;
    while (j <= Math.sqrt(num) + 1) {
        if (num % j == 0) {
            a[i++] = j;
            num /= j;
        } else {
            j += 2;
        }
    }
    if (num > 1) {
        a[i++] = num;
    }
    int[] b = Arrays.copyOf(a, i);
    return b;
}

Java Program to Find Factors of a Number, Prime factors in java. Java Programming Java8Java.IO Package. Factors are the numbers we multiply to� Before jumping into java program, here is the brief overview of factors of a number. A number F is a factor of number N, if and only if F divides N completely without leaving any remainder (N % F = 0). For example, 3 is a factor of 24 because 3 divides 24 without leaving any remainder. 24 / 3 = 8. and 24 % 3 = 0;

Most of the approaches suggested here have 0(n) time complexity. This can be easily resolved using binary search approach with 0(log n) time complexity.

What do you basically are looking for is called Prime Factors (although 1 is not considered among prime factors).

//finding any occurrence of the no by binary search
static int[] primeFactors(int number) {
    List<Integer> al = new ArrayList<Integer>();
    //since you wanted 1 in the res adn every no will be divided by 1;
    al.add(1); 

    for(int i = 2; i< number; i++) {
     while(number%i == 0) {
        al.add(i);
        number = number/i;
     }
  }
  if(number >2) 
     al.add(number);

  int[] res = new int[al.size()];
  for(int i=0; i<al.size(); i++)
    res[i] = al.get(i);

  return res;
}

Say input is 24, we keep dividing the input by 2 till all multiples of 2 are gone, the increase i to 3

Here is a link to the working code: http://tpcg.io/AWH2TJ

Prime factors in java, ArrayList; import java.util.List; public class PrimeFactors { public static List< Integer> primeFactors(int number) { int n = number; List<Integer> factors = new� Run-length encoding (find/print frequency of letters in a string) Sort an array of 0's, 1's and 2's in linear time complexity Checking Anagrams (check whether two string is anagrams or not) Relative sorting algorithm Finding subarray with given sum Find the level in a binary tree with given sum K

Prime Factorization - Algorithm in Java - Tutorial, learnwithkrishnasandeep #javacodinginterviewquestions #javaexamples # javaprograms Duration: 9:40 Posted: 25 Sep 2016 Java Program to Find Factorial of a Number In this program, you'll learn to find the factorial of a number using for and while loop in Java. The factorial of a positive number n is given by: factorial of n (n!) = 1 * 2 * 3 * 4 * * n

Write a java program to find factors of number from 1 to 100, This Java Tutorial video shows a simple Java program that demonstrates how to find factors Duration: 6:13 Posted: 30 Jan 2013 Java Programming Java8 Java.IO Package. Factors are the numbers we multiply to get another number. factors of 14 are 2 and 7, because 2 × 7 = 14. Some numbers can be factored in more than one way. 16 can be factored as 1 × 16, 2 × 8, or 4 × 4. A number that can only be factored as 1 times itself is called a prime number.

38 Java Factors of Number |, And if the input number is 315, then output should be “3 3 5 7”. Following are the steps to find all prime factors. 1) While n is divisible by 2, print 2 and divide n by 2. A prime is an integer greater than one those only positive divisors are one and itself. The prime factorization of an integer is the multiset of primes those product is the integer.

Comments
  • You've defined an array of zero length. You want a datastructure that can change size on the fly, like ArrayList.
  • Nice observation. Removed it, modified the actual code to make it work. Missed out removing it. Thanks.