Ask your own question, for FREE!
Mathematics 19 Online
OpenStudy (anonymous):

Prove that \[T _{n} \] is congruent to 2 or 4 (mod 5) has no solutions for positive integer values of n, where \[T _{n} \] = n(n+1)/2 is the nth triangular number.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!