+150 Find the remainder when the sum $2^{2} + 2^{6} + 2^{10} + 2^{14} + \cdots + 2^{110}$ is divided by 10.
Grogg multiplies four consecutive integers. What is the sum of all possible values of the units digit of his result?
Thanks for the help
Find the remainder when the sum $2^{2} + 2^{6} + 2^{10} + 2^{14} + \cdots + 2^{110}$ is divided by 10.
sumfor(n, 1, 110, 2^(( 2* (2 *n - 1)))) mod 10 = 0
Grogg multiplies four consecutive integers. What is the sum of all possible values of the units digit of his result?
The result appears to be: 0 +4 =4
