Blog Archives

a thread to bin them all [puzzle]

July 8, 2018
By
a thread to bin them all [puzzle]

The most recent riddle on the Riddler consists in finding the shorter sequence of digits (in 0,1,..,9) such that all 10⁴ numbers between 0 (or 0000) and 9,999 can be found as a group of consecutive four digits. This sequence is obviously longer than 10⁴+3, but how long? On my trip to Brittany last weekend,

Read more »

seven digit addition

July 5, 2018
By

Another quick riddle from the riddler: solve the equation EXMREEK + EHKREKK = ?K?H?X?E which involves every digit between 0 and 9. While the puzzle can be unravelled by considering first E and K, which must be equal to 6 and 3, a simple R code also leads to the conclusion isok

Read more »

hitting a wall

July 4, 2018
By
hitting a wall

Once in a while, or a wee bit more frequently (!), it proves impossible to communicate with a contributor of a question on X validated. A recent instance was about simulating from a multivariate kernel density estimate where the kernel terms at x¹,x²,… are Gaussian kernels applied to the inverses of the norms |x-x¹|, |x-x²|,…

Read more »

Bayesian GANs [#2]

June 26, 2018
By
Bayesian GANs [#2]

As an illustration of the lack of convergence of the Gibbs sampler applied to the two “conditionals” defined in the Bayesian GANs paper discussed yesterday, I took the simplest possible example of a Normal mean generative model (one parameter) with a logistic discriminator (one parameter) and implemented the scheme (during an ISBA 2018 session). With

Read more »

Le Monde puzzle [#1053]

June 20, 2018
By
Le Monde puzzle [#1053]

An easy arithmetic Le Monde mathematical puzzle again: If coins come in units of 1, x, and y, what is the optimal value of (x,y) that minimises the number of coins representing an arbitrary price between 1 and 149?  If the number of units is now four, what is the optimal choice? The first question

Read more »

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 »

maximal spacing around order statistics [#2]

June 7, 2018
By
maximal spacing around order statistics [#2]

The proposed solution of the riddle from the Riddler discussed here a few weeks ago is rather approximative, in that the distribution of when the n-sample is made of iid Normal variates is (a) replaced with the distribution of one arbitrary minimum and (b) the distribution of the minimum is based on an assumption of

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 »

maximal spacing around order statistics

May 16, 2018
By
maximal spacing around order statistics

The riddle from the Riddler for the coming weeks is extremely simple to express in mathematical terms, as it summarises into characterising the distribution of when the n-sample is made of iid Normal variates. I however had a hard time finding a result connected with this quantity since most available characterisations are for either Uniform

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=ok=1 ok=1 while

Read more »

Search R-bloggers


Sponsors

Never miss an update!
Subscribe to R-bloggers to receive
e-mails with the latest R posts.
(You will not see this message again.)

Click here to close (This popup will not appear again)