forked from TheAlgorithms/Python
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpalindromic_prime_check.py
119 lines (100 loc) · 3.18 KB
/
palindromic_prime_check.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
"""
A palindromic prime is a prime number that is also palindromic, meaning it remains
the same when its digits are reversed.
For more information about palindromic primes, refer to:
https://en.wikipedia.org/wiki/Palindromic_prime
"""
def is_prime(number: int) -> bool:
"""
Check if a number is prime.
Args:
number: A positive integer.
Returns:
True if the number is prime, False otherwise.
Raises:
ValueError: If number is not a positive integer.
Examples:
>>> is_prime(2)
True
>>> is_prime(3)
True
>>> is_prime(88)
False
>>> is_prime(1)
False
>>> is_prime(9679)
True
>>> is_prime(0)
Traceback (most recent call last):
...
ValueError: Input must be a positive integer.
>>> is_prime(-17)
Traceback (most recent call last):
...
ValueError: Input must be a positive integer.
>>> is_prime(9.51)
Traceback (most recent call last):
...
ValueError: Input must be a positive integer.
>>> is_prime("261")
Traceback (most recent call last):
...
ValueError: Input must be a positive integer.
"""
if not isinstance(number, int) or number <= 0:
raise ValueError("Input must be a positive integer.")
if 1 < number < 4:
return True
elif number < 2 or (number % 2 == 0):
return False
# Return True if number is not divisible by any odd number up to its square root
return all(number % i != 0 for i in range(3, int(number**0.5) + 1, 2))
def palindromic_prime_check(number: int) -> bool:
"""
Check if a number is a palindromic prime number.
Args:
number: A positive integer.
Returns:
True if the number is a palindromic prime number, False otherwise.
Raises:
ValueError: If number is not a positive integer.
Examples:
>>> palindromic_prime_check(13)
False
>>> palindromic_prime_check(131)
True
>>> palindromic_prime_check(121)
False
>>> palindromic_prime_check(929)
True
>>> palindromic_prime_check(2)
True
>>> palindromic_prime_check(7)
True
>>> palindromic_prime_check(0)
Traceback (most recent call last):
...
ValueError: Input must be a positive integer.
>>> palindromic_prime_check(-131)
Traceback (most recent call last):
...
ValueError: Input must be a positive integer.
>>> palindromic_prime_check(1.9)
Traceback (most recent call last):
...
ValueError: Input must be a positive integer.
>>> palindromic_prime_check("hello")
Traceback (most recent call last):
...
ValueError: Input must be a positive integer.
"""
if not isinstance(number, int) or number <= 0:
raise ValueError("Input must be a positive integer.")
if is_prime(number):
number_str = str(number)
if number_str == number_str[::-1]:
return True
return False
if __name__ == "__main__":
import doctest
doctest.testmod()