#352 - Blood Tests
Each one of the \(25\) sheep in a flock must be tested for a rare virus, known to affect \(2\%\) of the sheep population. An accurate and extremely sensitive PCR test exists for blood samples, producing a clear positive / negative result, but it is very time-consuming and expensive.
Because of the high cost, the vet-in-charge suggests that instead of performing \(25\) separate tests, the following procedure can be used instead:
The sheep are split into \(5\) groups of \(5\) sheep in each group.
For each group, the \(5\) samples are mixed together and a single test is performed. Then,
- If the result is negative, all the sheep in that group are deemed to be virus-free.
- If the result is positive, \(5\) additional tests will be performed (a separate test for each animal) to determine the affected individual(s).
Since the probability of infection for any specific animal is only \(0.02\), the first test (on the pooled samples) for each group will be:
- Negative (and no more tests needed) with probability \(0.98^5 = 0.9039207968\).
- Positive (\(5\) additional tests needed) with probability \(1 - 0.9039207968 = 0.0960792032\).
Thus, the expected number of tests for each group is \(1 + 0.0960792032 \times 5 = 1.480396016\).
Consequently, all \(5\) groups can be screened using an average of only \(1.480396016 \times 5 = \mathbf{7.40198008}\) tests, which represents a huge saving of more than \(70\%\)!
Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and that there are no adverse effects caused by mixing different samples). E.g.:
- We may start by running a test on a mixture of all the \(25\) samples. It can be verified that in about \(60.35\%\) of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining \(39.65\%\) of the cases.
- If we know that at least one animal in a group of \(5\) is infected and the first \(4\) individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected).
- We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised.
To simplify the very wide range of possibilities, there is one restriction we place when devising the most cost-efficient testing scheme: whenever we start with a mixed sample, all the sheep contributing to that sample must be fully screened (i.e. a verdict of infected / virus-free must be reached for all of them) before we start examining any other animals.
For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just \(\mathbf{4.155452}\) tests!
Using the optimal strategy, let \(T(s,p)\) represent the average number of tests needed to screen a flock of \(s\) sheep for a virus having probability \(p\) to be present in any individual.
Thus, rounded to six decimal places, \(T(25, 0.02) = 4.155452\) and \(T(25, 0.10) = 12.702124\).
Find \(\sum T(10000, p)\) for \(p=0.01, 0.02, 0.03, \dots 0.50\).
Give your answer rounded to six decimal places.
Problem text © Project Euler, licensed under CC BY-NC-SA 4.0. Original: projecteuler.net/problem=352. Published Sunday, 2nd October 2011, 01:00 am. Solved by 729 members at time of mirroring.
Why this is useful
Probability Statistics. Expectation and state-based probability reasoning underpin pricing, risk, and statistical inference (Phases 7, 11, 13).
We classify relevance honestly - not every Euler problem is a trading application.
Prerequisites
Lessons that prepare you:
10.4 Algorithms: Gradient Descent and Newton's Method · 10.1 Convex Sets and Convex Functions · 13.2 Monte Carlo Estimation and Error Analysis · 19.5 Combinatorics: Counting, Binomials, and Inclusion–Exclusion · 19.14 Computational Complexity, Feasibility Estimation, and Proving Algorithms Correct · 19.7 Dynamic Programming: Memoization and Tabulation · 19.4 Exact Arithmetic: Big Integers, Rationals, and Floating-Point Traps · 19.9 Graph Algorithms: BFS, DFS, Dijkstra, and Minimum Spanning Trees · 19.6 Recurrence Relations and Generating Functions · 2.4 Taylor Series and Local Approximation · 5.1 Floating-Point Arithmetic, Conditioning, and Stability · 7.3 Independence, Conditional Probability, and Conditional Expectation · 7.2 Expectation, Moments, and Key Inequalities · 7.1 Probability Spaces, Random Variables, and Distributions
Recommended stepping-stone problems: #151 · #317 · #714
Concepts: dynamic-programming game-theory numerical-methods optimization probability brute-force-reduction
Likely techniques: bfs-dfs inclusion-exclusion precision-control
Learning mode
Pick how much scaffolding you want. Your choice is remembered per problem.
Understand the problem
- What exactly is the input to problem 352? Is it a bound (10000), a supplied dataset, or a definition you must generate from?
- What is the required output - restate it precisely: a single sum. Required format: Give your answer rounded to six decimal places.
- Which objects exactly are in scope, and which are excluded by the wording (strict vs non-strict inequality, 'distinct', 'proper', 'below' vs 'up to')?
- What do the arguments of T(s,p) mean, and what is the value's type (count, sum, probability)?
- What are the edge cases: the smallest legal object, zero/one, ties, and the boundary at exactly 10000?
- Why is brute force hard HERE specifically? Estimate the number of candidates implied by 10000 and the cost of testing one.
- Which numerical-methods fact would, if true, collapse the search - and can you state it as a testable claim before you look for a proof?
Predict & plan (before you code)
- Predict the strategy: in one sentence, what will your solution do? (The classification says numerical-methods / inclusion-exclusion - do you agree, and why?)
- Predict the complexity of your intended method in terms of N = 10000, and the wall-clock time you expect. Write both down now.
- Predict the key data structure: what is stored, keyed by what, and how large will it get at full scale?
- Predict the failure mode: what is most likely to break - an off-by-one on the bound, a definition misread, precision, or memory?
- Predict the output of the small case from rung 3 BEFORE running it (the statement says: "E.g.: We may start by running a test on a mixture of all the 25 samples.") - then run it. A surprise here is worth more than an hour of debugging later.
Scratchpad
Mathematical notes, formulas, pseudocode, hypotheses, complexity notes. Saved automatically with your progress.
Python workbench
Real Python (Pyodide) in a sandboxed Web Worker - no network, no filesystem, no DOM access. Ctrl/Cmd+Enter runs. Escape leaves the editor. Stop terminates the worker.
Check your answer
Answers are checked against a salted hash held in a separate file - not printed in this page. This prevents accidental spoilers; it is not cryptographic protection (see the build notes).
Progressive hints
Optimization
You have a correct answer. That is the start of the learning, not the end.
- Reduce the time complexity. What is the bottleneck, and what mathematical fact removes it?
- Reduce memory. Can you stream, or keep only the last k states?
- Replace brute force with a closed form, a sieve, a recurrence, or a symmetry argument.
- Prove the optimized version computes the same thing.
- Compare two implementations and time them.
Explain it
Which step of your solution were you least confident about, and what evidence would settle it?
What did you try first, and what specifically made you abandon it - a proof, a timing, or a wrong small-case answer?
Where did the numerical-methods structure do the real work? Name the single observation that collapsed the search space.
Could you have reached the inclusion-exclusion idea faster? Which words in the statement were pointing at it, and did you notice them?
What was the bug that cost you the most time, and what CLASS of bug was it (off-by-one, definition misread, precision, state under-specified)?
How would your solution change if the bound 10000 were multiplied by 1000? Does it survive, or does it need a different idea?
What is the honest complexity of what you wrote (not what you intended), and where is the remaining slack?
Which problem you have already solved is this most similar to, and what is the shared skeleton - is it really 'inclusion-exclusion' underneath?
State the transferable technique in one sentence, without mentioning this problem's story at all.
Self-assess (mastery is not a correct number)
You reach Mastered only when you have solved it, rated yourself at least Solid across the dimensions, and written a real explanation.
Confidence
Low confidence schedules this problem for spaced review, even if you solved it.
Mastery check
- Variation: change the bound (or a rule) in the statement. Does your method still work? What breaks first?
- Constraints: if the limit were 10× larger, which step fails, and what would you replace it with?
- Related problem: #151 · #317 · #714
- Transfer: where else does this technique appear? Name a lesson and a real computational setting.
- Spaced re-attempt: come back after the review interval and re-solve it with no hints.