How to optimize the algorithm to perform the 5 task from the Euler project?

Question

Python

Good afternoon!
Wrote an algorithm to implement this task .

def euler5(limit):
  hasNumberFound = False
  iterator = 1

  while not hasNumberFound:
    num = limit * iterator

    for divider in range(2, limit):
      if num % divider != 0:
        break
    else: 
      hasNumberFound = True
      return num
    iterator += 1

print( euler5(20) )

The confusing thing is that it takes 13.5 seconds to complete the task with the value of the function argument equal to 20. The output is: 232792560.
Is it possible to optimize the algorithm?

Answer 1

The problem can be solved without brute force.
To begin with, take all the numbers from 2 to 20 and decompose into prime factors.
3 = 3¹
4 = 2²
5 = 5¹
6 = 2¹·3¹
7 = 7¹
8 = 2³
9 = 3²
10 = 2¹·5¹
11 = 11¹
12 = 2²·3¹
13 = 13¹
14 = 2¹·7¹
15 = 3¹·5¹
16 = 2⁴
17 = 17¹
18 = 2¹·3²
19 = 19¹
20 = 2²·5¹

Answer 2

So why are you iterating over an iterator over 1?
Find all prime numbers <= limit and multiply. Increment the iterator by this product.