An arithmetic Le Monde mathematical puzzle: Given an integer k>1, consider the sequence defined by F(1)=1+1 mod k, F²(1)=F(1)+2 mod k, F³(1)=F²(1)+3 mod k, &tc. [With this notation, F is not necessarily a function.] For which value of k is the sequence the entire {0,1,…,k-1} set? This leads to an easy brute force resolution, for […]

## Search Results

## Le Monde puzzle [#960]

April 28, 2016## Le Monde puzzle [#959]

April 20, 2016Another of those arithmetic Le Monde mathematical puzzle: Find an integer A such that A is the sum of the squares of its four smallest dividers (including1) and an integer B such that B is the sum of the third poser of its four smallest factors. Are there such integers for higher powers? This begs […]

## Le Monde puzzle [#958]

April 11, 2016A knapsack Le Monde mathematical puzzle: Given n packages weighting each at most 5.8kg for a total weight of 300kg, is it always possible to allocate these packages to 12 separate boxes weighting at most 30kg each? weighting at most 29kg each? This can be checked by brute force using the following R code and […]

## Le Monde puzzle [#956]

April 5, 2016A Le Monde mathematical puzzle with little need of R programming but ending up being rather fascinating: Does there exist a function f from N to N such that (i) f is (strictly) increasing, (ii) f(n)≥n, and (iii) f²(n)=f(f(n))=3n? Indeed, the three constraints imply (a) f²(0)=0, hence that that f(0)=0, (b) f(1)=2 as it can be […]

## Le Monde puzzle [#954]

March 25, 2016A square Le Monde mathematical puzzle: Given a triplet (a,b,c) of integers, with a<b<c, it satisfies the S property when a+b, a+c, b+c, a+b+c are perfect squares such that a+c, b+c, and a+b+c are consecutive squares. For a given a, is it always possible to find a pair (b,c) such (a,b,c) satisfies S? Can you […]