求救：有没有好办法？

Let Tk = k(k + 1)/2 , k = 1, 2, 3, . . . Prove that there are infinitely many n for which Tn is divisible by the sum of its digits.

所有跟帖： 

• One simple argument -innercool- ♀ (229 bytes) () 10/21/2009 postreply 19:08:31

• 回复：One simple argument -cma- ♂ (18 bytes) () 10/21/2009 postreply 19:37:07

• like this one -乱弹- ♂ (0 bytes) () 10/21/2009 postreply 20:13:19