Write an iterative function, gcdIter(a, b), that implements this idea. One easy way to do this is to begin with a test value equal to the smaller of the two input arguments, and iteratively reduce this test value by 1 until you either reach a case where the test divides both a and b without remainder, or you reach 1.

gcdIter.py

def gcdIter(a,b):
    """
    make a program thake return 
    largest integer divides of two number
    without using reminder or % syntex"""
    if b<a:
        a,b = b,a
    c = a
    while c>0:
        if (a/c==a//c) and (b/c==b//c):
            return c
        c-=1