bonanova
-
Posts
6975 -
Joined
-
Last visited
-
Days Won
66
Content Type
Profiles
Forums
Events
Gallery
Blogs
Everything posted by bonanova
-
-
It's a much tighter connection than that.
-
The noose is tightening on the answer, but the puzzle still breathes. Yes: omit any "and's".
-
You're showing a lot of thought. None correct so far. Gambit, they talk to me, too. Don't worry, I won't tell what they say.
-
Ahhh... you can do better!
-
Nice try. Nope.
-
I see where you're going but ... nope.
-
It's Saturday night. You're a puzzle solver and have no social life, so you amuse yourself by spelling out the first 1010 integers. You know, like ... one, two, three, ... twenty-one, ... four hundred thirty-two, ... nine thousand five hundred thirteen, ... two million ninety thousand three hundred five, ... four billion three hundred seventeen million, forty-five thousand two hundred twenty-nine, ... Then you hit Sort to get them in alphabetical order. [Edit: spaces and hyphens are ignored.] What's the first odd number in your sorted list?
-
What is the connection among the following? 4/4, 6/6, 8/8, 10/10, 12/12, 5/9, 9/5, 7/11, and 11/7?
-
What symbol should come next in this sequence? N Y X M
-
OK. This is the solution to beat. Nice going. Can we save 19 prisoners with certainty?
-
If the order of boy-girl or girl-boy doesn't matter in your counting, then you're assuming that the distribution of all two-children families is: 2 boys - 33.33% 2 girls - 33.33% boy-girl - 33.33% at some point you have to realize that p[boy-girl] = 2 x p[2 girls]. Take a deep breath. Relax. Think. Got it? [edit - Martini already points this out ... never mind]
-
imran and neida save n-c+1 prisoners! Best so far. Comment on neida's answer: Anyone else ... can more than n-c+1 prisoners be saved? [n=prisoners, c=colors] Not that the OP asked this, but ... do imran and neida's solutions work if n is odd?
-
You both have it. woon has the proof
-
-
This is the solution to beat. Can anyone do better?
-
I'm sure all of mine can be beaten.
-
-
-
Everyone in the BrainDen universe has heard of the Hats on Death Row problem. Well, maybe you haven't. Take a quick look [hah!] here, then come back. Alright then ... here's the deal. The warden was ticked off that the BD geniuses here foiled his attempt to execute 20 of his worst prisoners, using black and white hats. So he's upped the ante. The same rules apply, except now there are hats of three colors: Black, White and Red. No communication after tonight's strategy meeting, which you lead. Tomorrow the prisoners are lined up facing along the line and beginning at the back of the line must call out his own color to survive. How many prisoners can you guarantee will survive? Remember there are 20 prisoners. Have fun!
-
Yup! Nice going. Doubters can construct the solids fairly easily to verify, but there's a quicker way to see it:
-
-
Ya know ... if I were sensitive, I might be offended by that juxtaposition of opinion. <_< Nice riddle. Keep them coming ... !
-
How cow! .. he said, using his best Phil Rizzuto impersonation ... I'm late to the game. Wait. I bet, and I won. Now to figure out why. Gimme a minute. Duh Puck - my gambling addiction is no red herring. WritersBlock and I attend GA faithfully, every Tuesday, if there's no action at the track.
-
