Skip to content
Theorem

is divisible by when is odd

Algebra • Divisibility and Remainders

Formula

, odd
For integers and odd natural : , which is divisible by .

How to use it

  1. 1Why it works: when is odd, , so a sum of odd powers is really a difference of powers.
  2. 2Check the power is odd first. For even this fails: is not divisible by .

Worked example

Show that is divisible by .

Step-by-step

  1. 1
    The power is odd, so is divisible by
  2. 2
    Check:

Answer

is divisible by .

Watch out

Only for odd . For even , need not be divisible by .

Builds on

Also known as

a^n + b^n divisible by a + b, sum of odd powers, x + y divides x^n + y^n for odd n

Appears in past papers

2018 (I)