Write a c program to find prime factor using recursion?

Answer 1

The following program prints all the prime factors of a given number 'n':# include # include // A function to print all prime factors of a given number nvoid primeFactors(int n){ // Print the number of 2s that divide n while (n%2 == 0) { printf("%d ", 2); n = n/2; } // n must be odd at this point. So we can skip one element (Note i = i +2) for (int i = 3; i <= sqrt(n); i = i+2) { // While i divides n, print i and divide n while (n%i == 0) { printf("%d ", i); n = n/i; } } // This condition is to handle the case whien n is a Prime number // greater than 2 if (n > 2) printf ("%d ", n);} /* Driver program to test above function */int main(){ int n = 315; primeFactors(n); return 0;}

Answer 2

#include<stdio.h>

#include<conio.h>

int prime(int);

int main()

{

int x;

printf("\nInput an integer\n");

scanf("%d",&x);

prime(x);

getche();

}

prime(int x)

{

int a;

for(a=2;a<=x;a++)

{

if(x%a==0)

{

printf("%d ",a);

prime(x/a);

break;

}

}

}

Answer 3

The program is as follows:

#include <stdio.h>

void main()

{

int number = 0;

int count = 1;

int i = 0;

printf("Enter the number whose prime factor is to be determined: \t"\n);

scanf("%d", &number);

while((number /2) > ++count)

{

if(number % count == 0)

{

printf("factor = [%d]\n", count);

}

}

}