Python question

Question

Write a program called palindromeprimes.py that uses recursive functions to find all palindromic primes between two integers N, M, supplied as input. (start and end points are included).
To calculate whether a number is a palindrome or not, incorporate your answer to question 1. examples of palindromic primes are 11, 191, 313.

You may assume it's always the case that N>1 and that N≤M. No form of loop must be used in your program.

Answer 1

Doing it by recursion does not look interesting. Here is what you get if you try to make it fast.

https://code.sololearn.com/cCp5Kdx3vUDF/?ref=app

Answer 2

No loop but less efficient

https://code.sololearn.com/cH54SdVg5uDF/?ref=app

Answer 3

Trying to have sololearners doing your homework is bad !

Answer 4

how would anyone here go about that? helping out a friend.

oh and add the following lines to the top of your program to increase the amount of recursion that python will allow:
import sys
sys. setrecursionlimit (30000)

Answer 5

well thats what the question wants

Answer 6

its for my friend XD, not me

Answer 7

I'm not even doing python, I've been doing Javascript for the past weeks