Blog Archives

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 »

Imperial postdoc in Bayesian nonparametrics

April 27, 2018
By
Imperial postdoc in Bayesian nonparametrics

Here is another announcement for a post-doctoral position in London (UK) to work with Sarah Filippi. In the Department of Mathematics at Imperial College London. (More details on the site or in this document. Hopefully, the salary is sufficient for staying in London, if not in South Kensington!) The post holder will work on developing

Read more »

practical Bayesian inference [book review]

April 25, 2018
By
practical Bayesian inference [book review]

It is always a bit of

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 . 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 »

Masterclass in Bayesian Statistics in Marseilles next Fall

April 8, 2018
By
Masterclass in Bayesian Statistics in Marseilles next Fall

This post is to announce a second occurrence of the exciting “masterclass in Bayesian Statistics” that we organised in 2016, near Marseilles. It will take place on 22-26 October 2018 once more at CIRM (Centre International de Recherches Mathématiques, Luminy, Marseilles, France). The targeted audience includes all scientists interested in learning how Bayesian inference may

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 null hypothesis with a 99% probability to be true…

March 27, 2018
By
a null hypothesis with a 99% probability to be true…

When checking the Python t distribution random generator, np.random.standard_t(), I came upon this manual page, which actually does not explain how the random generator works but spends instead the whole page to recall Gosset’t test, illustrating its use on an energy intake of 11 women, but ending up misleading the readers by interpreting a .009

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)