Write a function using list comprehension and at least one helper function. Create a

list of prime numbers from 2 to n. For instance, the prime numbers from 2 to 20 would be

[2,3,5,7,11,13,17,19]. Parameter required, such as 100 or 1000 or 10000, etc. (problem1 n =). Filter out all numbers that ARE palindromes, in other

words do not output any palindromes. Only include numbers that have as a right digit '3'.