Skip to content
Technique

Remainder of when is a multiple

Algebra • Divisibility and Remainders

Statement

contains every whole number from to as a factor. If with and , then divides . Then is one more than a multiple of , so it leaves remainder and is not divisible by (for ).

How to use it

  1. 1Factor the divisor into two different factors, both at most , and point to them among .
  2. 2For a prime divisor no such split exists, and the remainder must be found another way, for small numbers by direct division.

Worked example

Is divisible by ?

Step-by-step

  1. 1
    , and and both appear in .

    Why: Two different factors, each at most .

  2. 2
    So divides , and leaves remainder .

    Why: Adding to a multiple of gives remainder .

Answer

No

Watch out

The two factors must be different numbers. does not divide , because hold only one .

Builds on

Also known as

n! + 1 divisibility, factorial divisible by composite

Appears in past papers

2023 (I)