Python program to find triangular number with n number of divisors
def tri_num_div(n):
div=0
tri=1
realn=1
while div<n:
realn+=1
tri+=realn
for i in range(1,int((tri**0.5))+1):
if tri%i==0:
div+=2
if div<n:
div=0
...
mycodingjourneyy.hashnode.dev1 min read