Data update

Task/Euclid-Mullin-sequence/Lua/euclid-mullin-sequence-1.lua

@@ -5,10 +5,8 @@ do
     io.write( "2" )
     local product = 2
     for i = 2, 8 do
-        local nextV = product + 1
+        local nextV, p, found = product + 1, 3, false
         -- find the first prime factor of nextV
-        local p = 3
-        local found = false
         while  p * p <= nextV and not found do
             found = nextV % p == 0
             if not found then p = p + 2 end