bonanova
-
Posts
6975 -
Joined
-
Last visited
-
Days Won
66
Content Type
Profiles
Forums
Events
Gallery
Blogs
Everything posted by bonanova
-
-
-
No takers for the general solution? I haven't verified this with calculations yet. Maybe someone would like to do that.
-
Well the Captain has blown away the 36 coin case, but FWIW ... here's my
-
You draw such nice diagrams, you might want to host a discussion with of this related [sphere-in-a-cone] classic: Given a wine glass [assume it's an inverted cone] with angle theta and known Height, determine the Radius of the sphere which when inserted into the full glass will displace the maximum volume of wine. Clearly for a very small radius, the sphere can sink to the bottom of the glass and displace its own small volume of wine. And for very large radius, bottom surface of the sphere will approximate a plane and not enter the glass at all, displacing a diminishingly small volume of wine. Somewhere in between, a maximum volume will be displaced. Clearly the answer will be Radius = f[theta] x Height. Determine f[theta].
-
This puzzle is of a genre posted already, in several forms. I suspect this one already been posted, but until I find the exact previous post, I'll leave it open.
-
"Brother, can you spare a dime?" I can do 36 coins straightforwardly, except ...
-
Yeah, most of you have it.
-
Nice analysis....
-
-
Your English is great. Nice puzzle.
-
/Uhre Now you're pulling my leg[o].
-
That's correct.
-
Nope. And hers' isn't it, nor theirs' nor yours' nor ours'.... nor mine'
-
Yes. See post 14. It's a leaning tower problem. Can you modify your solution to work with one block per level?
-
Can you think of a pronoun that takes an apostrophe in the possessive case? Hint: it's not its.
-
Thanks for the sketch - and the drawing program tip.
-
Five is the best claimed solution so far. Johnny imagines only a single block on the base [and every other] level. Is there a sketch?
-
What then is the minimum number of cubes that accomplishes the task?
-
Yes, cubes.
-
After studying brickmaking, Johnny wondered whether he could make a stack of building blocks that leaned in such a way that the top block, when viewed directly from above, would not overlap the bottom block at all. What's your guess? If you think it's possible, how many blocks would it take? Of course, glue is not permitted.
-
It works for the 2s but with all the 1s, not every pair spans just one digit.
-
Yeah, that's it.
-
What if the line is not there - only the two points? In theory your method works, but its accuracy suffers in practice [given the line is there] because of tangency rather then intersection. So if the line is there, I guess a mathematician would say this is a solution, but an engineer would not like it ...
-
Great puzzle. One that seems impossible until you think about it for a while. This was posted a while back here. Looks like it was solved both times. Good job.
