Posts Tagged ‘ mathematical puzzle ’

a chain of collapses

June 19, 2018
By
a chain of collapses

A quick riddler resolution during a committee meeting (!) of a short riddle: 36 houses stand in a row and collapse at times t=1,2,..,36. In addition, once a house collapses, the neighbours if still standing collapse at the next time unit. What are the shortest and longest lifespans of this row? Since a house with […]

Read more »

Le Monde puzzle [#1051]

May 17, 2018
By
Le Monde puzzle [#1051]

A combinatoric Le Monde mathematical puzzle of limited size: When the only allowed move is to switch two balls from adjacent boxes, what is the minimal number of moves to return all balls in the above picture to their respective boxes? Same question with six boxes and 12 balls. The question is rather interesting to […]

Read more »

the riddle of the stands

May 10, 2018
By
the riddle of the stands

The simple riddle of last week on The Riddler, about the minimum number of urinals needed for n men to pee if the occupation rule is to stay as far as possible from anyone there and never to stand next to another man,  is quickly solved by an R code: ocupee=function(M){ ok=rep(0,M) ok[1]=ok[M]=1 ok[trunc((1+M/2))]=1 while […]

Read more »

Le Monde puzzle [#1049]

April 17, 2018
By
Le Monde puzzle [#1049]

An algorithmic Le Monde mathematical puzzle with a direct Alice and Bob play a game by picking alternatively one of the remaining digits between 1 and 10 and putting it in either one of two available stacks, 1 or 2. Their respective gains are the products of the piles (1 for Alice and 2 for […]

Read more »

a [Gregorian] calendar riddle

April 16, 2018
By
a [Gregorian] calendar riddle

A simple riddle express this week on The Riddler, about finding the years between 2001 and 2099 with the most cases when day x month = year [all entries with two digits]. For instance, this works for 1 January, 2001 since 01=01 x 01. The only difficulty in writing an R code for this question […]

Read more »

Le Monde puzzle [#1048]

March 31, 2018
By
Le Monde puzzle [#1048]

An arithmetic Le Monde mathematical puzzle: A magical integer m is such that the remainder of the division of any prime number p by m is either a prime number or 1. What is the unique magical integer between 25 and 100? And is there any less than 25? The question is dead easy to […]

Read more »

a one-chance meeting [puzzle]

March 5, 2018
By
a one-chance meeting [puzzle]

This afternoon, I took a quick look at the current Riddler puzzle, which sums up as, given three points A, B, C, arbitrarily moving on a plane with a one-shot view of their respective locations, find a moving rule to bring the three together at the same point at the same time. And could not […]

Read more »

Le Monde puzzle [#1037]

January 23, 2018
By
Le Monde puzzle [#1037]

A purely geometric Le Monde mathematical puzzle this (or two independent ones, rather): Find whether or not there are inscribed and circumscribed circles to a convex polygon with 2018 sides of lengths ranging 1,2,…,2018. In the first (or rather second) case, the circle of radius R that is tangential to the polygon and going through […]

Read more »

Le Monde puzzle [#1036]

January 3, 2018
By
Le Monde puzzle [#1036]

An arithmetic Le Monde mathematical puzzle to conclude 2017: Find (a¹,…,a¹³), a permutation of (1,…,13) such that a¹/a²+a³=a²+a³/a³+a⁴+a⁵=b¹<1 a⁶/a⁶+a⁷=a⁶+a⁷/a⁷+a⁸+a⁹=a⁷+a⁸+a⁹/a⁵+a⁹+a¹⁰=b²<1 a¹¹+a¹²/a¹²+a¹³=a¹²+a¹³/a¹³+a¹⁰=b³<1 The question can be solved by brute force simulation, checking all possible permutations of (1,…,13). But 13! is 6.6 trillion, a wee bit too many cases. Despite the problem being made of only four constraints […]

Read more »

cyclic riddle [not in NYC!]

December 28, 2017
By
cyclic riddle [not in NYC!]

In the riddle of this week on fivethirtyeight, the question is to find the average number of rounds when playing the following game: P=6 players sitting in a circle each have B=3 coins and with probability 3⁻¹ they give one coin to their right or left side neighbour, or dump the coin to the centre. […]

Read more »


Subscribe

Email:

  Subscribe