x_1 + x_2 + x_3 + x_4 = 14, \quad \text{where } 1 \leq x_i \leq 6

["An In-Depth Look at Integer Solutions to ( x_1 + x_2 + x_3 + x_4 = 14 ) with Constraints ( 1 \leq x_i \leq 6 )", "---", "### Introduction", "Linear equations with integer constraints are fundamental in combinatorics, optimization, and discrete mathematics. One intriguing problem is finding all valid integer solutions to the equation:", "[\nx_1 + x_2 + x_3 + x_4 = 14\n]", "where each variable ( x_i ) satisfies ( 1 \leq x_i \leq 6 ). This constraint ensures each variable is a positive integer within a bounded range. Understanding the number and structure of solutions sheds light on combinatorial compactness and has applications in resource allocation, inventory management, and constraint satisfaction problems.", "This article explains how to systematically find all such solutions, explores the logic behind counting them, and discusses practical implications.", "---", "### Understanding the Constraints", "We seek all integer quadruples ((x_1, x_2, x_3, x_4)) such that:", "- Each ( x_i \in {1, 2, 3, 4, 5, 6} )\n- ( x_1 + x_2 + x_3 + x_4 = 14 )", "This is a bounded integer composition problem: counting solutions to a linear Diophantine equation with lower and upper limits.", "---", "### Step 1: Transform Variables to Simplify Constraints", "To handle the lower bound ( x_i \geq 1 ), define new variables:", "[\ny_i = x_i - 1 \quad \Rightarrow \quad y_i \in {0, 1, 2, 3, 4, 5}\n]", "Then the equation becomes:", "[\n(y_1 + 1) + (y_2 + 1) + (y_3 + 1) + (y_4 + 1) = 14 \Rightarrow y_1 + y_2 + y_3 + y_4 = 10\n]", "Now, ( 0 \leq y_i \leq 5 ). We need non-negative integer solutions to:", "[\ny_1 + y_2 + y_3 + y_4 = 10 \quad \ ext{where } 0 \leq y_i \leq 5\n]", "---", "### Step 2: Use Inclusion-Exclusion to Count Valid Solutions", "Without the upper bound, the number of non-negative integer solutions to ( \sum y_i = 10 ) is classical:", "[\n\binom{10 + 4 - 1}{4 - 1} = \binom{13}{3} = 286\n]", "But we must subtract solutions where one or more ( y_i > 5 ), since ( y_i \leq 5 ).", "Let ( A_i ) be the set of solutions where ( y_i \geq 6 ). We apply inclusion-exclusion.", "#### Count ( |A_i| ): ( y_i \geq 6 )", "Set ( z_i = y_i - 6 \geq 0 ), so the equation becomes:", "[\nz_i + y_1 + \cdots + \widehat{y_i} + \cdots + y_4 = 10 - 6 = 4\n]", "Number of non-negative solutions:", "[\n\binom{4 + 4 - 1}{3} = \binom{7}{3} = 35\n]", "There are ( \binom{4}{1} = 4 ) choices for ( i ), so total from single violations:", "[\n\sum |A_i| = 4 \ imes 35 = 140\n]", "#### Count ( |A_i \cap A_j| ): Two variables ( \geq 6 )", "Set ( z_i = y_i - 6, , z_j = y_j - 6 \geq 0 ). Then sum becomes:", "[\nz_i + z_j + \ ext{(others)} = 10 - 12 = -2 \Rightarrow \ ext{no solutions}\n]", "Since the deficit ( 12 > 10 ), no solutions satisfy ( y_i \geq 6 ) and ( y_j \geq 6 ) simultaneously.", "So, all intersections of two or more sets are empty.", "---", "### Final Count via Inclusion-Exclusion", "[\n\ ext{Valid solutions} = \binom{13}{3} - \sum |A_i| = 286 - 140 = 146\n]", "Thus, there are 146 integer quadruples ((x_1, x_2, x_3, x_4)) such that each lies between 1 and 6, and their sum is 14.", "---", "### Step 3: Understanding the Distribution of Solutions", "Each solution corresponds to a way to distribute 10 units across 4 variables, each receiving between 0 and 5.", "To gain intuition, consider symmetry: since the variables are symmetric and bounded uniformly, the solutions are evenly distributed around the average value.", "Average: ( 10 / 4 = 2.5 ), so most quadruples have values clustered near 2 or 3.", "However, since individual variables can go up to 6, some clusters allow higher values—e.g., one variable at 6 forces others to sum to 4 (e.g., 6,3,1,0 → adjusted to valid), while others avoid extremes.", "---", "### Applications and Relevance", "This type of bounded integer equation modeling appears in:", "- Combinatorial optimization: resource allocation with fixed total\n- Probability and statistics: discrete distributions with support bounds\n- Game theory: assigning bounded rewards or capacities\n- Algorithm design: counting feasible states in dynamic programming", "Understanding the structure enables efficient computation via generating functions or dynamic programming for larger systems.", "---", "### Generating Function Approach (Optional Extension)", "The generating function for each ( x_i \in [1,6] ) is:", "[\nf(x) = x + x^2 + x^3 + x^4 + x^5 + x^6 = x \frac{1 - x^6}{1 - x}\n]", "We seek the coefficient of ( x^{14} ) in ( f(x)^4 = x^4 (1 - x^6)^4 (1 - x)^{-4} )", "[\n= x^4 (1 - 4x^6 + 6x^{12} - 4x^{18} + x^{24}) \sum_{k \geq 0} \binom{k+3}{3} x^k\n]", "We want coefficient of ( x^{14} ):", "- From ( x^4 \cdot \binom{10+3}{3} = \binom{13}{3} = 286 )\n- Subtract ( 4 \binom{4+3}{3} = 4 \binom{7}{3} = 4 \ imes 35 = 140 )\n- Higher powers (( x^{18}, x^{24} )) contribute 0 at ( x^{14} )", "So coefficient is again ( 286 - 140 = 146 )", "---", "### Conclusion", "The equation ( x_1 + x_2 + x_3 + x_4 = 14 ) with ( 1 \leq x_i \leq 6 ) admits exactly 146 integer solutions. By transforming variables and applying inclusion-exclusion, we precisely counted feasible combinations. This foundational combinatorial problem illustrates how bounded constraints shape solution spaces, with broad applications in science and engineering.", "---", "Keywords: integer solutions, bounded variables, linear Diophantine equations, inclusion-exclusion, combinatorics, resource allocation, generating functions, recurrence relations.", "Meta Description: Discover how many integer quadruples ((x_1, x_2, x_3, x_4)) satisfy (x_1 + x_2 + x_3 + x_4 = 14) with (1 \leq x_i \leq 6). Learn the transformation, counting method, and real-world relevance.", "---", "See also:\n- Bounded integer compositions\n- Integer partition with limits\n- Application of generating functions in combinatorics\n- Dynamic programming for bounded sums", "---", "Explore more advanced counting techniques and applications at Combinatorics Resource Hub."]