Including the primes in a series of primes which will be later multiplied
p [ i ] = b [ l ] NEW_LINE mp [ p [ i - 1 ] * b [ l ] ] = 1 NEW_LINE i += 1 NEW_LINE if ( i >= I_MAX ) : NEW_LINE flag = True NEW_LINE break NEW_LINE m += 1 NEW_LINE k += 1 NEW_LINE for i in range ( n ) : NEW_LINE ar [ i ] = p [ i ] * p [ i + 1 ] NEW_LINE for i in range ( n - 1 ) : NEW_LINE print ( ar [ i ] , end = " ▁ " ) NEW_LINE g = gcd ( ar [ n - 1 ] , ar [ n - 2 ] ) NEW_LINE print ( g * 2 ) NEW_LINE