While(countOfDigits(factorizePrime)>1):įactorizePrime = sumOfDigits(factorizePrime) Print('***The number you entered is prime, hence can't be a smith number***') #Function to check whether a number is a Smith Number or not The 2 sums are then compared to return a true or false of checking the number entered being Smith number.ĭifferent examples are mentioned below: Example #1.Finally, this sum of prime factors is returned.Now, another function is written to find the factors, check for the factors to be prime, and if true, then keep summing those up.Now, we define another function to check for a number being prime.Using the concept of finding the last digit, we keep summing up the digits one by one to finally return the sum and store it into a variable.We will go through the pseudocode here and then use it to implement it into C++/Python/Java. Now using the below step-by-step algorithm, let us understand it theoretically and then implement it into respective. The code implementation tries to test the entire logic by breaking it down into writing the logic of testing prime, the sum of the prime factors, and some of the digits in the number.Now the sum of the prime factors (11 and 11) is 1 + 1 + 1 + 1 = 4. Even if the number is a square, we need to take the same number twice. We will see the logic using an example if the number is 121, it satisfies the condition that 121 is a composite number, now the sum of the digits is equal to 1 + 2 + 1 = 4, and the prime factors of the number are 11 and 11 as 1, and 121 is not a prime number.Albert Wilansky introduced this number after he found this pattern in the telephone number of his brother-in-law. Try doing it with another number of your choice. Thus, in the example of number = 121, since the sum of the digits in the original number and the digits in the prime factor are the same, we call the number as Smith number. Smith number is defined as a recreational mathematics number in a number series that has to be a composite number, and the digits in the prime factors of the number sum up to being equal to the sum of the digits in the number itself.

Program to check prime number in prolog