题目见:https://projecteuler.net/problem=12
The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
Let us list the factors of the first seven triangle numbers:
1: 1
3: 1,3
6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28We can see that 28 is the first triangle number to have over five divisors.
What is the value of the first triangle number to have over five hundred divisors?
这个题目涉及到两个知识点:一个是等差数列的求和公式,另外一个是一个数的约数个数公式,MATLAB和Python的实现分别用了两种不同的思路
MATLAB代码
clear;clc;close all
sum(1:find(arrayfun(@(i)prod(accumarray(factor(sum(1:i))',1)+1),...
1:1.5e4)>500,1))
Python代码
import sys
import math
t = 1
while True:
s = t*(t+1)//2
if sum([1 for i in range(1,math.floor(math.sqrt(s))) if s%i==0]) > 250:
break
t += 1
print(s)