Started on 060

060/main.cpp

@@ -0,0 +1,17 @@
+/*
+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.
+*/
+
+#include <iostream>
+
+
+using namespace std;
+
+int main(){
+
+    cout << "Hello this is Patrick" << endl;
+
+    return 0;
+}

CMakeLists.txt

@@ -14,4 +14,5 @@ project(
 add_executable(base base.cpp)
 
 # For each euler problem a new executable here
-add_executable(euler059 059/main.cpp)
+add_executable(euler059 059/main.cpp)
+add_executable(euler060 060/main.cpp)