Question: Let $ a $, $ b $, and $ c $ be positive real numbers such that $ a + b + c = 1 $. Find the minimum value of $ rac{1}{a} + rac{1}{b} + rac{1}{c} $.

["Minimum Value of $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $ Given $ a + b + c = 1 $ and $ a, b, c > 0 $", "When given positive real numbers $ a $, $ b $, and $ c $ such that their sum is 1, finding the minimum value of $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $ is a classic optimization problem with deep connections to inequality theory.", "### Understanding the Problem", "We are to minimize the expression $ S = \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $, subject to the constraint:", "$$\na + b + c = 1, \quad \ ext{with } a, b, c > 0\n$$", "Intuitively, since $ a, b, c $ are positive and sum to 1, their reciprocals grow large as any one variable approaches zero. This suggests the minimum occurs when $ a $, $ b $, and $ c $ are as equal as possible.", "### Applying the AM-HM Inequality", "A powerful tool for inequalities involving sums and reciprocals is the Arithmetic Mean–Harmonic Mean (AM-HM) Inequality, which states:", "For positive real numbers $ a, b, c $:", "$$\n\frac{a + b + c}{3} \geq \frac{3}{\frac{1}{a} + \frac{1}{b} + \frac{1}{c}}\n$$", "Using the constraint $ a + b + c = 1 $, we substitute:", "$$\n\frac{1}{3} \geq \frac{3}{\frac{1}{a} + \frac{1}{b} + \frac{1}{c}}\n$$", "Inverting both sides (and reversing the inequality):", "$$\n\frac{1}{a} + \frac{1}{b} + \frac{1}{c} \geq 9\n$$", "This shows that the minimum value of $ S $ is at least 9.", "### When Does Equality Occur?", "Equality in AM-HM holds if and only if $ a = b = c $. Given $ a + b + c = 1 $, this implies:", "$$\na = b = c = \frac{1}{3}\n$$", "Substituting:", "$$\n\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = 3 + 3 + 3 = 9\n$$", "Thus, the minimum value 9 is achievable.", "### Why Is This the Minimum?", "If any one variable decreases toward 0 (e.g., $ a \ o 0^+ $), then $ \frac{1}{a} \ o \infty $, causing $ S \ o \infty $. Hence, spreading values more evenly minimizes the sum of reciprocals under a fixed sum constraint.", "### Conclusion", "The minimum value of $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $, where $ a + b + c = 1 $ and $ a, b, c > 0 $, is:", "$$\n\boxed{9}\n$$", "This minimum is achieved uniquely when $ a = b = c = \frac{1}{3} $. This result exemplifies how symmetry and inequality principles converge to reveal elegant mathematical truths."]