Ask the user for a number and output the smallest divisor, bigger than one, for the inputted number. Output "Prime" if the number is a prime number.

num = int(input("Enter a number: ")) if num < 0: print("The number can't be less than 0.") else: div = 1 found_divisor = False while div <= num and not found_divisor: div += 1 if num % div == 0: found_divisor = True if not found_divisor or div==num: print("The number is a PRIME number.") else: print(div)

LS
Answered by Luca S. Python tutor

1046 Views

See similar Python Mentoring tutors

Related Python Mentoring answers

All answers ▸

What is the difference between DFS and BFS? Where can I apply each?


Print "Hello World!" ten times without typing (or pasting) the print function more than once


How do you write code to implement a recursive fibonacci algorithm?


Give an example of a FOR loop


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences