import math
def is_prime(n: int) -> bool:
if n < 2:
return False
if n % 2 == 0:
return n == 2
limit = int(math.sqrt(n))
for i in range(3, limit + 1, 2):
if n % i == 0:
return False
return True
def has_unique_digits(n: int) -> bool:
digits = str(n)
return len(set(digits)) == len(digits)
def main():
for num in range(1000, 10000):
if is_prime(num) and has_unique_digits(num):
print(f"First 4-digit prime with all unique digits: {num}")
return
print("No such number found.")
if __name__ == "__main__":
main()
'''
run:
First 4-digit prime with all unique digits: 1039
'''