Updated problems to be more in line with conventions

Problem23.lua

@@ -1,11 +1,11 @@
 --ProjectEuler/lua/Problem23.lua
 --Matthew Ellison
 -- Created: 03-22-19
---Modified: 03-28-19
+--Modified: 06-19-20
 --Find the sum of all the positive integers which cannot be written as the sum of two abundant 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
@@ -29,7 +29,7 @@ require "Algorithms"
 MAX_NUM = 28123;	--The highest number that will be evaluated
 
 
-function isSum(abund, num)
+local function isSum(abund, num)
 	local sumOfNums = 0;
 	--Pick a number for the first part of the sum
 	for firstNum = 1, #abund do