Divisibility Deep Dive: Proving 11n² - 7 is Always a Multiple of 4

Hey there, Rogue Mathematician. No matter where you are on your journey—whether you’re mastering fractions with Math-U-See, tackling complex geometry with Saxon, or aiming for the next level on the AMC track—I remember where you started. Remember that feeling when the concept finally just clicks? That's the feeling we're chasing today.

Today, we are tackling a classic problem in number theory: proving that for every odd integer $n$, the expression $11n^2 - 7$ is always divisible by 4. This isn't just a dry exercise; it's a fundamental building block that shows how powerful structure and definition can be. It’s the kind of proof structure that bridges prealgebra and advanced topics like those found in AoPS or the early stages of Number Theory.

Understanding the Language of Proof

Before we dive into the algebra, let’s pause and define our terms. What does it mean for a number to be “divisible by 4”? As the video explains, it means that the number is a multiple of 4. Mathematically, if $A$ is divisible by $B$, we can write $A = 4k$ for some integer $k$. Our goal is to show that $11n^2 - 7$ *must* equal $4$ times some integer, no matter what odd integer $n$ we choose.

The Algebraic Walkthrough

The key to this proof lies in utilizing the definition of an odd integer. Since $n$ must be odd, we know we can write $n$ in the form $2k + 1$, where $k$ is any integer. This substitution is our mathematical superpower! It turns a seemingly abstract problem into a concrete algebraic one.

Let's follow the steps:

1. Substitute: Replace $n$ with $(2k+1)$ in the expression: $11(2k+1)^2 - 7$.
2. Expand: Carefully square the binomial $(2k+1)^2$. Remember the pattern: $(a+b)^2 = a^2 + 2ab + b^2$. This gives us $4k^2 + 4k + 1$.
3. Distribute: Multiply the 11 across the entire expanded term: $11(4k^2 + 4k + 1) - 7$.

   This gives us $44k^2 + 44k + 11 - 7$.

4. Simplify and Factor: Combine the constant terms (11 - 7 = 4). Now, look closely at the resulting expression: $44k^2 + 44k + 4$. Do you see it? Every term has a common factor of 4. We factor it out: $4(11k^2 + 11k + 1)$.

Since $k$ is an integer, the expression $(11k^2 + 11k + 1)$ must also be an integer. Therefore, $11n^2 - 7$ is 4 times an integer, proving it is divisible by 4. The proof is complete!

Beyond the Steps: Why Does This Matter?

The real magic in math isn't just knowing the answer; it's knowing why the answer must be true. When you look at this proof, you are practicing meta-mathematics—the study of math itself. You are learning how to build rigorous arguments. This ability to structure a proof, whether it's using modular arithmetic, induction, or substitution, is what separates a good student from a true mathematician.

The most important thing you can take away from this video is not the final answer, but the structure. Start by defining your terms (what does 'odd' mean? what does 'divisible by 4' mean?). Then, use that definition to transform the problem into an algebraic expression you can manipulate. This methodical approach is critical for success in advanced courses, whether you're studying Abstract Algebra or prepping for the AIME.

If this proof felt like a stretch, remember that math will click when it’s taught your kid's way. If you're ready to challenge yourself, look at the next level of difficulty. If you feel confident with this structure, you might be ready to explore mathematical induction, which is another powerful tool for proving statements about all integers!

Keep up the incredible work! If you're enjoying deep dives like this, consider joining a local Math Circle, or maybe exploring the advanced concepts through one of our specialized courses on Udemy. We are always here to help you advance your skills toward becoming a certified Certified Rogue Mathematician!