Jump to content
BrainDen.com - Brain Teasers

Prime

Members
  • Posts

    871
  • Joined

  • Last visited

  • Days Won

    7

Everything posted by Prime

  1. Completely off the topic, a technical issue. I cannot see the contents of the spoiler in the post. It appears as empty line. When I "quote" the post, the spoiler becomes visible inside the "quote".
  2. If that was the case, why would bonanova need another clue?
  3. English, not proper, not acronyms It would count twice. We are looking for how many of the sixteen possible three-letter strings are words. There are solutions greater than 13. If the same word may occur more than once, it's a different matter. Then 16 may be possible. Jddouglas already posted 15 (post #3.)
  4. Found a roundabout way to display formatted text inside a BD post. Same thing as above, but visible.
  5. This looks harder than the puzzle I posted.
  6. Actually, it's more complicated. Like Phil1882 noted.
  7. The solution would be straightforward, but...
  8. That's the number I was looking for!
  9. Find the smallest number consisting of only "1"-s, which would be divisible by "333...3" (one hundred "3"-s.) (Decimal system.)
  10. Prime

    1966

    Nice. When at math competition, solve it like this and you have extra time to tackle other problems.
  11. Prime

    1966

    All numbers from 1 to 1966 are written on a blackboard. You are allowed to erase any two numbers and write their difference instead. Prove that repetition of that operation may not result in having only zeroes on the blackboard. (Problem from Russian Math Olympiads. 6-th grade, 1966.)
  12. Yes, that's the solution. I knew, this problem would not last long here.
  13. Prove that you cannot cover a 10 x 10 chessboard with 25 figures (Problem from Russian Math Olympiads. 6-th grade, 1964.)
  14. The elimination table has to be reworked.
  15. Negative. Removing "indescribable" would leave an indescribable hole in the language. That would be double plus ungood.
  16. Thanks, Prime. That's an interesting perspective...So, I've been mulling this over in my head trying to convince myself that everything is correct, so here is a slightly different perspective... I see there is some ambiguity in my example - not deterministic enough. Let me try again:
  17. Not really. Your next move is A6 and she loses. True. My mistake. Perhaps, the following could be thought of as a trap, though it's a stretch For any even n, you must win.
×
×
  • Create New...