Question

The prime factorization of a number is the unique list of prime numbers that, when multiplied, gives the number. For example, the prime factorization of 60 is 2 ∗ 2 ∗ 3 ∗ 5. In this problem you must write code to recursively find and return the prime factorization of the given number. You must print these in ascending sorted order with spaces in between.

For example, if your input is:

120

then you should print the following output:

2 2 2 3 5

Any solutions that do not use recursion will receive a grade of zero for all categories. (However, there are multiple good recursive solutions that exist for this problem.) Code for reading input and writing output has been provided in the Main class; your job is to complete the factorize() method. You may assume your input number is between 2 and 1,000, inclusive, and you may alter the starting code and/or use helper functions if you like.

java

Answer 1

import java.util.*;
import java.lang.Math;

class Factor
{
   static int i = 2; // static variable
   public static void factorize(int n)
   {
      
       if ( i <= n) // if i is less than the number
       {
           if (n % i == 0) // if i divides n
           {
               System.out.print(i + " "); // print i
               n = n/i; // divide n by i
           }
           else
               i++; // otherwise increment i by 1
           factorize(n); // recursive call
       }
       return;
          
   }
   // Main Method
   public static void main (String[] args)
   {
       Scanner in = new Scanner(System.in);
      
       System.out.print("Enter a number : ");
       int n = in.nextInt();
      
       System.out.print("Prime Factors of " + n + " are : ");
       factorize(n);
   }
}