Updated problems to be more in line with conventions

Problem4.lua

@@ -1,11 +1,11 @@
 --ProjectEuler/lua/Problem4.lua
 --Matthew Ellison
 -- Created: 02-05-19
---Modified: 03-28-19
+--Modified: 06-19-20
 --Find the largest palindrome made from the product of two 3-digit numbers
 --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
@@ -25,14 +25,14 @@
 require "Stopwatch"
 
 
-timer = Stopwatch:create();
+local timer = Stopwatch:create();
 timer:start();
 
-palindromes = {};	--Holds all palindromes the program finds
+local palindromes = {};	--Holds all palindromes the program finds
 --Loop through every number 100-999 twice, nested, so you can multiply every number by every other number in the array
 for num1=100,999 do
 	for num2=num1,999 do
-		currentNum = num1 * num2;
+		local currentNum = num1 * num2;
 		--If the number is a palindrome add it to the list of palindromes, otherwise ignore it
 		--Using strings makes it easier to determine a palindrome
 		if(tostring(currentNum) == string.reverse(tostring(currentNum))) then