James Tanton asks in a series of tweets (which I’ve modified slightly): Write 20 numbers. Erase any two, and , and replace with , where some possible choices of are:

Repeat 19 times, until you get a single number. The final result will be independent of the choices of pairs made. Why?

For example, consider . And say we start with the numbers 2, 3, 6, 7. Then we could choose to do the replacement as follows. In each case the two bolded numbers are replaced by one.

**2**, 3, **6**, 7 becomes 3, 7, **20**
**3**, 7, **20** becomes 7, **83**
**7**, **83** becomes 671

and so we’re left with 671. Or we could have

- 2,
**3**, **6**, 7 becomes 2, 7, **27**
**2**, **7**, 27 becomes **23**, 27
**23**, **27** becomes **671**

and again we’re left with 671. What’s going on here? It’s not immediately apparent, but if you try this starting with lots of small integers, you often get results which are one less than some number with many small factors — in this case, 672. And in fact , which we can rewrite as

We can think of the whole process, starting with , as computing the product by combining two factors at a time; of course the order doesn’t matter.

Similarly with the function , if we start with we end up with . With , we get . The result with is a little harder to see but if we start with we eventually get . This is a bit easier to see if we realize that ; therefore applying conserves the sum of the reciprocals.

What others are there? Of course there are trivial examples like and ; iterating these functions will just give the sum or the product of the original numbers. But what other nontrivial examples are there? Can you say what all of them are?

### Like this:

Like Loading...

*Related*

I don’t know if these are

allthe possibilities, but all your examples are conjugate to multiplication or addition. And of course multiplication is conjugate to addition too!So the question (conjecture?) is: given an associative, binary function , is it conjugate to addition? That is, is there an invertible such that ?

This is false for silly reasons; for example, it suffices to exhibit a noncommutative group with the same cardinality as and a bijection between them (the group of bijections works). This also doesn’t capture all of the examples; isn’t defined on all of but only on, say, the positive reals.

Whoops, that’s not quite right either. You want commutative associative binary functions. They’re clearly not all conjugate because some of them don’t have identities or inverses, but I suppose all of the given examples are conjugate to nice subsemigroups of the reals under addition.

Isn’t it sufficient just to have some which is commutative and associative?

The last three have the form $g^{-1}(g(a)~g(b))$, where $g$ is an invertable function and $~$ is a commutative, associative operator. The ultimate value will be $g^{-1}(g(a)~…~g(n))$. I believe any invertable $g$ and commutative, associative operator $~$ would work as well.

In the first case, the same formulation works with $g(n) = n+1$ and $~$ being multiplication.

The “trivial” examples have $g(n)=n$.

To expand on my previous comment a bit: it is clearly necessary for to be associative (since otherwise we could find such that we get a different answer depending on the order in which we choose to apply ) and commutative (since otherwise we would get different results for some vs ). That it is sufficient follows by noting that we are essentially building a binary tree with elements of the original list at the leaves and applications of at the internal nodes; if we consider two trees equivalent whenever they are related by a rotation (associativity) or reflection (commutativity) the equivalence classes are bags (i.e. sets with multiplicity), that is, any two trees with the same leaf elements are equivalent.

Well, whenever you have a bijective function g, you can construct such an f by defining [tex]f(a,b) = g^{-1}(g(a) + g(b))[/tex] or [tex]f(a,b) = g^{-1}(g(a)\cdot g(b))[/tex]. The choices [tex]g(x)=x+1[/tex], [tex]g(x)=x^2[/tex], [tex]g(x)=x^{-1}[/tex] and [tex]g(x)=\exp(x)[/tex] then give us the examples. (Of course, [tex]x^2[/tex] and [tex]\exp[/tex] are not bijective, but you actually only need that g has preimage on the sum or product of images.)

I think you also need the binary operation to be commutative.

However, I am not sure the conjoncture of John Armstrong holds : take as an example the “exclusive or (^)”, as a binary operation over the set of all (positive) integers : it fulfills the commutativity and associativity, so achieves the result, but it is not conjugate to addition (or else, since f(a, a) = 0, we should have for all a, 2g(a) = 0.

Perhaps the following was mentioned in your post implicitly but I would like to point out the role of “invariants” played in all of the problems you mentioned. For example, in the first problem, with a little bit of algebra, we see that we are essentially, looking at the “transformation” . Then, it is not hard to see that the “invariant” under the given operation is , with the result that the final answer after 19 iterations will be .

Similarly, the invariants become obvious in the other problems under the corresponding operations/transformations. I suppose you were thinking of an “invariant” when you wrote “ conserves the sum of the reciprocals”.

I think it’s clear from looking at the span of comments that a pointer to how to embed TeX mathematics into comments would be appreciated. I see at least two different nonworking methods of doing so, including mine.

Obviously some people know how to post math, I’d like to, too.