Question

Prime numbers are the building blocks of all integers greater than 1. Any integer n > 1 can be written as a unique product of primes i.e. n = p1 × p2 × ... × pm. Here, pi are primes such that p1 ≤ p2 ≤ ... ≤ pm. Take, for example, the number 18. It can be written as 18 = 2 × 3 × 3. 1.

Write a Python function prime divisors(n) which accept an integer n and returns the prime divisors as the output. The output must be in the form of a list

In Python, please, with explanation if possible.

Answer 1

Answer:-

The below is the required source code for the given problem in Python

Code:-

def primeDivisorUnqiue(n):
numberCopy = n;
i=1
primeNumber = []
while(i<=n):
k=0
if(n%i==0):
j=1
while(j<=i):
if(i%j==0):
k=k+1
j=j+1
if(k==2):
primeNumber.append(i)
i=i+1
primeCount = []
  
for number in primeNumber:
count = 0;
while numberCopy%number==0:
count=count+1;
numberCopy = numberCopy/number
primeCount.append(count);
  
return [primeNumber,primeCount]

n=int(input("Enter an integer:"))
result = primeDivisorUnqiue(n)
print("Prime number list is : ",result[0])
print("Prime number count list is : ",result[1])

If you find difficulty to understand the code, please let me know in comments tab below, Then I will provide another code or else i will any modifications in the present code. Hope it will helps you. Please give Thumbs Up!! Thank you for posting the question, All the best.