CodeCrucks

CodeCrucks

Program to Find Prime Factors of Number using While loop

Program to Find Prime Factors of Number using While loop

by · Published · Updated

  • Write a program to Find Prime Factors of Number using While loop in C
  • Write a program to Find Prime Factors of Number using While loop in C++
  • Write a program to Find Prime Factors of Number using While loop in Python
  • Write a program to Find Prime Factors of Number using While loop in PHP
  • Write a program to Find Prime Factors of Number using While loop in Java
  • Write a program to Find Prime Factors of Number using While loop in Java Script
  • Write a program to Find Prime Factors of Number using While loop in C#

Explanation:

Logic:

  1. Definition of Prime Factors:
    • Prime factors of a number are prime numbers that divide the number without leaving a remainder.
  2. Divide by Smallest Primes:
    • Start with the smallest prime number (2) and check divisibility.
    • If divisible, divide the number and continue checking for the same factor until it no longer divides.
  3. Iterate Through Possible Divisors:
    • Use a for loop to check divisibility for all numbers from 2 to the square root of the number.
    • If a divisor is found, reduce the number and repeat until it becomes 1.

Program to Find Prime Factors of Number using While loop

#include <stdio.h>

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

    printf("Prime factors of %d are: ", num);
    while (num > 1) {
        if (num % i == 0) {
            printf("%d ", i);
            num /= i;
        } else {
            i++;
        }
    }

    return 0;
}


#include <iostream>
using namespace std;

int main() {
    int num, i = 2;
    cout << "Enter a number: ";
    cin >> num;

    cout << "Prime factors of " << num << " are: ";
    while (num > 1) {
        if (num % i == 0) {
            cout << i << " ";
            num /= i;
        } else {
            i++;
        }
    }

    return 0;
}

num = int(input("Enter a number: "))
i = 2

print(f"Prime factors of {num} are: ", end="")
while num > 1:
    if num % i == 0:
        print(i, end=" ")
        num //= i
    else:
        i += 1


<?php
$num = intval(readline("Enter a number: "));
$i = 2;

echo "Prime factors of $num are: ";
while ($num > 1) {
    if ($num % $i == 0) {
        echo "$i ";
        $num /= $i;
    } else {
        $i++;
    }
}
?>


import java.util.Scanner;

public class PrimeFactors {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a number: ");
        int num = sc.nextInt();

        System.out.print("Prime factors of " + num + " are: ");
        int i = 2;
        while (num > 1) {
            if (num % i == 0) {
                System.out.print(i + " ");
                num /= i;
            } else {
                i++;
            }
        }
    }
}


<div class="contain-inline-size rounded-md border-[0.5px] border-token-border-medium relative bg-token-sidebar-surface-primary dark:bg-gray-950"><div class="overflow-y-auto p-4" dir="ltr"><code class="!whitespace-pre hljs language-javascript">let num = parseInt(prompt("Enter a number: "));
let i = 2;

console.log(`Prime factors of ${num} are:`);
while (num > 1) {
    if (num % i === 0) {
        console.log(i);
        num /= i;
    } else {
        i++;
    }
}


using System;

class Program {
    static void Main() {
        Console.Write("Enter a number: ");
        int num = int.Parse(Console.ReadLine());

        Console.Write("Prime factors of " + num + " are: ");
        int i = 2;
        while (num > 1) {
            if (num % i == 0) {
                Console.Write(i + " ");
                num /= i;
            } else {
                i++;
            }
        }
    }
}

List of All Programs