At the beginning of the school year, of all students in Mr. Wells' math class answered "Yes" to the question "Do you love math", and answered "No." At the end of the school year, answered "Yes" and answered "No." Altogether, of the students gave a different answer at the beginning and end of the school year. What is the difference between the maximum and the minimum possible values of ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
In a class of 100, Yes grows by 20. At least those 20 switch. At most, all 50 No students switch to Yes and 30 Yes students switch to No.
Solution
Percents are easier to picture with a class of students, so is just the number of students who changed.
- Start: say Yes, say No.
- End: say Yes, say No.
1. Let be the number who switch from Yes to No. The Yes group loses those students and still has to grow from to , so students must switch from No to Yes.
2. The total number who changed is
So is smallest when is smallest and largest when is largest.
Smallest .
- Take : nobody leaves Yes, and students move from No to Yes. Then . This clearly works, and cannot be less, because cannot be negative.
Largest .
- Everyone who switches to No ends up in the final No group, which has only students. So .
- Everyone who switches to Yes started in the No group, which has students. So , which again says .
- Take : all No students switch to Yes, and Yes students switch to No. Check: Yes ends with , and No ends with . Then .
The difference between the largest and smallest values is .
The answer is .
Why this works
The same overall change (Yes up by ) can come from very different amounts of switching, because students can switch in both directions and cancel each other out. Pick one of the two flows as your unknown, write everything in terms of it, and then find how big and how small it can be. For the largest value, check every group the switchers leave and every group they join.
Alternative approach
Think about the two extreme stories directly. Least switching: only the needed students move from No to Yes, so . Most switching: all No students become Yes, and then Yes students must become No to bring Yes back down to . That is . The difference is .
The trap
Assuming the only possible value is the 20% net change, or letting more students switch to No than the 30% who say No at the end.
Concise solution
Let of students switch from No to Yes and switch from Yes to No. The final Yes percentage is , so . The total switching is
Minimum: gives . This is achievable: of the original No group changes to Yes and everyone else stays put.
Maximum: is limited by the end-of-year No group, which is only , so . Also (the original No group), again . Taking gives : every original No becomes Yes, and of the original Yes group becomes No. Then .
The difference is .
The answer is .
Review in the AoPS books
- Intermediate Counting & Probability, Chapter 2: Sets and Logic (§2.2, §2.3)
- Introduction to Algebra, Chapter 20: Special Functions (§20.2, §20.5)
- Prealgebra, Chapter 7: Ratios, Conversions, and Rates (§7.4)
- Introduction to Algebra, Chapter 15: More Inequalities (§15.1, §15.3, §15.4)
Techniques
Bound the quantity above/below or estimate to pin it down · Consider the largest/smallest element or boundary case