Clan x86

General Forums => Academic / School => Math and Other Problems => Topic started by: Ender on December 04, 2007, 11:09:12 PM

Title: Easy Putnam Problem #2
Post by: Ender on December 04, 2007, 11:09:12 PM
Let S be a set closed under a binary operation *.

Let A and B be disjoint subsets of S such that [tex]A \cup B = S[/tex] and for any [tex]a_{1}, a_{2}, a_{3} \in A[/tex] and [tex]b_{1}, b_{2}, b_{3} \in B[/tex], we have that [tex]a_{1} * a_{2} * a_{3} \in A[/tex] and [tex]b_{1} * b_{2} * b_{3} \in B[/tex].

Prove that A and B are also closed under *.
Title: Re: Easy Putnam Problem #2
Post by: Ender on December 10, 2007, 09:07:20 PM
Should I post a hint?
Title: Re: Easy Putnam Problem #2
Post by: Camel on December 10, 2007, 09:51:47 PM
I think you should post a problem that doesn't use set notation :P