another drawer of socks
A socks riddle from the Riddler but with no clear ABC connection! Twenty-eight socks from fourteen pairs of socks are taken from a drawer, one by one, and laid on...continue reading.
A socks riddle from the Riddler but with no clear ABC connection! Twenty-eight socks from fourteen pairs of socks are taken from a drawer, one by one, and laid on...continue reading.
An easy riddle, riding the birthday paradox. Namely how many people on average have to sequentially enter a room for a double birthday to occur? The answer is straightforward, as...continue reading.
This article is originally published at https://xianblog.wordpress.com Thanks for visiting r-craft.org This article is originally published at https://xianblog.wordpress.com Please visit source website for post related comments.continue reading.
A zorbing puzzle from the Riddler: cover the plane with four non-intersecting disks of radius one towards getting the highest probability (under the standard bivariate Normal distribution). As I could...continue reading.
The Kelly criterion is a way to optimise an unlimited sequence of bets under the following circumstances: a probability p of winning each bet, a loss of a fraction a...continue reading.
Consider a shell game with three shells and a ball where only the location of the shell with the ball is exchanged with the location of an empty shell, randomly...continue reading.
The riddle of the week is about 10 goats sequentially moving to their room, which they have chosen at random and independently (among ten rooms), unless another goat already occupies...continue reading.
Bayes Rules! is a new introductory textbook on Applied Bayesian Model(l)ing, written by Alicia Johnson (Macalester College), Miles Ott (Johnson & Johnson), and Mine Dogucu (University of California Irvine). Textbook...continue reading.
A very classical (textbook) question on the Riddler on inferring the contents of an urn from an Hypergeometric experiment: You have an urn with N red and white balls, but...continue reading.
This article is originally published at https://xianblog.wordpress.com Thanks for visiting r-craft.org This article is originally published at https://xianblog.wordpress.com Please visit source website for post related comments.continue reading.
Following a question on Stack Overflow trying to replicate a figure from the paper written by Alan Gelfand and Adrian Smith (1990) for The American Statistician, Bayesian sampling without tears,...continue reading.
A question from X validated had enough appeal for me to procrastinate about it for ½ an hour: what difference does it make [for simulation purposes] that a target density...continue reading.
A quick-and-dirty R resolution of a riddle from The Riddler, namely to find a Carmichael number of the form abcabc: library(numbers) for(i in 1:9) for(j in 0:9) for(k in 0:9){...continue reading.
A question on X validated about EM steps for a truncated Normal mixture led me to ponder whether or not a more ambitious completion [more ambitious than the standard component...continue reading.
The stability result that the ratio converges holds for a Harris π-null-recurrent Markov chain for all functions f,g in L¹(π) [Meyn & Tweedie, 1993, Theorem 17.3.2] is rather fascinating. However,...continue reading.
The Riddler of April 1 offered this simple question: start with the number 1 and then try to reach a target number through a series of steps. For each step,...continue reading.
A monthly birthday problem from the Riddler: What was the probability that none of the 40 people had birthdays this month? What is the probability that there is at least...continue reading.
The riddle from The Riddler of 19 Feb. is about the Bernoulli Galton-Watson process, where each individual in the population has one or zero descendant with equal probabilities: Starting with...continue reading.
This second edition of an introductory R book was sent to me by the author for a potential CHANCE book review. As there are many (many) books in the same...continue reading.
One recent code-golf challenge was to write the shortest possible code representing the first n² integers in a spiral progression, e.g., 0 1 2 3 4 15 16 17 18...continue reading.