Solution: We are to minimize $ rac{1}{a} + rac{1}{b} + rac{1}{c} $ under the constraint $ a + b + c = 1 $ with $ a, b, c > 0 $.

["Title: Minimize $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $ Given $ a + b + c = 1 $, $ a, b, c > 0 $: Optimal Solution Explained", "When tasked with minimizing $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $ subject to the constraint $ a + b + c = 1 $ with $ a, b, c > 0 $, mathematics reveals a powerful and elegant solution rooted in inequality principles—particularly the AM-HM inequality and optimization under constraints. This article explores how to solve this problem efficiently, demonstrating why allocating as equal values among $ a, b, c $ yields the minimum sum of reciprocals.", "---", "### Understanding the Problem", "We aim to minimize the expression:", "$$\nS = \frac{1}{a} + \frac{1}{b} + \frac{1}{c}\n$$", "subject to:", "$$\na + b + c = 1, \quad a > 0, ; b > 0, ; c > 0\n$$", "At first glance, minimizing a sum of reciprocals under a fixed sum constraint may seem counterintuitive—since small values of $ a, b, c $ produce large reciprocals. Yet, despite individual terms growing large for small variables, the interplay between the function and constraint leads to a surprising minimum when $ a = b = c = \frac{1}{3} $.", "---", "### Why Equal Allocation Minimizes the Sum", "#### Step 1: Apply the Arithmetic Mean – Harmonic Mean (AM-HM) Inequality", "The Harmonic Mean (HM) of three positive numbers $ a, b, c $ is defined as:", "$$\n\ ext{HM} = \frac{3}{\frac{1}{a} + \frac{1}{b} + \frac{1}{c}} = \frac{3}{\frac{1}{S}}\n\quad \Rightarrow \quad\nS = \frac{3}{\ ext{HM}}\n$$", "For any set of positive numbers, the harmonic mean is always less than or equal to the arithmetic mean:", "$$\n\ ext{HM} \leq \frac{a + b + c}{3} = \frac{1}{3}\n\quad \Rightarrow \quad\nS = \frac{3}{\ ext{HM}} \geq \frac{3}{1/3} = 9\n$$", "Thus, $ S \geq 9 $, with equality if and only if $ a = b = c $. Since $ a + b + c = 1 $, equality occurs when $ a = b = c = \frac{1}{3} $.", "This proves that the minimum value of $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $ is 9, achieved when all variables are equal.", "---", "### Step-by-Step Optimization via Lagrange Multipliers (Advanced Approach)", "For a rigorous mathematical treatment, we apply calculus-based optimization with constraints.", "Define the function to minimize:", "$$\nf(a,b,c) = \frac{1}{a} + \frac{1}{b} + \frac{1}{c}\n$$", "Constraint:", "$$\ng(a,b,c) = a + b + c - 1 = 0\n$$", "Using the method of Lagrange multipliers, set:", "$$\n<br/>\nabla f = \lambda <br/>\nabla g\n$$", "Compute partial derivatives:", "$$\n\frac{\partial f}{\partial a} = -\frac{1}{a^2},\quad \frac{\partial f}{\partial b} = -\frac{1}{b^2},\quad \frac{\partial f}{\partial c} = -\frac{1}{c^2},\quad <br/>\nabla g = (1,1,1)\n$$", "Thus:", "$$\n-\frac{1}{a^2} = \lambda, \quad -\frac{1}{b^2} = \lambda, \quad -\frac{1}{c^2} = \lambda\n\quad \Rightarrow \quad\n\frac{1}{a^2} = \frac{1}{b^2} = \frac{1}{c^2} = -\lambda\n$$", "Since $ a, b, c > 0 $, the negatives indicate the magnitudes are equal:", "$$\na^2 = b^2 = c^2 \Rightarrow a = b = c \quad (\ ext{since positive})\n$$", "From $ a + b + c = 1 $, we get $ 3a = 1 \Rightarrow a = \frac{1}{3} $. Hence, $ a = b = c = \frac{1}{3} $", "Substitute back:", "$$\nS = \frac{1}{1/3} + \frac{1}{1/3} + \frac{1}{1/3} = 3 + 3 + 3 = 9\n$$", "---", "### Intuitive Insight: Extreme Values Increase Reciprocals", "Suppose one variable approaches 0 (e.g., $ a \ o 0^+ $), then $ \frac{1}{a} \ o \infty $, instantly inflating $ S $. To prevent any one term from becoming too large, the variables must balance—leading again to equality.", "---", "### Practical Applications", "This optimization problem appears in diverse fields:", "- Portfolio optimization: Minimizing cost-like inverse risks under a fixed total investment.\n- Resource allocation: Distributing limited resources to minimize inefficiency (modeled via reciprocal cost).\n- Network flow design: Balancing bandwidth or latency under total bandwidth constraints.", "---", "### Summary", "To minimize $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $ with $ a + b + c = 1 $ and $ a, b, c > 0 $:", "✅ Equal values $ a = b = c = \frac{1}{3} $ yield the minimum.\n✅ Minimum value is $ 9 $, proven via AM-HM inequality and Lagrange multipliers.\n✅ Deviations increase reciprocal values, preventing the sum from dropping below 9.", "---", "### Final Thoughts", "Mathematical optimization under constraints reveals elegant efficiencies hidden beneath seemingly complex expressions. Recognizing symmetry and applying powerful inequalities like AM-HM allows precise solutions even for non-trivial problems. Whether in academic theory or real-world engineering, such principles are invaluable tools.", "---", "Keywords: minimize $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $, constraint $ a + b + c = 1 $, $ a, b, c > 0 $, AM-HM inequality, Lagrange multipliers, optimization under constraint, unequal variables, minimum sum, reciprocal minimization.", "---", "Further Reading:\n- Inequalities in Mathematics by Israel Gelfand\n- Calculus: Early Transcendentals by James Stewart (Chapters on optimization)\n- Formal proofs of the Arithmetic Mean–Harmonic Mean inequality", "---", "Meta Description:\nLearn how to minimize $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c} $ under $ a + b + c = 1 $, $ a, b, c > 0 $. Use AM-HM inequality and Lagrange multipliers to prove minimum value is 9 when $ a = b = c = \frac{1}{3} $."]