+ 1

# What's perfect prime?How do you code that?

2 Answers

+ 2

Perfect Prime Number
Procedure:
a) Calculate the whole number (w) greater then square root of n.
b) Find the prime numbers[p(x)] less than the whole number(w).
c) Now check if the given number n is divisible by any of the prime numbers p(x).
d) If it gets divided then the number n is not a prime number else it is a perfect prime number. Example:
Validate if 131 is prime number.
Step1: Square root of 131 = 11.44 =12.(appx) Step2: Prime Numbers less than 12 are 2,3,5,7,11 Step3: Given number 131 is not divisible by 2 or 3 or 5 or 7 or 11 So , the given number is a prime perfect number.

+ 1

ðŸ˜ŠðŸ˜ŠðŸ˜Š @Mohit