BGonline.org Forums

A sticky problem

Posted By: Joe Russell
Date: Friday, 21 August 2009, at 9:42 a.m.

MCG is sitting at a table blindfolded. On the table are a very large number of tokens. Each token has two sides. One side of each token has the words; 'stick rice is delicious'. The other side of each states; 'stick rice sucks'. MCG is told that if he could peak he would see that exactly 87 of the tokens have the 'sucks' side face up. He is told to make, while remaining blindfolded, two subgroups each containing the same number of 'sucks' sides face up? How does he do it?

Messages In This Thread

• A sticky problem
  Joe Russell -- Friday, 21 August 2009, at 9:42 a.m.
  • A sticky problem
    Matt Cohn-Geier -- Friday, 21 August 2009, at 10:12 a.m.
  • A sticky problem
    Fabrice Liardet -- Friday, 21 August 2009, at 11:01 a.m.
  • A sticky problem
    bob koca -- Friday, 21 August 2009, at 12:52 p.m.
    • A sticky problem
      Jason Lee -- Friday, 21 August 2009, at 1:34 p.m.
      • A sticky problem
        bob koca -- Friday, 21 August 2009, at 1:44 p.m.
        • A sticky problem
          Gregg Cattanach -- Friday, 21 August 2009, at 2:03 p.m.
        • A sticky problem
          Jason Lee -- Friday, 21 August 2009, at 2:45 p.m.
  • A sticky problem
    Stein Kulseth -- Friday, 21 August 2009, at 2:54 p.m.
  • A sticky problem
    Gregg Cattanach -- Friday, 21 August 2009, at 4:07 p.m.
    • A sticky problem
      Gregg Cattanach -- Friday, 21 August 2009, at 4:08 p.m.
      • A sticky problem
        Stein Kulseth -- Friday, 21 August 2009, at 4:47 p.m.
      • A sticky problem
        Fabrice Liardet -- Friday, 21 August 2009, at 5:17 p.m.
      • A sticky problem
        Steve Mellen -- Friday, 21 August 2009, at 5:53 p.m.