33 lines
830 B
Python
33 lines
830 B
Python
#!/usr/bin/env python3
|
|
"""
|
|
Created on 13 Oct 2021
|
|
|
|
@author: David Doblas Jiménez
|
|
@email: daviddoji@pm.me
|
|
|
|
Solution for problem 60 of Project Euler
|
|
https://projecteuler.net/problem=60
|
|
"""
|
|
|
|
from utils import timeit
|
|
|
|
|
|
@timeit("Problem 60")
|
|
def compute():
|
|
"""
|
|
The primes 3, 7, 109, and 673, are quite remarkable. By taking any two
|
|
primes and concatenating them in any order the result will always be prime.
|
|
For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of
|
|
these four primes, 792, represents the lowest sum for a set of four primes
|
|
with this property.
|
|
|
|
Find the lowest sum for a set of five primes for which any two primes
|
|
concatenate to produce another prime.
|
|
"""
|
|
|
|
# Your code goes here
|
|
|
|
|
|
if __name__ == "__main__":
|
|
|
|
print(f"Result for Problem 60: {compute()}") |