Prime Number implementation


def factors(x):
    '''returns the factors for an integer'''
    facts=[]
    for i in range(x+1):
        if i==0:
            continue
        elif x%i==0:
            facts.append(i)
    return facts

def isprime(x):
    y=factors(x)
    if len(y)==2:
        return True
    else:
        return False

Tomorrow look for in a Web book Dive into python. Fuck if you do not understand. Then you go to python.org and learn the standard library from cover to cover. Then, bison, namely, female, notch convention for writing Python code - PEP8, that bounced away from the teeth. When you write your first imidzhbordu on the way to studying layout html + css, download and study any python asynchronous web server, I recommend Tornado or Gevent. How to remake imidzhbordu to issue at least 5,000 requests per second, you can go further - you'll get a fascinating world hayloada. Apache Hadoop, ultrafast asynchronous key-value store, MapReduce. Suction Hickey vyblyadkov / just unlucky or type reyfaga sisyarp / java-cocksucker who suck dick for life will not take long and within half a year you will receive such amounts that any woman will be flowing at the mere mention of your salary.