E

The triangular numbers are of the form \( T_n = \frac{n(n+1) } { 2} \), where \(n\) is a positive integer. How many possibilities are there for the last digit of \(T_n\)?

×

Problem Loading...

Note Loading...

Set Loading...