Is Integer Factorization Harder Than RSA Factorization?

Whats wrong with my prime factorization C program?

• my program works well but the only problem is in never outputs hte number 2. when i enter the integer 18 its supposed to spit out the prime factorization which is 2 3 3 but it gives me 3 3. whats wrong... #include<stdio.h> int main() { while(3){ printf("\nEnter an integer: "); int n, x, y, z, k; k = 2; x = 2; while(2){ scanf("%d", &n); if (n <= 1) return (0); if (n > 1) break; } printf("The prime factorization of %d is ",n); while(1){ if (n % k == 0) (n = (n/k)); if (n % k != 0) (k = k + 1); if(k > n) break; if (n % k == 0) printf("%d ",k); } } printf("\n"); return 0; }

• Answer:

  There is a much easy prime factor. http://cquestionbank.blogspot.in/2008/01/write-c-program-to-find-prime-factors.html I hope help you.