Updated problems to be more in line with conventions

Problem8.lua

@@ -1,7 +1,7 @@
 --ProjectEuler/lua/Problem8.lua
 --Matthew Ellison
 -- Created: 02-06-19
---Modified: 03-28-19
+--Modified: 06-19-20
 --Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
 --[[
 73167176531330624919225119674426574742355349194934
@@ -27,7 +27,7 @@
 ]]
 --All of my requires, unless otherwise listed, can be found at https://bitbucket.org/Mattrixwv/luaClasses
 --[[
-	Copyright (C) 2019  Matthew Ellison
+	Copyright (C) 2020  Matthew Ellison
 
 	This program is free software: you can redistribute it and/or modify
 	it under the terms of the GNU Lesser General Public License as published by
@@ -47,7 +47,7 @@
 require "Stopwatch"
 
 
-timer = Stopwatch:create();
+local timer = Stopwatch:create();
 timer:start();
 
 --Put the number into a variable. A string will do for now