def is_odd(n):
    return n % 2 == 1

filter(is_odd, [1, 2, 4, 5, 6, 9, 10, 15])

# 结果: [1, 5, 9, 15]



#filter()删除1~100的素数
'''判断是不是素数，不是返回True，是返回False'''
def not_prime(num):
      if(num < 2):
            return True
      judge = 2
      while(judge < num):
            if num%judge == 0:
                  return True
            judge += 1
      return False
#将一个数字列表中所有的素数过滤删除掉
def prime_number(num_list):
      print filter(not_prime,num_list)
#删除1~100以内的素数
prime_number(range(100))
#[0, 1, 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 98, 99]