#Skip to menu

Highly divisible triangular number

First read the problem description.

Simple bruteforce.

import itertools, sympy

Tn = 0

for n in itertools.count(1):
    Tn += n
    if sympy.divisor_count(Tn) > 500:
        print(Tn)
        break
76576500

See what people say about this article.


Source code of the solution(s):