Jump to content
BrainDen.com - Brain Teasers

harey

Members
  • Posts

    212
  • Joined

  • Last visited

  • Days Won

    8

Everything posted by harey

  1. OK, so here the solution.
  2. It seems you need a hint:
  3. To decide who will do the dishes, we put in a jar tickets with prime numbers up to 111. The one who draws the ticket with a larger number wins. I look at my ticket: 3. Maybe you have a low number like 11... So I offer to exchange our tickets before showing them. What is the probability I will do the dishes?
  4. I get 13. Take one coin of each chest. a) You get two Gold, one Silver: Silver is identified, remains to distinguish all_Gold and Gold_Silver. Take 10 more coins from the first G: - if they are all gold, you identified all_Gold, the remaining is Gold_Silver - if you get a silver coin, you identified Gold_Silver, the remaining is all_Gold b) You get one Gold, two Silver: Same proceeding, permute Gold/Silver.
  5. A good question would be "How many steps on average until I win?"
  6. There is a strip of N (N>13) squares. In the middle is the SILVER DOLLAR. Two players alternatively place a penny on an empty square. Then, at each turn, a player must: - move one coin one or more squares to the left, observing: - the coin cannot move out of the strip - the coin cannot jump on another coin - the coin cannot jump over another coin - or - - pocket the leftmost coin Best strategy?
  7. @Plasmid I translated your notation into mine, as far as we are gone, we have same results (excepted some doublets). I thought about interpolation, too, but I did not go this way estimating there is not enough data.
  8. Same as rocdocmac Combinatorics:
  9. Thanks for finding the problem. I was so sure that if X contradicts Y, they must be in different categories - it did not occur to me that can be both liars.
  10. Do not worry, on my first attempt, I did not manage it to write it clearly enough that I myself could read and understand it. When you asked your question, I checked my solution written about a year ago and wondered whether it would not be easier to start from the beginning. I have rewritten it and found a kind of notation: P.S. Can someone change in the title ONE in ONCE? Thanks in advance.
  11. Bonus question: Answer your question. Why don't you post your solution?
  12. On an island, every statement is true if the islander is aged less than L and false if he is at least L years old. Find their ages. [1] A: "B is more than 20 years old." [2] B: "C is more than 18 years old." [3] C: "D is less than 22 years old." [4] D: "E is not 17 years old." [5] E: "A is more than 21 years old." [6] A: "D is more than 16 years old." [7] B: "E is less than 20 years old." [8] C: "A is 19 years old." [9] D: "B is 20 years old." [A] E: "C is less than 18 years old."
  13. There be sixty-and-four flowers-de-luce (in a grid 8x8), and the riddle is to show how I may remove six of these so that there may yet be an even number of the flowers in every row and every column. I am not able to remove 6 of them: interactive version What am I missing? Solution. that does not help me. I got it now, to late to delete.
  14. I did some research... At first, the drawing Nick made is somewhat confusing. What he calls "forward force" should be "thrust" and what he calls "thrust" should be "drag". Just google "drag thrust weight lift". If thrust=drag and lift=weight, the plane will fly at constant speed at constant height (plenty of pages). Now, the question is how much thrust we need to generate lift=weight (or a little better). On the end of the article https://en.wikipedia.org/wiki/Lift-to-drag_ratio, there is a table: latest air-crafts have a coefficient over 19.
  15. I fear there are multiple solutions. Babysnoot is correct, just the only reason to proclaim Jester truthteller is that there is no further contradiction in the system. For Bear=truthteller, Drummer=liar, others=mix (it does not matter whether what they say is true or false), there is no contradiction in the system, neither. Does someone agree?
  16. A table with English words by the set of all combinations (with repetition) of 7 letters. However, even with some tricks like sorting the letters, I do not think my computer would give me the answer overnight. Remains the Monte-Carlo method. However, I am pretty sure it is not the expected answer. A hint?
  17. Read "passenger 2-99" instead of "2-98".
  18. You forget the lift by air depression on the wings. When the space shuttle (which is basically a plane) takes off vertically, as long as the thrust is less than 10 [N/kg], it does not move. When the thrust exceeds this value, it moves up. [If you then cut the engines, it slows down, stops and falls like a stone.] That's what your equations describe. When a plane flies horizontally at a constant speed, the gravitation is compensated by depression on wings - if you cut the engines, the plane glides. You still can keep it at constant horizontal speed, it slowly loses potential energy, but does not vertically fall like a stone. This implies that on constant speed/height, you need to furnish less energy than by a vertical takeoff and therefore less thrust. Another approach: The energy of a cruising plane is constant, so the furnished energy must be equal to the energy lost. As the lost energy is partly transformed to lift on the wings...
  19. Thinking it over and over again, I always finish with a problem I cannot solve. The holes are numbered 1, 2, 3.... Three hunters check: 1 2 3 3 4 5 5 6 7 .... On day n, they will have checked up to the hole 2 * n +1 The groundhog starts in the hole k and moves to the right. On day n, he will be in the hole k+n Question 1: Will the hunters catch the groundhog (and if so, when)? 2 * n +1 grows faster than k + 1, I already have the answer. Nevertheless: 2 * n + 1 = k + n n ⁼ k + 1 No matter how high the number of the starting hole the groundhog choses, it will be caught. Question 2: Is there a starting hole so that the groundhog is not discovered on day n? k + n > 2 * n + 1 k > n + 1 No matter how long the hunters hunt, it always is possible that the groundhog started in a hole leading him outside the checked area.
  20. Never mind how big the area you chose, I always can say "Bad luck, the groundhog is somewhere about 17 holes outside the defined area." I agree that the size of the cleared area will -> inf. Just the size is expressed as a number. No matter how big it is, there always is a bigger number.
  21. I think I can do better: But not sure it is the max.
×
×
  • Create New...