The current puzzle is the last one before the summer break and not exciting enough to take along: Take the first ten digits, create five pairs out of those, and for each pair (x,y) derive the quantity (min(x,y)+1.5max(x,y)). What is the collection of pairs that maximises the product of those quantities? I wrote the following […]

