On Mon, Nov 8, 2010 at 9:08 PM, Greg <g...@kinostudios.com> wrote: > Ah, I see that this wasn't immediately clear from my explanation: they change > by 1, but 3 wraps to 1. I.e. the chain is: > > 3 => 1 => 2 => 3 => 1 => etc...
I assume only the first two and last two can be changed together. If the first and last also can, then: 3 3 3 1 3 1 (first and third) 1 1 2 (second and third) 2 1 3 (first and third) 2 2 1 (second and third). But if only the first two and last two can be changed together, then anytime one of the end ones rotates by one, the middle one does as well. Note that the initial condition 3 3 3 satisfies (a + c) = b (mod 3) where the numbers are a b c. And if you raise the middle one and one of the other two mod 3, then you raise b mod 3 by 1 and (a + c) mod 3 by 1. So (a + c) = b (mod 3) is an invariant of the system. And 2 2 1 violates it since (a + c) = 3 != 2 (mod 3). -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
