SleepingGiant

Members
  • Content count

    12
  • Joined

  • Last visited

    Never

Community Reputation

0

About SleepingGiant

  • Rank
    Newbie

SleepingGiant's Activity

  1. SleepingGiant added a post in a topic   

  2. SleepingGiant added a post in a topic   

    Maybe I don't understand...

    Are A,B,C,D supposed to be our choices? Or are we to assume they and the 25%,50%60% are an imaginary test question where one of those 3 values is a correct answer, and we determine the prob that a random guess will be right?


    • 0
  3. SleepingGiant added a post in a topic   

  4. SleepingGiant added a post in a topic How many pairs   

    I'm sure he thanks you for doing his math homework for him
    • 0
  5. SleepingGiant added a post in a topic   

    Sorry Amiab I didn't read your whole post, great job!
    • 0
  6. SleepingGiant added a post in a topic   

    I think the puzzle was misunderstood.

    Only leader A can communicate. Leader B does not return a True or False message. Therefore there is no way Leader A can know the ratio.

    I didn't read through and analyze each solution yet I will in a minute, however, this is actually really simple.

    Look at it this way, alter the scenario a little.

    Say there are 2 Leader As A1 and A2. A1 sees the scene first and sends his T/F then is taken away. A2 then comes in after the prisoner is taken, he doesn't know which color was taken away.

    Each of the 2 T/F can correspond with one simple question

    Thanks for the replies and god job!
    • 0
  7. SleepingGiant added a topic in New Logic/Math Puzzles   

    That dirty king is at it again, and he has another twisted plan in store for you

    you are one of 12 men sentenced to be executed, unless you can determine a solution to his game.

    You will be separated into two groups, with one person from each group being chosen as a leader. The other 5 from each team will be blindfolded and given either a red or black hat. One team will be dictated the "informant team" and they will each get a number 1-5

    The leaders cannot see the prisoners from the other group, only his. You are told the ratio of hats will be even
    i.e. red:black 0:10, 2:8, 4:6, 6:4, 8:2, or 10:0

    The rules are as follows. One leader is the informer (We'll say Leader A), the other determines the ratio of hats(Leader B). The informer is allowed to communicate as follows.

    When the game starts, the informer, Leader A, gives a "True" or "False" to a guard, that will in turn deliver it to Leader B
    After hearing the initial "True" or "False," Leader B chooses a number 1-5. The prisoner from Leader A with that number is brought over to Leader B's group.

    After this, Leader A gives a second "True" or "False" to be communicated. After this, Leader B must determine the ratio of hats. How can you make a plan so these two T/F communications can get you the ratio?

    Same rules as always, no cheating!

    Sorry if it seems confusing, or if it's easier than I initially thought it was
    • 9 replies
    • 455 views
  8. SleepingGiant added a post in a topic   

    I would appreciate any input towards determining some sort of formula, here's what I've deduced.


    • 0
  9. SleepingGiant added a post in a topic   

  10. SleepingGiant added a topic in New Logic/Math Puzzles   

    Forgive me if this is already posted, I found a few counterfeit coin weighing post, but I believe this is a new twist on it.

    Given the conditions

    You can make a maximum of 3 comparisons
    There is exactly 1 coin out of 'X' coins that is a different weight
    That coin can be either heavier or lighter

    What is the maximum number of coins you can absolutely predict the odd one out from?

    Can you propose a formula that may support this? I.E. to determine with 'n' comparisons a maximum of 'x' coins can be used?


    • 9 replies
    • 429 views
  11. SleepingGiant added a post in a topic   

  12. SleepingGiant added a post in a topic   

    I like recursion


    • 0