Codex

Prime Factors

Jul 28th, 2011
125
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.54 KB | None | 0 0
  1. /*
  2. Program to find prime factors of any number
  3. Example:
  4. number = 6
  5. Prime Factors=2,3
  6. 2*3=6
  7.  
  8. number =15
  9. Prime Factors=3,5
  10. 3*5=15
  11.  
  12. number=45
  13. Prime Factors=3,3,5
  14. 3*3*5
  15. 9*5
  16. 45
  17. */
  18. import java.util.Scanner;
  19. class PrimeFactors
  20. {
  21. public static void main(String args[])
  22. {
  23. Scanner sc=new Scanner(System.in);
  24. System.out.println("Enter a number");
  25. int n=sc.nextInt();
  26. primeFactors(n);
  27. }
  28. void static primeFactors(int num)
  29. {
  30. int i;
  31. while(num!=1)
  32. {
  33. for(i=2;;i++)
  34. {
  35. if((num%i)==0)
  36. break;
  37. }
  38. System.out.println(i);
  39. num=num/i;
  40. }
  41. }
  42. }
Advertisement
Add Comment
Please, Sign In to add comment