# Le Monde

### R midterms

November 9, 2012 |

Here are my R midterm exams, version A and version B in English (as students are sitting next to one another in the computer rooms), on simulation methods for my undergrad exploratory statistics course. Nothing particularly exciting or innovative! Dedicated ‘Og‘s readers may spot a few Le Monde puzzles ... [Read more...]

### the large half now

October 28, 2012 |

The little half puzzle proposed a “dumb’ solution in that players play a minimax strategy. There are 34 starting values less than 100 guaranteeing a sure win to dumb players. If instead the players maximise their choice at each step, the R code looks like this: and there are now 66 (=100-34, indeed!) ... [Read more...]

### the little half (another Le Monde puzzle)

October 27, 2012 |

I found this Le Monde puzzle of June 16 I had stored and then somehow forgotten with my trips to Japan and Australia: There are n beans in a box, with 98≤n≤102). Two players take at each round either one bean from the box or “the little half” (i.e. the ... [Read more...]

### Le Monde puzzle (rainy Sunday!)

October 20, 2012 |

On October 14, the weekend edition of Le Monde had the following puzzle: consider four boxes that contain all integers between 1 and 9999, in such a way that for any N, N, 2N, 3N, and 4N are in four different boxes. If 1,2,3 and 4 are in boxes labelled 1,2,3 and 4, respectively, in [...] [Read more...]

### Le Monde puzzle [#783]

July 20, 2012 |

In a political party, there are as many cells as there are members and each member belongs to at least one cell. Each cell has five members and an arbitrary pair of cells only shares one member. How many members are there in this political party? Back to the mathematical ... [Read more...]

### \verbatim [beamer package]

June 11, 2012 |

Once again working on my slides for the AMSI Lecture 2012 tour, it took me a while to get the following LaTeX code (about the family reunion puzzle) to work: \begin{frame}[fragile,label=notleM2] \slidetitle{A family meeting} \begin{block}{Random switch of couples} \only{ \begin{itemize} \item Pick two ... [Read more...]

### Le Monde puzzle [#755?]

January 27, 2012 |

Le Monde puzzle of last weekend was about sudoku-like matrices. Consider an (n,n) matrix containing the integers from 1 to n². The matrix is “friendly” if the set of the sums of the rows is equal to the set of the sum of the columns. Find examples for n=4,5,6. Why ... [Read more...]

### Le Monde puzzle [#752]

December 8, 2011 |

After a loooong break, here is one Le Monde mathematical puzzle I had time to look at, prior to going to Dauphine for a Saturday morning class (in replacement of my R class this week)! The question is as follows: A set of numbers {1,…,N} is such that multiples of 4 ... [Read more...]

### art brut

November 12, 2011 |

Filed under: pictures, R Tagged: Le Monde, mathematical puzzle, R [Read more...]

### le Monde puzzle [#745]

October 20, 2011 |

The puzzle in Le Monde this weekend is not that clear (for a change!), so I may be confused in the following exposition: Three card players are betting with a certain (and different) number of chips each, between 4 and 9. After each game, the looser doubles the number of chips of ... [Read more...]

### Le Monde puzzle [#739]

September 9, 2011 |

The weekend puzzle in Le Monde this week is again about a clock.  Now, the clock has one hand and x ticks where a lamp is either on or off. The hand moves from tick to tick and each time the lights go on or off depending on whether or ... [Read more...]

### Le Monde puzzle [#738]

September 1, 2011 |

The Friday puzzle in Le Monde this week is about “friendly perfect squares”, namely perfect squares x2__10 and y2__10 with the same number of digits and such that, when drifting all digits of x2 by the same value a (modulo 10), one recovers y2. For instance, 121 is “friend” with 676. Here is ... [Read more...]

### Le Monde puzzle [#737 re-read]

August 27, 2011 |

As a coincidence, while I was waiting for the solution to puzzle #737 published this Friday in Le Monde, the delivery (wo)man forgot to include the weekend magazine and I had to buy it this morning with my baguette (as if anyone cares!). The solution is (y0,z0,w0)=(38,40,46) and…... [Read more...]

### Le Monde puzzle [#737]

August 26, 2011 |

The puzzle in the weekend edition of Le Monde this week can be expressed as follows: Consider four integer sequences (xn), (yn), (zn), and (wn), such that and, if u=(xn,yn,zn,wn), for i=1,…,4, if ui is not the maximum of u and otherwise. Find the first return ... [Read more...]

### Ternary sorting

July 24, 2011 |

The last Le Monde puzzle made me wonder about the ternary version of the sorting algorithms, which all seem to be binary (compare x and y, then…). The problem is, given (only) a blackbox procedure that returns the relative order of three arbitrary numbers, how many steps are necessary to ... [Read more...]

### Le Monde puzzle [#14.2]

May 14, 2011 |

I received at last my weekend edition of Le Monde and hence the solution proposed by the authors (Cohen and Busser) to the puzzle #14. They obtain a strategy that only requires at most 19 steps. The idea is to start with a first test, which gives a reference score S0, and ... [Read more...]

### Le Monde puzzle [#14]

May 13, 2011 |

Last week Le Monde puzzle (I have not received this week issue yet!) was about deriving an optimal strategy in less than 25 steps for finding the 25 answers to a binary multiple choice test, when at each trial, only the number of correct answers is known. Hence, if the correct answers ... [Read more...]

### Le Monde puzzle [#8]

March 29, 2011 |

Another mathematical puzzle from Le Monde that relates to a broken calculator (skipping the useless tale): Given a pair of arbitrary positive integers (x,y) a calculator can either substract the same integer [lesser than min(x,y)] from both x and y or multiply either x or y by 2. ... [Read more...]

### Le Monde puzzle [#7]

March 26, 2011 |

The mathematical puzzle from the weekend edition of Le Monde from a few weeks ago was not too hard to solve by induction but my R code failed miserably! The puzzle was as follows: A calculator is broken in such a way that it starts by exhibiting 0, then pressing 4, 6 or 0 ... [Read more...]

### Le Monde puzzle [#6]

February 17, 2011 |

A simple challenge in Le Monde this week: find the group of four primes such that any sum of three terms in the group is prime and the overall sum is minimised. Here is a quick exploration by simulation, using the schoolmath package (with its imperfections): A=primes(start=1,end=53)[... [Read more...]
1 2 3