Reference no: EM131955313

The project consists of multiple portions. The first three parts consists of writing functions and the final part consists of sorting a list of numbers using those functions. They are as follows:

Part 1

A palindrome is a number which reads the same forward and backwards.

To illustrate:

10101,131,1331,1225221,2 are examples of palindromes

122,100,19 are examples of numbers which are not palindromes.

function that given a number determines if the number is a palindrome or not. Your function should take in a number and return "yes" or "no" depending if it's a palindrome or not.

Part 2

function that given a number determines if the number is near prime. To understand what is near prime let us first understand what a prime number is.

A number is prime is it is only divisible by 1 and itself.

2,5,13,23 are examples of prime numbers.

4,22,100,60 are examples of numbers which are not prime numbers.

Consider a number such as 49. It is not a prime number because it is divisible by 7. However, it is not divisible by anything else apart from 1, 7 and 49.

We call a number near prime if it is divisible by 1, itself and at most 2 other numbers. To illustrate:

49 is near prime as only 1,7 and 49 divide it.

22 is near prime as only 1,2,11,22 divide it.

4 is near prime as only 1,2,4 divide it.

60 is not near prime as 1,2,3,5,6,10,12,20,30,60 divide it.

17 is near prime as only 1,17 divide it

20 is not near prime as 1,2,4,5,10,20 divide it.

function which determines if a number is near prime or not.

Your function should take in a number and return "yes" or "no" depending if it's a near prime or not.