mirror of
https://bitbucket.org/Mattrixwv/projecteulerlua.git
synced 2025-12-06 17:43:57 -05:00
Initial commit with existing files
This commit is contained in:
46
Problem3.lua
Normal file
46
Problem3.lua
Normal file
@@ -0,0 +1,46 @@
|
||||
--ProjectEuler/lua/Problem3.lua
|
||||
--Matthew Ellison
|
||||
-- Created: 02-04-19
|
||||
--Modified: 03-28-19
|
||||
--The largest prime factor of 600851475143
|
||||
--All of my requires, unless otherwise listed, can be found at https://bitbucket.org/Mattrixwv/luaClasses
|
||||
--[[
|
||||
Copyright (C) 2019 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
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
]]
|
||||
|
||||
|
||||
require "Stopwatch"
|
||||
require "Algorithms"
|
||||
|
||||
|
||||
timer = Stopwatch:create();
|
||||
timer:start();
|
||||
|
||||
|
||||
TARGET_NUMBER = 600851475143;
|
||||
--Get the factors of the number
|
||||
factors = getFactors(TARGET_NUMBER);
|
||||
timer:stop();
|
||||
|
||||
--The largest number will be the answer
|
||||
--Print the results
|
||||
print("The largest prime factor of " .. TARGET_NUMBER .. " is " .. factors[#factors]);
|
||||
print("It took " .. timer:getSeconds() .. " seconds to run this algorithm");
|
||||
|
||||
--[[Results:
|
||||
The largest prime factor of 600851475143 is 6857
|
||||
It took 1.612 seconds to run this algorithm
|
||||
]]
|
||||
Reference in New Issue
Block a user