Find Prime Factors of a Given Integer

❮ Previous Next ❯

A Python program to find the prime factors of a given integer.

Step-by-Step Explanation

Function Definition
- Define a function prime_factors(n) that finds and prints the prime factors of n.
Loop from 2 to n
- Iterate i from 2 to n to check for divisibility.
Check Divisibility
- Use while n % i == 0: to check if n is divisible by i.
Print Factor & Reduce n
- If i is a prime factor, print i.
- Update n = n // i to remove the factor from n.
Repeat Until Fully Divided
- Continue dividing n by i until n is no longer divisible by i.
User Input
- Take a number as input from the user.
- Call prime_factors(n) to print its prime factors.

Program:

def prime_factors(n):

    for i in range(2, n + 1):

        while n % i == 0:

            print(i, end=" ")

            n //= i


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

print("Prime Factors:", end=" ")

prime_factors(num)

❮ Previous Next ❯

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Find Prime Factors of a Given Integer

Step-by-Step Explanation

Important Links

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Python Coding Questions on Numbers

Python Coding Questions on String

Python Coding Questions On List

Python Coding Questions On Dictionary

Python Coding Questions On Star Pattern

Find Prime Factors of a Given Integer

Step-by-Step Explanation

Important Links