Question: IN HASKELL Write a function using a list comprehension or recursion with at least one helper function. The number 3797 has an interesting property. Being

IN HASKELL
Write a function using a list comprehension or recursion with at least one helper
function. The number 3797 has an interesting property. Being prime itself, it is possible to
continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97,
and 7. Similarly we can work from right to left: 3797, 379, 37, and 3. Find the primes from
3000 to 4000 that are both truncatable from left to right and right to left. Note: 2, 3, 5, and 7 are
not considered to be truncatable. Do not include numbers with zeros. Have two parameters for
your function: start and end.
solveProblem3 3000 4000
[3137,3797]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!