This poster was created from Mathematics Magazine Problem 2204. In any sequence, does there exist a way to manipulate how the terms of the sequence are added and multiplied to form a solution equivalent to 0 mod n, where n is the number of terms in the sequence? We look at whether this was possible by examining several sequences of numbers, differing in length and combination. Using techniques such as trial and error, as well as picking up on several different patterns, a method was formed to help prove that any sequence can be multiplied and added together in such a manner that the sequence could always come out to a remainder of zero. We prove that any sequence of numbers could be arranged in a certain way so that when multiplied and added together, there would always be a remainder of 0 modulo n.