An "emirp" ("prime" spelled backward), is a prime number, that is also prime when you reverse its digits, like 13, and 17. Write some code to count how many emirps exists under 1,000. (Ans: 13).← Back to challenges | Lessons Type your code here: Run Share Lua reference See your results here: Share your code × Show a friend, family member, or teacher what you've done! Here is a share link to your code: