Author Topic: Easy Putnam Problem #2  (Read 2669 times)

0 Members and 1 Guest are viewing this topic.

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
Easy Putnam Problem #2
« 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 *.

Offline Ender

  • Moderator
  • Hero Member
  • *****
  • Posts: 2390
    • View Profile
Re: Easy Putnam Problem #2
« Reply #1 on: December 10, 2007, 09:07:20 pm »
Should I post a hint?

Offline Camel

  • Hero Member
  • *****
  • Posts: 1703
    • View Profile
    • BNU Bot
Re: Easy Putnam Problem #2
« Reply #2 on: December 10, 2007, 09:51:47 pm »
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!