• Content count

  • Joined

  • Last visited

Community Reputation


About CaptainEd

  • Rank
    Senior Member
  1. Gold Bar on a Bus

    Somehow, the notion of "Au to bus" jumps to mind, but I don't see it supporting an answer.
  2. liar and truth-teller

    my answer:  
  3. Marry the Princess

    Good point, I didn't evaluate the 4th statement being the only true one.
  4. Marry the Princess

    funny, on my laptop i see no clues on my iphone, i see a youtube video that gives clues. but i cant enter a spoiler on my iphone the video posed a page with five lines of text and two doors on top "only one sentence is true" above left door, two sentences: "Natalia is in this cell" "The lion is in the other" above right side, two sentences: "one cell contains natalia" "one cell contains a lion"  
  5. Unseen Highness

     Brainy Binary gave me the hint, thanks!  
  6. Olympic paradox

    This certainly qualifies as a question "... especially where intuition might suggest wrong answer. " So my intuitions suggest :  
  7. A Complicated Numbers Problem

  8. Engineers vs Managers

    I'm convinced, plasmid!
  9. Engineers vs Managers

    #2: seems like plasmid's approach can solve this, too. Spoiler The only glitch I see is that in some configurations, ALL pairs might be removed. In that case, make two queues, placing the first member of each pair in queue 1, and the second member in queue 2. Then concatenate queue1 followed by queue2, and perform plasmid's method again. If they were all alternating in the original pass, they will be more homogeneous in the second pass, and they won't ALL be removed.   
  10. A loaded coin

    Oops! Thanks Bonanova, not only I was backward, but also biased! Durn!
  11. Counterfeit Coins

    First part
  12. Equilibrium Property

    Is your first if-statement necessary and sufficient?
  13. Too bad I can't think things out before I post.
  14. @Bonanova, yes, it's true, I'm working on the wrong problem still.
  15. I did a few simulations, with n = number of points (2, 3, 4). Generated  n uniform points in (0,1), sorted, calculated section lengths (including round-the-corner length from max to min), and picked max length. Averaged over 2000 tries. I expect that our varying numbers derive ultimately from using subtly different experiments. .754 (n=2), .6166 (n=3), .5466 (n=4)