Top Posts
Recent comments
 dsp on The enhanced power graph is weakly perfect
 dsp on The enhanced power graph is weakly perfect
 What Lovelace Did: From Bombelli to Bernoulli to Babbage  on Polynomials taking integer values
 What Ada Did: From Bombelli to Bernoulli to Babbage  on Polynomials taking integer values
 Peter Cameron on The enhanced power graph is weakly perfect
Blogroll
 Astronomy Picture of the Day
 Azimuth
 British Combinatorial Committee
 Comfortably numbered
 Diamond Geezer
 Exploring East London
 From hill to sea
 Gödel's lost letter and P=NP
 Gil Kalai
 Jane's London
 Jon Awbrey
 Kourovka Notebook
 LMS blogs page
 Log24
 London Algebra Colloquium
 London Reconnections
 MathBlogging
 Micromath
 Neill Cameron
 neverendingbooks
 Noncommutative geometry
 numericana hall of fame
 Ratio bound
 Robert A. Wilson's blog
 Since it is not …
 Spitalfields life
 Sylvy's mathsy blog
 SymOmega
 Terry Tao
 The Aperiodical
 The De Morgan Journal
 The ICA
 The London column
 The Lumber Room
 The matroid union
 Theorem of the day
 Tim Gowers
 XKCD
Find me on the web

Join 659 other followers
Cameron Counts: RSS feeds
Meta
Tag Archives: sampling
Bijective proofs
A fourth proof Last month I described three proofs of the formula for the number of ways to choose k objects from a set of n, if repetition is allowed and order is not significant; it is the same as … Continue reading
Posted in exposition, open problems
Tagged bijections, Catalan numbers, Catalan objects, Dima FonDerFlaass, permutations, sampling
Leave a comment
Another formula
Anyone who knows about the Principle of Inclusion and Exclusion will suspect that it can be applied to the relationship between sampling with and without replacement. In order to find the formula for sampling without replacement, we must be able … Continue reading
Three formulae
Yesterday, we sampled k objects from a set of n under four possible sampling rules. Suppose that the n objects are of two different types, A and B, with a of type A and b of type B, where a+b = n. … Continue reading
Three proofs
In how many ways can you choose a sample of size k from n distinguishable objects? As is well known, the answer depends on the sampling rules: Does the order of selection matter, or not? Are items allowed to be … Continue reading
Lists
In Notes from Overground, Tiresias (my former neighbour Roger Green) quotes with approval from a lecture by W. H. Auden, on “four questions which, could I examine a critic, I should ask him”. He said: He said: ‘If a critic could truthfully … Continue reading