Finding Factors of a Given Number in C++

 

To find the factors of a number, we need to identify all the integers that divide the number evenly (without leaving a remainder). For a given number N, its factors are numbers from 1 to N that divide N evenly (i.e., N % i == 0).

Below are a few examples using loops to find factors of a number in C++.

---

1️⃣ Example: Using for Loop to Find Factors

Here’s an implementation of finding factors of a number using a for loop:

#include <iostream>
using namespace std;

int main() {
    int N;

    // Taking input from the user
    cout << "Enter a positive integer: ";
    cin >> N;

    cout << "The factors of " << N << " are: ";

    // Using a for loop to find the factors
    for (int i = 1; i <= N; i++) {
        if (N % i == 0) {
            cout << i << " ";  // Print the factor
        }
    }

    cout << endl;
    return 0;
}

Explanation:

• The loop runs from 1 to N.
• In each iteration, we check if N % i == 0, meaning i is a divisor of N.
• If true, we print i as a factor of N.

Output (Example when N = 12):

Enter a positive integer: 12
The factors of 12 are: 1 2 3 4 6 12

---

2️⃣ Example: Using for Loop with Optimized Approach

Instead of checking all numbers from 1 to N, we can optimize the process. Since factors come in pairs, we only need to check numbers up to √N. For example, if i is a factor of N, then N/i is also a factor. This reduces the number of iterations and improves performance.

#include <iostream>
#include <cmath>
using namespace std;

int main() {
    int N;

    // Taking input from the user
    cout << "Enter a positive integer: ";
    cin >> N;

    cout << "The factors of " << N << " are: ";

    // Optimized approach using sqrt(N)
    for (int i = 1; i <= sqrt(N); i++) {
        if (N % i == 0) {
            cout << i << " ";  // Print the factor
            if (i != N / i) {
                cout << N / i << " ";  // Print the paired factor
            }
        }
    }

    cout << endl;
    return 0;
}

Explanation:

• We loop from 1 to sqrt(N) to check for factors.
• For each factor i, we print both i and N/i (if they are distinct).
• This optimization reduces the number of iterations when finding factors, especially for larger values of N.

Output (Example when N = 12):

Enter a positive integer: 12
The factors of 12 are: 1 12 2 6 3 4

---

3️⃣ Example: Using while Loop to Find Factors

Here’s another example using a while loop to find the factors of a number:

#include <iostream>
using namespace std;

int main() {
    int N, i = 1;

    // Taking input from the user
    cout << "Enter a positive integer: ";
    cin >> N;

    cout << "The factors of " << N << " are: ";

    // Using a while loop to find the factors
    while (i <= N) {
        if (N % i == 0) {
            cout << i << " ";  // Print the factor
        }
        i++;  // Increment i
    }

    cout << endl;
    return 0;
}

Explanation:

• The loop continues until i <= N.
• In each iteration, it checks if i is a factor of N, and prints it if true.

Output (Example when N = 12):

Enter a positive integer: 12
The factors of 12 are: 1 2 3 4 6 12

---

4️⃣ Example: Finding Prime Factors of a Number

Prime factors are factors that are prime numbers. Here’s how you can find the prime factors of a given number:

#include <iostream>
using namespace std;

void primeFactors(int N) {
    // Print the number of 2's that divide N
    while (N % 2 == 0) {
        cout << 2 << " ";
        N /= 2;
    }

    // Now N must be odd. So we can check for odd numbers from 3 to sqrt(N)
    for (int i = 3; i <= sqrt(N); i += 2) {
        while (N % i == 0) {
            cout << i << " ";
            N /= i;
        }
    }

    // If N is a prime number greater than 2
    if (N > 2) {
        cout << N;
    }
}

int main() {
    int N;

    // Taking input from the user
    cout << "Enter a positive integer: ";
    cin >> N;

    cout << "The prime factors of " << N << " are: ";
    primeFactors(N);
    cout << endl;

    return 0;
}

Explanation:

• The function primeFactors first removes the factor of 2 (since it's the only even prime number).
• Then, it checks for odd numbers starting from 3 and continues up to sqrt(N).
• If N is still greater than 2 after the loop, it means N is prime and is printed.

Output (Example when N = 12):

Enter a positive integer: 12
The prime factors of 12 are: 2 2 3

---

5️⃣ Key Points to Remember:

• Factors are numbers that divide a given number evenly.
• The optimized approach (checking up to sqrt(N)) is more efficient for larger numbers.
• Prime factors are the prime numbers that divide the given number without a remainder.

Would you like to explore more examples, such as checking if a number is prime or factorization into prime numbers?