<reponame>TalaatHarb/project-euler-100
import math
from Solution import Solution

class P003(Solution):
    def is_prime(self, number):
        if number % 2 == 0:
            return False
        upper_limit = math.floor(math.sqrt(number))
        if upper_limit % 2 == 0:
            upper_limit -= 1
        for i in range(upper_limit, 1, -2):
            if number % i == 0:
                return False
        return True

    def solve(self):
        self.problem_number = 3
        number = 600851475143
        upper_limit = math.floor(math.sqrt(number))
        if upper_limit % 2 == 0:
            upper_limit -= 1

        possible_factor = upper_limit
        result = number
        while possible_factor > 1:
            if (number % possible_factor == 0) and self.is_prime(possible_factor):
                result = possible_factor
                break
            possible_factor -=2
        return result

def main():
	P003().run()

if __name__ == "__main__":
	main()
import math
from Solution import Solution

class P003(Solution):
    def is_prime(self, number):
        if number % 2 == 0:
            return False
        upper_limit = math.floor(math.sqrt(number))
        if upper_limit % 2 == 0:
            upper_limit -= 1
        for i in range(upper_limit, 1, -2):
            if number % i == 0:
                return False
        return True

    def solve(self):
        self.problem_number = 3
        number = 600851475143
        upper_limit = math.floor(math.sqrt(number))
        if upper_limit % 2 == 0:
            upper_limit -= 1

        possible_factor = upper_limit
        result = number
        while possible_factor > 1:
            if (number % possible_factor == 0) and self.is_prime(possible_factor):
                result = possible_factor
                break
            possible_factor -=2
        return result

def main():
	P003().run()

if __name__ == "__main__":
	main()