Question

a) Write a program that uses a while loop to print all divisors of a number supplied by the user. The program should also print the sum of all the divisors and whether the number the user entered is a prime number or not. Note: The definition of a divisor is a number that divides another evenly (i.e., without a remainder) and the definition of a prime number is a number whose only divisors are 1 and itself.

b) Implement the same program as above using a for loop instead of a while loop. Which implementation do you think is the better choice for this problem? Discuss with a friend and/or a TA if you are unsure.

Sample Outputs (user input highlighted)

Enter an integer: 20

The divisors are:

1

2

4

5

10

20

The sum of the divisors is 42

The number is not prime.

Enter an integer: 19

The divisors are:

1

19

The sum of the divisors is 20

The number is prime!

use Python

Answer 1

Here in this Python Program

- We are accepting int input from the user and calling the function Divisors

- The first step, we are calculating the divisors for the number

- Then printing the divisors of that number

- Again calculating the sum of the divisors and printing on to the screen

- Checking if the number is prime or not and

- Finally printing whether it is prime or not.

Program using While Loop:

def Divisors(num):
divisors_list=[]
#calculating Divisors for a Number
i=1
while i<=num:
if(num%i==0):
divisors_list.append(i)
i=i+1
print("The Divisors are:")
for i in divisors_list:
print(i)
sum=0
#Calulcating the Sum of Divisors
for i in range(0,len(divisors_list)):
sum=sum+divisors_list[i]
print("The sum of the Divisor is",sum)
  
#checking whether the number is prime or not
if num>1:
for i in range(2,num//2):
if num%i==0:
print("The Number is not prime")
break;
else:
print("The Number is prime!!!")
else:
print("The Number is not prime")
  

number=int(input("Enter an integer: "))
Divisors(number)

Output:

Program using For Loop:

def Divisors(num):
divisors_list=[]

#calculating Divisors for a Number
for i in range(1, num + 1):
if num % i == 0:
divisors_list.append(i)
#printing divisors
print("The Divisors are:")
for i in divisors_list:
print(i)
sum=0
#Calulcating the Sum of Divisors
for i in range(0,len(divisors_list)):
sum=sum+divisors_list[i]
print("The sum of the Divisor is",sum)
  
#checking whether the number is prime or not
if num>1:
for i in range(2,num//2):
if num%i==0:
print("The Number is not prime")
break;
else:
print("The Number is prime!!!")
else:
print("The Number is not prime")
  

number=int(input("Enter an integer: "))
Divisors(number)

Output:

Hope this Helps!!!

If not please comment, I will Help you with that....