stack frames for recursive functions calls (as done in the above method). f"greatest_common_divisor({num_1}, {num_2}) = " f"{greatest_common_divisor(num_1, num_2)}" ...

factor can be all numbers from 2 to number that we check if number % factor == 0 if it is equal to zero, we check again with number // factor ...