A cheezy Le Monde mathematical puzzle : (which took me much longer to find than to solve, as Warwick U does not get a daily delivery of the newspaper ): Take a round pizza (or a wheel of Gruyère) cut into seven identical slices and turn one

A new Le Monde mathematical puzzle in the digit category: Find the largest number such that each of its internal digits is strictly less than the average of its two neighbours. Same question when all digits differ. For instance, n=96433469 is such a number. When trying pure brute force (with the usual integer2digits function!) le=solz=3

Recalling Le Monde mathematical puzzle first competition problem Given yay/nay answers to the three following questions about the integer 13≤n≤1300 (i) is the integer n less than 500? (ii) is n a perfect square? (iii) is n a perfect cube? n cannot be determined, but it is certain that any answer to the fourth question

A Le Monde mathematical puzzle from after the competition: A sequence of five integers can only be modified by subtracting an integer N from two neighbours of an entry and adding 2N to the entry. Given the configuration below, what is the minimal number of steps to reach non-negative entries everywhere? Is this feasible for

And here is Le Monde mathematical puzzle last competition problem Find the number of integers such that their 15 digits are all between 1,2,3,4, and the absolute difference between two consecutive digits is 1. Among these numbers how many have 1 as their three-before-last digit and how many have 2? Combinatorics!!! While it seems like

The penultimate Le Monde mathematical puzzle competition problem is once again anti-climactic and not worth its points: For the figure below , describing two (blue) half-circles intersecting with a square of side 20cm, and a (orange) quarter of a circle with radius 20cm, find the radii of both gold circles, respectively tangent

Rewording Le Monde mathematical puzzle fifth competition problem For the 3×3 tables below, what are the minimal number of steps to move from left to rights when the yellow tokens can only be move to an empty location surrounded by two other tokens? In the 4×4 table below, there are 6 green tokens. How many

A purely (?) algorithmic Le Monde mathematical puzzle For the table below, what is the minimal number of steps required to reach equal entries when each step consists in adding ones to three entries sitting in a L, such as (7,11,12) or (5,6,10)? Same question for the inner table of four in yellow. For the

e-mails with the latest R posts.

(You will not see this message again.)