Difference between revisions of "2006 JBMO Problems/Problem 1"
Magnetoninja (talk | contribs) (→Solution) |
|||
(2 intermediate revisions by one other user not shown) | |||
Line 12: | Line 12: | ||
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> | ||
− | <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> | ||
Line 42: | Line 42: | ||
<math>Kris17</math> | <math>Kris17</math> | ||
+ | |||
+ | =Solution 2= |
Latest revision as of 00:11, 30 November 2023
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 .