Jump to content
BrainDen.com - Brain Teasers


  • Content Count

  • Joined

  • Last visited

  • Days Won


Everything posted by bonanova

  1. You're at a carnival and two people offer you money for getting six fair dice collectively to show all six numbers. Each charges you $1 per roll. Peter pays you $20 when you succeed, while Paul will pay you $50. There's another difference. Paul lets you roll all six dice each time, but Peter makes you roll just one die each time. Do you stop and play? If so, with whom?
  2. A discrete event (like rolling a fair die and wanting a 3 to appear) has a probability p of success (1/6 in this case.) The first roll is likely to fail, so let's keep rolling the die until we do get a 3, Then stop and write down the number of rolls that it took. Let's repeat the experiment a large number of times, each time recording the required number of rolls. So we have a bunch of 1s (the number of times 3 appeared on the first roll,) 2s (the number of times a 3 appeared on the second roll,) and so forth. What number will most appear most often?
  3. @Molly Mae Bravo. I should give you a solve (and a gold star) for this answer. But the Inspector has a reputation to uphold -- he needs a conviction -- and he did appeal to us for help. So, let me repair my flawed puzzle by adding this phrase about the brothers (and I'll add it to the OP as well.) None of them lied and told the truth in a single day.
  4. OK, I agree with 22. Nice work. Where my thinking was wrong - I considered left- and right-hand knight moves to be in the same class. (I put all mirror images into the same class.) That's wrong, because mirror image solids (if they lack further symmetry) can in fact be distinct. Three small cubes? Maybe look at it at some point. rodomac's images provide an advanced start point. That said, it still means finding distinct ways to remove C, E, F and (possibly) B small blocks from 22 different images.
  5. Here's my argument for 20 distinct shapes. First, I'm in awe of rocdocmac's images! The meager sketch below indicates only the visible small cubes. It does not show the small cube at the center, which I refer to below as B. The ones that do show are labeled as Corner (C) Edge (E) Face (F) We agree that C, E, F and B are the four distinct classes of small cubes, so that removing just one small cube gives rise to four distinct shapes. C / \ E E / \ C F C | \ / | | E E | | \ / | E C E | | | | F | F | | | | C E C \ | / E | E \ | / C And now we're removing two small cubes and identifying the equivalence classes. If we first remove a C, we can remove another C three distinct ways we can remove a E three distinct ways we can remove a F two distinct ways we can remove a B one distinct way If we first remove a E, having already counted the EC case, we can remove another E four distinct ways we can remove a F three distinct ways we can remove a B one distinct way If we first remove a F, having already counted the FE and FC cases, we can remove another F two distinct ways we can remove a B one distinct way There is no BB case, so we're done. And the total is 20. In summary, CC 3 CE 3 EE 4 CF 2 EF 3 FF 2 CB 1 EB 1 FB 1 BB 0 The cases that seem to disagree both involve Edge-cube cases. Namely, Corner-Edge (CE). Some say 4, I say 3. Edge-Edge (EE). Some say 5, I say 4. Here are my enumerations: CE - having removed a Corner, what classes of Edge faces remain? (I claim three.) Three small cubes E that touch C. Six small cubes E that do not touch C, but do lie on the same big-cube face. (Think of a chess knight move.) Three small cubes E that touch C'. C' is the small cube diagonally opposite C. EE - having removed a E, what classes of other Es remain? (I claim four.) Four small cubes E that touch the first E at one of its corners. Four small cubes E that touch E' at one of its corners. E' is the small cube diagonally opposite the first E. Two small cubes E each of which, along with the first E, surround and touch a common F. The (one) final small cube, E'. Again, E-E' passes through B. My class descriptions exhaust the 12 (CE) and other-11 (EE) Edge small cubes are stated in a way intended to suggest (at least) that the classes are homogeneous. I'm eager to hear other class descriptions for these cases.
  6. In my post I meant to assert the Inspector tried but failed to make the sketch following the method suggested by rocdocmac. That is, the antecedent of "He" was meant to be "the Inspector." Bert, of course, had already succeded.
  7. Two pennies can be placed on a table in such a way that every penny on the table touches (tangos with) exactly one other penny. Three pennies can be placed on a table in such a way that every penny on the table touches exactly two other pennies. What is the smallest number of pennies that can be placed on a table in such a way that every penny on the table touches exactly three other pennies? (All pennies lie flat on the table and tango with each other only at their edges.)
  8. Regarding (2), can you make a sketch for the Inspector? "Absolute truth-teller" includes "without mistakes," and he did say random. Remember also that ...
  9. The Threedie brothers, Al, Bert, Chuck, Dick and Eddie, lived in a cabin 3 miles up the old mountain trail, and it was known they didn't get along all that well. This morning, Eddie was found dead behind the cabin, and his brothers, the only suspects in the case, were being questioned by Inspector Sherlock. It was known that, of the four, at least 3 were absolute truth-tellers, and none of them ever lied and told the truth in a single day. All four, of course, denied murdering their brother. The Inspector started by asking each brother what he had done that morning: Al: I was analyzing random groups of 3 numbers, and I found that if the numbers sum to zero then their product is the average of their cubes. Bert: I was analyzing random polygons with 3 sides, and I found that if I trisected all their angles I could make an equilateral triangle. Chuck: I planted a dozen apple trees out in the orchard, and I found a way to make eighteen rows of 3 trees, each row being dead-on straight. Dick: I went out and ran 3 miles in the woods, and I've figured out that one of my 3 (living) brothers is lying. The Inspector called in these clues to one of his friends at BrainDen, and in 3 shakes of a lamb's tail the case was solved. The sound you hear is your phone ringing. It's your chance to be famous!
  10. @aiemdao You're exactly right. OP should have said they made their statements simultaneously, or that they wrote their statements on slips of paper without reading the other two statements. I'm making that change in the OP now. You get Honorable Mention recognition for your answer. Thanks, and Happy New Year!
  11. @aiemdao Hi, and welcome to the den. This might help your thinking:
  12. Nice problem. I'll get it started by observing that no matter where the point in placed,
  13. @CaptainEd Thanks. I read somewhere (probably in a Martin Gardner book) that seven was the commonly accepted result (as given by @Pickett); this eight solution is a relatively recent discovery and published only incidentally in regard to a separate problem. A third party then recognized its relevance here. Surprising, because results of this type are things we imagine were settled centuries ago. Happy to share it here.
  14. BMAD, plasmid and Rocdocmac are seated in chairs and behind screens such that each can only see the heads of the other two. And, of course, not their own. bonanova blindfolds them and places a hat on each. The hats are drawn at random from a box containing (1) Red hat, (2) Yellow hats and (3) Blue hats. i.e, { R, Y, Y, B, B, B }. Blindfolds are then removed, and each of them writes and signs a truthful statement, as follows: BMAD: My hat is one of two colors plasmid: My hat is one of three colors Rocdocmac: My hat is one of three colors Thalia, who is in the next room and can't see any of the hat-wearers, but who originally placed the six hats into the box, is given the written statements and now calls out the correct color of each person's hat. What are they?
  15. Doing the derivative correctly,
  16. Assumptions do matter. So here's some guidance, or not. I tried to word the puzzle in a way that it could be reconstructed. Theoretically at least, a normal person could spend an afternoon shelling peas, with a normal person's productivity, put her normal work product into a bag, and then those peas could theoretically be counted, and a distribution made, or compared with various candidate distributions. Basically (and mainly because I'm not Bushindo) I don't know what it would be. Then, my fictitious little sister can be assumed to have a hand that has a holding capacity of one to two orders of magnitude smaller than the capacity of the bag. But whether she grabbed as many as possible, or not, is a random outcome. (Handful may not mean full hand. Some may have been a better word choice.) I have no idea what implications devolve from that. But one could do the experiment 1000 times, in principle, and look at the distributions. Or, the matter might be known. Just not by me. Then, jhawk's observation is valid. I hadn't intended it, but it's there in the OP so it should be taken into account. If it helps, I have no problem with saying the total capacity of the bag is 10,000 peas; it was somewhere between 1/2 and 2/3 full; my sister's hand can hold no more than about 1% of the peas in the bag, and she may or may not have taken her maximum capacity of peas. Who understands sisters, anyway? Finally, if there are plural considerations that lead to different answers, I believe one of them predominates.
  17. You can multiply by adding, so you can make squares that way, too. 12 = 1 22 = 2+2 32 = 3+3+3 42 = 4+4+4+4 ... x2 = x+x+x+x+ ... +x (x times) The derivative is 2x = 1+1+1+1+ ... +1 (x times) = x 2 = 1 What's wrong here?
  18. Kudos, and the coveted bonanova gold star, to Rocdocmac.
  19. So, how can one square touch more than seven other non-touching squares? Clue
  20. That's very cool. It got me thinking. The sphere encloses the greatest volume for a given surface area. I don't know if this makes sense to ask but I'll try, anyway. For what dimension of space is the volume to surface ratio of a unit sphere the greatest? For example, in 3-D it's r/3 = 1/3.
  21. I spent the afternoon in the garden, picking and shelling peas, collecting them in a large bag. When I got home my little sister reached into the bag and pulled out a handful of peas. What is the probability that she pulled out an odd number of peas? less than 1/2 1/2 greater than 1/2
  22. This puzzle is inspired by the seventh of Rocdocmac's Difficult Sequences: In n dimensions, where a point is an n-tuple of coordinate values { x1, x2, x3, ... , ,xn }, the unit sphere is the locus of points for which x12+ x22 + x32 + ... + xn2 = 1. In one dimension this is a pair of points that encloses a volume (length) of 2 and comprises a surface area of 0. In two dimensions it's a circle that encloses a volume (area) of pi and comprises a surface area (circumference) of 2 pi. So the enclosed volume and surface area both start out, at least, as increasing functions of n. What happens as n continues to increase? Puzzle: Is there a value of n for which the volume reaches a maximum? Bonus question: What about the surface area?
  • Create New...