Find the smallest example of (strict) Simpson's paradox; that is, construct such table where the number of cases is minimum. Formally, suppose that are nonnegative integers and are positive integers such that , and also , , but . Determine the minimum value of .
Example: There are two kinds of kidney stone problems, those with small stones and those with large stones. There are also two kinds of treatments, a simple treatment and a complex treatment. The number of success cases, divided by the number of cases for each stone/treatment combination, is displayed in the table below.
|Small stone||Large stone||Both|
|Complex treatment||81/87 (93%)||192/263 (73%)||273/350 (78%)|
|Simple treatment||234/270 (87%)||55/80 (69%)||289/350 (83%)|
As one can see, the complex treatment performs better with small stone cases, and so as with large stone cases, but when the data is combined, the simple treatment performs better.
In the sample above, there are a total of 700 cases considered, with 350 complex treatments and 350 simple treatments (or alternatively 357 small stone cases and 343 large stone cases). This problem asks for the minimum possible total number of cases considered.
Clarification: In usual Simpson's paradox, it's allowed to have several weak inequalities (some of the inequalities above may actually be equalities). This problem thus has a stronger form of Simpson's paradox, where none of the inequalities may be an equality.