1 ! Copyright (C) 2018 John Benediktsson.
2 ! See https://factorcode.org/license.txt for BSD license
3 USING: backtrack backtrack.private combinators.short-circuit
4 kernel math math.functions math.primes
5 project-euler.common sequences ;
8 ! https://projecteuler.net/problem=60
13 ! The primes 3, 7, 109, and 673, are quite remarkable. By taking
14 ! any two primes and concatenating them in any order the result
15 ! will always be prime. For example, taking 7 and 109, both 7109
16 ! and 1097 are prime. The sum of these four primes, 792,
17 ! represents the lowest sum for a set of four primes with this
20 ! Find the lowest sum for a set of five primes for which any two
21 ! primes concatenate to produce another prime.
27 : join-numbers ( m n -- x )
28 over log10 ceiling >integer 10^ * + ;
30 : prime-pair? ( m n -- ? )
32 [ join-numbers prime? ]
33 [ swap join-numbers prime? ]
36 :: (euler060) ( -- primes )
39 10000 primes-upto :> primes1
41 primes1 amb-integer :> i
43 primes1 i 1 + tail-slice [
44 { [ 4 * a + result < ] [ a prime-pair? ] } 1&&
47 primes2 amb-integer :> j
49 primes2 j 1 + tail-slice [
50 { [ 3 * a b + + result < ] [ b prime-pair? ] } 1&&
53 primes3 amb-integer :> k
55 primes3 k 1 + tail-slice [
56 { [ 2 * a b c + + + result < ] [ c prime-pair? ] } 1&&
59 primes4 amb-integer :> l
61 primes4 l 1 + tail-slice [
62 { [ a b c d + + + + result < ] [ d prime-pair? ] } 1&&
67 { a b c d e } dup sum result!
70 : euler060 ( -- answer )