|
Displaying Source Code(s)
|
|
Prime Factorization (Mini Project)
--------------------------------------------------------------------------------
Description : Here is the programm which factorizes the intger
number.programm ask for the input if you enter the integer
number 100 then the output of the programm is
(2**2)*(5**2).Where "**" stands for exponential and "*" stands
for multiplication.
Code :
/* Here is the program which do the factorization
of a integer number. like "prime factorization of 100 is:
(2**2)*(5**2)"
where "**" stands for exponentiation and "*" stands for
multiplication.
*/
import java.io.*;
public class Prime_Factorization
{
/* The method sqroot return the square root of integer number.
and it return the largest whole number <= the integer number n.
like sqroot(24) = 4;sqroot(36) = 6;
*/
public static int sqroot ( int n )
{
return
((int)Math.sqrt(n));
}
/* The method just return the true or false that the number is
prime
number or not. this can be check by simple dividing it by the
number upto sqroot of n.
*/
public static boolean pr( int n )
{
if ( n == 1 ) return false;
if ( n == 2 ) return true;
int i = 2 , s = sqroot(n);
while ( ( i <= s ) && ( n % i != 0 ) ) i++;
if ( n % i != 0 )
return true;
else
return false;
}
public static void factors ( int n )
{
if ( pr(n) )
System.out.println("("+n+")");
else
{
int i = 2;
int check = 0;
while ( n > 1 )
{
if ( pr(i) )
{
while ( n % i == 0 )
{
n /= i;
check++;
}
if ( check == 1 )
{
System.out.print("("+i+")");
check = 0;
if ( n > 1 )
System.out.print("*");
}
else
{
if ( check !=0 )
{
System.out.print("("+i+"**"+check+")");
check = 0;
if ( n > 1 )
System.out.print("*");
}
}
}
i++;
}
System.out.println();
}
}
public static void main ( String [] args )
{
try
{
InputStreamReader read = new InputStreamReader ( System.in );
BufferedReader console = new BufferedReader ( read );
System.out.print(" Please Enter the Number : ");
String input = console.readLine();
int n = Integer.parseInt(input);
System.out.println();
System.out.print(" The output : ");
factors(n);
}
catch ( IOException e )
{
System.out.println(e);
System.exit(1);
}
}
} |
|
|
123
Eng