# Tag Info

17

Using 2,3,7,11: $2 = 2$ $3 = 3$ $5 = 11 + 3 - 7 -2$ $7 = 7$ $11 = 11$ $13 = 2 + 11$ $17 = 3! + 11$ $19 = 2^3 + 11$ $23 = 3 \cdot 7 + 2$ $29 = \frac{(7-2)!}{3} - 11$ $31 = 3 \cdot 11- 2$ $37 = (11-3!) \cdot 7 + 2$ $41 = 7^2 +3 - 11$ $43 = 2 \cdot 11 + 3 \cdot 7$ $47 = 3 \cdot 11 + 2 \... 15 This was trickier than it looked. I have a feeling that there should be a quicker way to find the answer than the list of cases I worked through. Note: I interpret "two of which are factors of the third" to mean that two of the numbers divide the third, and that either of those two factors might be 1. 10 If "factor" cannot be 1, then 2,4,8 and 2,3,6 remain as two options, but they cannot be a solution, because all of the people should be able to know their number at the first sight. Conclusion: "factor" can be 1. Mr.Hehe sees 2 and 3 so he knows he has 6 before all. The others see 2,6 and 3,6 so they don't know their number because they both think they ... 8 The maximum is Reasoning 8 83 is probably not allowed - I swear I'll find a legitimate solution soon... arrgh... Using 2,3,5,7:$2, 3, 5, 7 = 2, 3, 5, 711 = 7 + 5 + 2 - 313 = 7 + 5 + 3 - 217 = 7 \cdot 2 + 319 = 7 \cdot 2 + 523 = 7 \cdot 3 + 229 = 7 \cdot 5 - 3!31 = 7 \cdot 5 - 3! + 237 = 7 \cdot 5 + 241 = 7 \...

7

Assuming that the walls replace a cell of a grid like in the 9x9 version and are not located between two cells. How I got there:

6

It is not possible to do this in 12 steps. In fact, a simple argument shows that at least 20 steps are necessary: Tiles 1 and 8 need to be swapped. They are however a distance of 3 moves apart, so each tile needs to be moved at least 3 times. Similarly, tiles 2 and 7 also each need 3 moves to reach their goal locations. So these 4 tiles together need at ...

6

This grid requires 18 steps: Explanation

5

18:

5

Since we are talking about multiplication (products grow really fast), and our data gathering is relatively cheap, it stands to reason that the best strategy is to I had this idea yesterday, but it took me this long to get through the final annoying special case. However, I'm pretty convinced now that This is going to be a longish read because of the ...

4

I believe Note that

3

Intuitively, it seems like

3

Solution: Finding the Solution: This gets us: We now have: This gives us: Now, we have: Here we have: In conclusion:

3

What combinations of numbers are possible? From this list of possibilities, we need to find one where one person can know what their number is by seeing two of the other numbers. Here are the possible numbers a person could see others having (lowest number first), and the possible numbers that the person could be. Now we have 3 possibilities for two ...

2

2

Below I explain all the deductions I have been seeing until I reach the solution: Possibilities: Doubts and deductions: Description: Solution and vision of each:

2

Using 3, 5, 7, 11 2 = 5 - 3 3 = 3 5 = 5 7 = 7 11 = 11 13 = 7 + 3! 17 = 11 + 3! 19 = 3 × 5 + 11 - 7 23 = 11 + 7 + 5 29 = 5!/3 - 11 31 = 11 × 3 + 5 - 7 37 = 7 × 3! - 5 41 = 5 × 3! + 11 43 = 7 × 5 + 11 - 3 47 = 5!/3 + 7 53 = 7!/5! + 11 59 = 11 × 5 + 7 - 3 61 = 11 × 5 + 3! 67 = (3+5) × 7 + 11 71 = 7 × 11 - 3! 73 = 11 × 3! + 7 79 = 11 × 7 + 5 - 3 83 = 11 × 7 ...

2

I took a slightly different approach to Jaap Scherphuis: The two smaller numbers are factors of the largest number, and all 3 numbers are different. This means that the largest number cannot be prime - ruling out 1,2,3,5,7, and leaving us with 4, 6, 8, and 9. There are 32 possible pairs of factors of the numbers 4, 6, 8, and 9, but only 8 of these ...

1

I thought about something here : There is another answer I thought of first, and I wanted to share. And last but not least, the ultimate move :

1

Since Hehe knows his own number by watching the others, one can test the different factors that could lead to it (watched hats, with ascending sort -> possible hats Hehe could have): So we only keep some of these entries: And just consider: Hehe knows his number even before the other ones talk. This means: a-priori he knows, with no ambiguity, the number ...

1

Looks like we have mazes we need to solve simultaneously: and These are the difficult cases, so all the other configurations (that are solvable in the first place) should be automatically solved if we can get all of these. So we need a move sequence that has Here's one: Which has Is it optimal? No idea. I'm going to need some more coffee if I'm to ...

1

This was probably not the most exciting question. Anyway there are many solutions. Here are some examples: Interestingly one cannot add a single other bishop of any color.

Only top voted, non community-wiki answers of a minimum length are eligible