5**Question:** What is the largest integer that must divide the product of any three consecutive integers?

["Title: The Largest Integer That Must Divide the Product of Any Three Consecutive Integers", "When exploring patterns in number theory, one fascinating question arises: What is the largest integer that must divide the product of any three consecutive integers? This inquiry not only reveals deep mathematical properties but also highlights how structure in integers leads to consistent divisibility.", "In this article, we’ll explore three consecutive integers ( n, n+1, n+2 ), examine their product ( n(n+1)(n+2) ), and uncover why 6 is the largest guaranteed divisor for any such product.", "---", "### The Nature of Three Consecutive Integers", "Three consecutive integers are always defined as:", "- An integer ( n )\n- The next integer ( n+1 )\n- The following integer ( n+2 )", "These numbers span a space where at least one is even and exactly one is divisible by 3. Because of this natural ordering, their product always satisfies strong divisibility rules.", "---", "### Why 2 Is Always a Factor", "Among any three consecutive integers, at least one must be even. Why?\nThe sequence alternates between odd and even:\n- If ( n ) is even → ( n ) is divisible by 2\n- If ( n ) is odd → ( n+1 ) is even", "Thus, two of the three numbers are even? Wait — not quite. Actually, in any three consecutive numbers, one or two will be even depending on start, but at least one is divisible by 2.", "So the product ( n(n+1)(n+2) ) is always divisible by 2.", "---", "### Why 3 Is Also a Guaranteed Factor", "Among any three consecutive integers, one must be divisible by 3. This follows from modular arithmetic:", "Check all residues modulo 3:", "- If ( n \equiv 0 \pmod{3} ): ( n ) divisible by 3\n- If ( n \equiv 1 \pmod{3} ): then ( n+2 \equiv 0 \pmod{3} )\n- If ( n \equiv 2 \pmod{3} ): then ( n+1 \equiv 0 \pmod{3} )", "Hence, regardless of ( n ), one of ( n, n+1, n+2 ) is divisible by 3, ensuring the product is divisible by 3.", "---", "### Why 6 Is the Largest Certain Divisor", "Since the product is divisible by both 2 and 3, and these are distinct primes, their product 6 divides the result.", "Now, is 6 the largest such integer guaranteed for every product of three consecutive integers?", "Let’s test a concrete example:", "Take ( n = 1 ):\n( 1 \ imes 2 \ imes 3 = 6 ) → divisible by 6, but only by 6 (since ( 6/6 = 1 )), no higher multiple.", "Try ( n = 2 ):\n( 2 \ imes 3 \ imes 4 = 24 ), which is divisible by 6, 12, 24 — but 24 is not always divisible by 12 or higher, since for ( n = 1 ), the product is only 6.", "Try ( n = 3 ):\n( 3 \ imes 4 \ imes 5 = 60 ), divisible by 6, but not by 12 (60 ÷ 12 = 5, okay), but 12 divides 60, but is 12 a divisor of every such product?", "Try ( n = 4 ):\n( 4 \ imes 5 \ imes 6 = 120 ), divisible by 12, but 24? 120 ÷ 24 = 5, okay.", "But on the earlier case ( n = 1 ), the product is exactly 6, so no larger fixed divisor (like 12, 18, or 6×2=12) divides all such products.", "Thus, 6 is the largest integer that divides the product of any three consecutive integers.", "---", "### The Proof via GCD of Consecutive Triples", "To solidify this, consider computing the GCD (greatest common divisor) of all such products:", "For ( n = 1 ): 6\nFor ( n = 2 ): 24\nFor ( n = 3 ): 60\nFor ( n = 4 ): 120\nFor ( n = 5 ): 210\nFor ( n = 6 ): 336", "Compute ( \gcd(6, 24, 60, 120, 210, 336) ):\n- ( \gcd(6, 24) = 6 )\n- ( \gcd(6, 60) = 6 )\n- ( \gcd(6, 120) = 6 )\n- Continuing, the GCD remains 6", "This confirms that 6 is invariant across all such triples — no larger number divides every case.", "---", "### Conclusion: A Universal Factor in Integers", "The product of any three consecutive integers is always divisible by 6, and this is the largest integer with that property. This fact stems from the inherent structure of consecutive integers and the distribution of small primes across modular classes.", "So next time you encounter three consecutive numbers — whether in math class, coding, or real-world logic — remember: they hold a simple yet powerful mathematical secret — always divisible by 6, and no bigger guaranteed factor exists.", "---", "Keywords: largest integer dividing product of three consecutive integers, product of consecutive integers divisibility, 6 as guaranteed divisor, math fact, number theory, consecutive integers properties\nMeta Description: Discover why 6 is the largest integer that divides the product of any three consecutive integers. Explore number theory principles, modular arithmetic reasoning, and why 6 is the universal guaranteed divisor."]