Introduction to Programming using Python 1st Edition

Published by Pearson
ISBN 10: 0132747189
ISBN 13: 978-0-13274-718-9

Chapter 6 - Functions - Programming Exercises - Page 209: 6.25

Answer

code

Work Step by Step

# 6.25 (Emirp) An emirp ( prime spelled backward) is a nonpalindromic prime number # whose reversal is also a prime. For example, both 17 and 71 are prime numbers, so # 17 and 71 are emirps. Write a program that displays the first 100 emirps. Display # 10 numbers per line and align the numbers properly, from CH6Module import MyFunctions counter = 1 x = 2 while counter < 101: if MyFunctions.isPrime(x) and MyFunctions.isPrime(MyFunctions.reverse(x)): if counter % 10 != 0: print(x, end=' ') else: print(x) counter += 1 x += 1
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.