Skip to main content
The National Cipher Challenge

Reply To: Programming

A Tale of 2 Secrets Forums T.E.M.P.E.S.T. Programming Reply To: Programming

#112157
Robb27
Participant

@ByteInBits #112155

I don’t profess to be the best python programmer, but this worked for me: 3797 as well as 3137 per your original post.

Number 3137 is prime and meets the conditions:
Suffix 7 is prime
Suffix 37 is prime
Suffix 137 is prime
Prefix 3 is prime
Prefix 31 is prime
Prefix 313 is prime

Number 3797 is prime and meets the conditions:
Suffix 7 is prime
Suffix 97 is prime
Suffix 797 is prime
Prefix 3 is prime
Prefix 37 is prime
Prefix 379 is prime

`from sympy import *

def check_prime():
for p in range(1000, 10000):
if not isprime(p):
continue

s = str(p)
prefixes = [int(s[:i]) for i in range(1, 4)]
suffixes = [int(s[-i:]) for i in range(1, 4)]

# Check if all prefixes and suffixes are prime
if all(isprime(x) for x in prefixes + suffixes):
print(f”\nNumber {p} is prime and meets the conditions:”)
for x in suffixes:
print(f” Suffix {x} is prime”)
for x in prefixes:
print(f” Prefix {x} is prime”)

check_prime()

Report a problem