Functions¶

Module Contents¶

project_euler.problem_005.sol1.solution(n: int = 20) → int¶

Returns the smallest positive number that is evenly divisible (divisible with no remainder) by all of the numbers from 1 to n.

>>> solution(10)
2520
>>> solution(15)
360360
>>> solution(22)
232792560
>>> solution(3.4)
6
>>> solution(0)
Traceback (most recent call last):
    ...
ValueError: Parameter n must be greater than or equal to one.
>>> solution(-17)
Traceback (most recent call last):
    ...
ValueError: Parameter n must be greater than or equal to one.
>>> solution([])
Traceback (most recent call last):
    ...
TypeError: Parameter n must be int or castable to int.
>>> solution("asd")
Traceback (most recent call last):
    ...
TypeError: Parameter n must be int or castable to int.