Question

2. filename: factorization.c (use factorization.out with input files factorization_input1, factorization_input2) In many cases, it is not enough to know whether a number is prime; sometimes, you need to know its factors. Every positive integer greater than 1 can be expressed as a product of prime numbers. This factorization is unique and is called the prime factorization. For example, the number 60 can be decomposed into the factors 2 x 2 x 3 x 5, each of which is prime. Note that the same prime can appear more than once in the factorization. Write a program to display the prime factorization of a number n. The following is a sample run of the program: pear more thathe factors 2x2 prime factorized as a produs Enter number to be factored: 60 2*2*3*5

the <stdbool.h> library might be useful. Also, you might need to define TRUE and FALSE to be 1 and 0, respectively

Answer 1

#include <stdio.h>

int main() {
    int n, num, product = 1, i = 2;
    printf("Enter number to be factored: ");
    scanf("%d", &n);
    num = n;
    while (product != num && i <= n) {
        if (n % i == 0) {
            n /= i;
            product *= i;
            printf("%d", i);
            if (product != num) {
                printf(" * ");
            }
        } else {
            i++;
        }
    }
    printf("\n");
    return 0;
}

Enter number to be factored: 60 2 * 2 * 3 * 5