Puzzles

40% of people still have both eyes, 25% both ears, 20% both arms and 15% both legs. If none of these overlap, they add to 100%. Therefore at least 0% of people have lost all four.

Erasing 2 and 3; then the result and 4; then the result and 5 and so on will lead to having \(1\) and \(2-\sum_{i=3}^{20}i\) on the board.

Erasing these will give \(1-2+\sum_{i=3}^{20}i=206\).

The numbers 1 to 20 are written on a blackboard. Each turn, you may erase two adjacent numbers, \(a\) and \(b\) (\(a\) is to the left of \(b\)) and write the quotient \(a/b\) in their place. You continue until only one number remains.

What is the largest number you can make?

If \(x^2-7x+11=1\) or \(x^2-11x+30=0\), then this is one. The solutions to these are \(x=2,5,\) and \(6\).

It could also be one if \(x^2-7x+11=-1\) and \(x^2-11x+30\) is even. This happens when \(x=3\) or \(4\).

Therefore all the solutions to this are \(x=2,3,4,5\) or \(6\).

At \(x=a\), \(y=a^4-4a^2\) and \(\frac{dy}{dx}=4a^3-12a^2\). Therefore the equation of the tangent at \(x=a\) will be \(y=(4a^3-12a^2)x+8a^3-3a^4\).

Taking this away from \(y=x^4-4x^3\) gives \(y=x^4-4x^3-(4a^3-12a^2)x-8a^3+3a^4\). We can now look at where this curve is tangent to \(y=0\) and look for a value of \(a\) that makes it tangent at two points.

If this curve is tangent to the \(x\)-axis at \(x=b\), then it will have a repeated root at \(x=b\). We know it is tangent at \(x=a\), so dividing \(x^4-4x^3-(4a^3-12a^2)x-8a^3+3a^4\) by \((x-a)\) twice gives \(x^2+(2a-4)x+3a^2-8a\). We want this to have a repeated root, hence the discriminant, \((2a-4)^2-4(3a^2-8a)\), must be 0.

Solving this gives \(a=1\pm\sqrt3\).

Therefore the equation of the line is \(y=-8x-4\).

After each turn, the total of the numbers written on the board remains the same. Therefore the sum of the numbers is always the same: 210

The numbers 1 to 20 are written on a blackboard. Each turn, you may erase two numbers, \(a\) and \(b\) and write the product \(a\times b\) in their place. You continue until only one number remains.

What is the largest number you can make?

The order in which A and B spoke is important.

Each of the logicians can see two numbers and knows that her number is either the sum of or the difference between these numbers.

The only way in which A could've known her number was if B and C had the same number (as the difference would be 0, not positive). So after A speaks, B knows that B\(\not=\)C.

There are two ways in which B could know her number: (1) if A=C, or (2) if the information revealed by A removed one of the options.

(1) is not possible, as this would mean that B is the sum of A and C and therefore even (but 15 is odd.

Therefore (2) must have happened. Learning B\(\not=\)C removed one of B's options, so B=C must have been one of B's options. This is only possible if A=2C, giving B's options as being equal to C or 3C.

As B cannot be C, B must therefore be 3C, so the numbers are: A=10, B=15, C=5.

1. 7

2. 11

3. 90

First, if \(n\) and \(m\) share a common factor other than 1, there will be no largest number: any number that is not a multiple of the common factor will be impossible to make.

If \(n\) and \(m\) are coprime, then considered the remainders when the multiples of \(n\) are divided by \(m\). For example, if \(n=3\) and \(m=7\):

Once a number with a given remainder is reached, then all other numbers with that remainder can be reached by repeatedly adding \(m\). Once \(mn\) is reached, the remainders column will repeat itself. Before \(mn\), all remainders will appear (this can be shown by showing that there are \(m\) rows which much all have different remainders). Hence above \(mn\) all numbers can be made.

In the 3,7 example, the last remainder to be hit is 4. The highest number that cannot be made will be the highest number with remainder 4 that is less than 18 (when remainder 4 is hit).

In general, the last remainder will be hit at \(mn-n\). The number before this with the same remainder will be \(mn-n-m\). This will be the highest number that cannot be made.

Given \(n\), \(m\) and \(k\), what is the largest number that cannot be written in the form \(na+mb+kc\), where \(a\), \(b\) and \(c\) are positive integers?

How I worked this out is written up in this blog post.