Logo
Published on

Consecutive Divisibility Is Impossible

Authors
  • avatar
    Name
    Vu Hung
    Twitter

Problem Statement

Prove that for positive integers a,ba, b with a>1a > 1, either bb is not divisible by aa or b+1b + 1 is not divisible by aa (or both).


Hints

Use proof by contradiction. Assume both aba|b and a(b+1)a|(b+1). What does this tell you about a[(b+1)b]a|[(b+1) - b]? What can you conclude about aa?


Solutions

Proof by Contradiction:

The statement is equivalent to: "It is not the case that both aba|b and a(b+1)a|(b+1)."

Assume, for contradiction, that both aba|b and a(b+1)a|(b+1).

Then there exist integers k1k_1 and k2k_2 such that:

b=ak1b+1=ak2\begin{aligned} b &= ak_1 \\ b + 1 &= ak_2 \end{aligned}

Subtracting the first equation from the second:

(b+1)b=ak2ak1(b+1) - b = ak_2 - ak_1 1=a(k2k1)1 = a(k_2 - k_1)

Let K=k2k1ZK = k_2 - k_1 \in \mathbb{Z}. Then 1=aK1 = aK, which means aa divides 11.

Since aa is a positive integer, the only positive divisor of 11 is 11 itself. Therefore, a=1a = 1.

This contradicts the given condition that a>1a > 1.

Hence, our assumption must be false, and at least one of bb or b+1b+1 is not divisible by aa. \blacksquare


Takeaways

  • Reconstruct the full proof from the hint and the solution outline, and justify every transformation explicitly.
  • Check edge cases and verify where each assumption is used in the argument.

Further Readings

If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills:


Connect with me

If you're eager for more HSC Maths insights, be sure to check out my LinkedIn. For deeper dives and regular tips, join my Instagram. Let's tackle these challenging math problems together! You can also catch my daily math content on YouTube - HSC Maths Extension 1+2.