Smallest-prime-factor.md

Smallest prime factor [premium]

The problem

Find the smallest prime factor for the given number.

Solution Hint

After finishing all the prime factors, this will be a piece of cake for you.

Solution

def get_smallest_factor(num):
   factor = 2
   while num % factor != 0:
       factor += 1
   return factor
 
num = int(input('Enter your number: '))
 
smallest_factor = get_smallest_factor(num)
 
print('The smallest prime factor is: ', smallest_factor)

Explanation

Since we need only one factor. We can do it more easily.

Just run a while loop. The condition of the loop is checking the remainder. If there is no remainder, the number got divided and you got the prime factor. If the remainder is not 0, then increase the factor by one.

   

tags: programming-hero python python3 problem-solving programming coding-challenge interview learn-python python-tutorial programming-exercises programming-challenges programming-fundamentals programming-contest python-coding-challenges python-problem-solving