如何看待 Google 2004 年在硅谷公路旁一巨型广告牌上贴出的那道数学题用于招聘？ 第1页

       def isPrime(n: int) -> bool:   if n <= 1:     return False   i = 2   # Make use of symmetry. For example, 2*3=6, 3*2=6   while i * i < n:     if n % i == 0:       return False     i += 1   return True     

       def isPrime(n: int) -> bool:   if n <= 1:     return False   if n <= 3:     return True   # For case of 2(3x + 1), 3(2x + 1), 2(3x + 2)   if n % 2 == 0 or n % 3 == 0:     return False   # For case of the multiplication of prime numbers   i = 5   while i * i < n:     if n % i == 0 or n % (i + 2) == 0:       return False     i += 6   return True     

       import requests import re  response = requests.get('https://oeis.org/A001113/b001113.txt')  # Save sequence to a file for later use out_file = open('digits_of_e.txt', 'w') print(response.text, file=out_file)  queue = []  container = '' counter = 0   in_file = open('digits_of_e.txt', 'r') list_in_file = list(in_file) for index, line in enumerate(list_in_file):   segments = list_in_file[index:index+10]   # get lines at a batch of 10 lines   for segment in segments:     matchObj = re.match(r'([d]*) (d).*', segment, re.I)     counter += 1     if counter <= 10:       container += matchObj.group(2) if matchObj != None else ''     else:       counter = 1       if len(container) == 10:         queue.append(container)       container = matchObj.group(2) if matchObj != None else '' in_file.close()  print(len(queue)) # 49991 indeed  def isPrime(n: int) -> bool:   # Prime number definition version:   '''   if n <= 1:     return False   i = 2   # Make use of symmetry. For example, 2*3=6, 3*2=6   while i * i < n:     if n % i == 0:       return False     i += 1   return True   '''   # Distribution pattern of prime number version:   if n <= 1:     return False   if n <= 3:     return True   # For case of 2(3x + 1), 3(2x + 1), 2(3x + 2)   if n % 2 == 0 or n % 3 == 0:     return False   # For case of the multiplication of prime numbers   i = 5   while i * i < n:     if n % i == 0 or n % (i + 2) == 0:       return False     i += 6   return True  result = None for num in queue:   if isPrime(int(num)):     print(num)     result = num     break  print(result == '7427466391') print(isPrime(7427466391))