News:

Holy shit, it's 2018 2019 2020 2021 2022 2023 2024, and the US isn't a fascist country! What a time to be alive.

Main Menu

Easy Putnam Problem #2

Started by Ender, December 04, 2007, 11:09:12 PM

Previous topic - Next topic

0 Members and 1 Guest are viewing this topic.

Ender

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 *.

Ender


Camel

I think you should post a problem that doesn't use set notation :P

<Camel> i said what what
<Blaze> in the butt
<Camel> you want to do it in my butt?
<Blaze> in my butt
<Camel> let's do it in the butt
<Blaze> Okay!