Difference between revisions of "2006 JBMO Problems/Problem 1"
| Line 11: | Line 11: | ||
Let us define set <math>S = \{1, 2, 3 ... n-1\}</math> | Let us define set <math>S = \{1, 2, 3 ... n-1\}</math> | ||
| + | |||
| + | <math>Case 1: q > p</math> | ||
First let's note that <math>p, q \in S</math> | First let's note that <math>p, q \in S</math> | ||
| − | |||
| − | |||
| − | |||
Now, all multiples of <math>p</math> from <math>p.1</math> to <math>p.(q-1) \in S</math> | Now, all multiples of <math>p</math> from <math>p.1</math> to <math>p.(q-1) \in S</math> | ||
Revision as of 22:10, 26 December 2018
Problem
If
is a composite number, then
divides
.
Solution
We shall prove a more stronger result that
divides
for any composite number
which will cover the case of problem statement.
Let
where
.
Let us define set
First let's note that
Now, all multiples of
from
to
Since
we have that
Also, since
we have that
So, we have that
,
in other words,
divides
Now, all multiples of
from
to
Since
we have that
Also, since
so we have that
So, we have that
,
in other words,
divides
Thus
divides
.