You have a large jar filled with colored marbles. It contains marbles, marbles, marbles, marbles, marbles, and marbles.
You draw four marbles out of the jar, then put three marbles in (decreasing the total number of marbles in the jar by one) using the following rule:
If the four marbles are marble, marbles and marble, put marbles and marble into the jar.
If the four marbles are marbles and marbles, put marble, marble and marble into the jar.
If the four marbles are marbles and marble, put marble, marble and marble into the jar.
If the four marbles are marbles and marbles, put marble, marble and marble into the jar.
If the four marbles are marbles and marble, put marble and marbles into the jar.
If the four marbles are marbles, put marbles and marble into the jar.
In all other scenarios, return all four marbles into the jar.
Repeat this process until one marble remains. What color is it?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let ω = 2 1 + i 3 .
We denote a blue marble by number 1 , a red marble by number − 1 , a orange marble by number ω , a yellow marble by number − ω , a purple marble by number ω 2 , and a green marble by number − ω 2 .
Let T k is product of all numbers denoted in the jar when k marble(s) have been removed.
Note that T 0 = ω 2 and T k + 1 = T k for all integer k .
This implies that T 1 2 0 8 3 = T 0 = ω 2 .
So, the color of remained marble is Purple .