Difference between revisions of "2006 JBMO Problems/Problem 1"
(Created page with "==Problem== If <math>n>4</math> is a composite number, then <math>2n</math> divides <math>(n-1)!</math>. == Solution == We shall prove a more stronger result that <math>4n...") |
|||
| Line 6: | Line 6: | ||
== Solution == | == Solution == | ||
| − | We shall prove a more stronger result that <math>4n</math> divides <math>(n-1)!</math> which will cover the case of | + | We shall prove a more stronger result that <math>4n</math> divides <math>(n-1)!</math> which will cover the case of problem statement. |
Let <math>n = p.q</math> where <math>q \ge p \ge 2</math>. | Let <math>n = p.q</math> where <math>q \ge p \ge 2</math>. | ||
Revision as of 22:02, 26 December 2018
Problem
If
is a composite number, then
divides
.
Solution
We shall prove a more stronger result that
divides
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
.