def solve(): a = 286 while True: tri = triangle(a) if pentagonal(tri) and hexagonal(tri): return tri a += 1
def is_triangle_word(s): # inefficient value = word_value(s) tri_num = 1 n = 0 while tri_num <= value: n += 1 tri_num = triangle(n) if value == tri_num: return True return False
def solve(): n = 1 max = 500 while(True): t = triangle(n) num_divisors = len(list(div_gen(t))) if num_divisors > max: break n = n + 1 return t