C Program to Find Factors of a Number

Finding the factors of a number is a basic exercise in C programming that helps beginners understand loops and conditional statements. A factor of a number is an integer that divides the number completely without leaving a remainder. In this tutorial, we will learn how to find all factors of a given number using C.

Why Learn to Find Factors?

Learning how to find factors improves logical thinking and introduces you to loops and modular arithmetic. Factors are also foundational for understanding concepts like prime numbers, greatest common divisors (GCD), and number theory problems in programming.

Method 1: Using a For Loop

The simplest way to find all factors of a number is to iterate from 1 to the number itself and check which numbers divide it completely.

#include <stdio.h>

int main() {
    int num;
    printf("Enter a number: ");
    scanf("%d", &num);

    printf("Factors of %d are: ", num);
    for (int i = 1; i <= num; i++) {
        if (num % i == 0) {
            printf("%d ", i);
        }
    }
    return 0;
}

Sample output:

Enter a number: 12
Factors of 12 are: 1 2 3 4 6 12

Explanation

• We use a for loop to check each number from 1 to the input number.
• The condition `num % i == 0` checks if `i` divides the number completely.
• If true, `i` is a factor and is printed.

Method 2: Optimized Loop (Up to sqrt(n))

Instead of checking all numbers up to `n`, we can loop up to `sqrt(n)`. If `i` is a factor, then `n/i` is also a factor. This reduces the number of iterations and improves efficiency.

#include <stdio.h>
#include <math.h>

int main() {
    int num;
    printf("Enter a number: ");
    scanf("%d", &num);

    printf("Factors of %d are: ", num);
    for (int i = 1; i <= sqrt(num); i++) {
        if (num % i == 0) {
            printf("%d ", i);
            if (i != num / i) {
                printf("%d ", num / i);
            }
        }
    }
    return 0;
}

Sample output:

Enter a number: 36
Factors of 36 are: 1 36 2 18 3 12 4 9 6 6

Tips for Beginners

• Always start with simple for loop from 1 to n if you are a beginner.
• For large numbers, consider the optimized sqrt(n) approach.
• Remember that 1 and the number itself are always factors.
• Avoid printing duplicate factors in the optimized method when the number is a perfect square.

Practice Exercises

• Find all factors of a number and store them in an array.
• Check if a number is prime by counting its factors.
• Find the GCD of two numbers using their factors.
• Print factors in ascending or descending order.

Conclusion

Finding factors of a number in C is a simple yet important exercise for understanding loops, conditional statements, and number theory basics. Practicing this problem strengthens your logic and prepares you for more complex numeric programming tasks.