Difference between revisions of "2008 iTest Problems/Problem 39"
(→Proof) |
(→Problem) |
||
(5 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | Let <math>\phi(n)</math> denote <math>\textit{Euler's phi function}</math>, the number of integers <math>1\leq i\leq n</math> that are relatively prime | + | Let <math>\phi(n)</math> denote <math>\textit{Euler's phi function}</math>, the number of integers <math>1\leq i\leq n</math> that are relatively prime with <math>n</math>. (For example, <math>\phi(6)=2</math> and <math>\phi(10)=4</math>.) |
− | Let <math>S=\sum_{d|2008}\phi(d)</math>, | + | Let <math>S=\sum_{d|2008}\phi(d)</math>, where <math>d</math> ranges through all positive divisors of <math>2008</math>, including <math>1</math> and <math>2008</math>. Find the remainder when <math>S</math> is divided by <math>1000</math>. |
==Solution== | ==Solution== | ||
Line 12: | Line 12: | ||
==Extra Note== | ==Extra Note== | ||
If all the divisors of an integer n are {<math>{d_1}</math>, <math>{d_2}</math>, <math>{d_3}</math>, ... <math>{d_k}</math>}, then n = <math>\phi({d_1})</math> + <math>\phi({d_2})</math> + .... + <math>\phi({d_k})</math>. | If all the divisors of an integer n are {<math>{d_1}</math>, <math>{d_2}</math>, <math>{d_3}</math>, ... <math>{d_k}</math>}, then n = <math>\phi({d_1})</math> + <math>\phi({d_2})</math> + .... + <math>\phi({d_k})</math>. | ||
− | This provides a shorter approach in this problem because it asks about the sum of the number of numbers co prime to 2008's divisors, as mentioned earlier. This is | + | This provides a shorter approach in this problem because it asks about the sum of the number of numbers co prime to 2008's divisors, as mentioned earlier. This is 2008 itself. |
==Proof== | ==Proof== | ||
− | + | Let <math>n</math> = <math>{p_1}^{\alpha_1}</math><math>{p_2}^{\alpha_2}</math>....<math>{p_k}^{\alpha_k}</math> where <math>{p_1}, {p_2}, ... {p_k}</math> are prime numbers | |
and | and | ||
− | <math>{d_1}</math>, <math>{d_2}</math>, .... <math>{d_m}</math> | + | {<math>{d_1}</math>, <math>{d_2}</math>, .... <math>{d_m}</math>} is an exhaustive, mutually exclusive list of <math>n</math>'s factors |
<math>\phi({d_1})</math> + <math>\phi({d_2})</math> + ... + <math>\phi({d_m})</math> | <math>\phi({d_1})</math> + <math>\phi({d_2})</math> + ... + <math>\phi({d_m})</math> | ||
Line 32: | Line 32: | ||
= <math>(1 + (1 - \frac{1}{p_1})</math><math>({p_1} + {p_1}^{2} + ... + {p_1}^{\alpha_1})</math>)<math>(1 + (1 - \frac{1}{p_2})</math><math>({p_2} + {p_2}^{2} + ... + {p_2}^{\alpha_2})</math>) ... <math>(1 + (1 - \frac{1}{p_k})</math><math>({p_k} + {p_k}^{2} + ... + {p_k}^{\alpha_k})</math> | = <math>(1 + (1 - \frac{1}{p_1})</math><math>({p_1} + {p_1}^{2} + ... + {p_1}^{\alpha_1})</math>)<math>(1 + (1 - \frac{1}{p_2})</math><math>({p_2} + {p_2}^{2} + ... + {p_2}^{\alpha_2})</math>) ... <math>(1 + (1 - \frac{1}{p_k})</math><math>({p_k} + {p_k}^{2} + ... + {p_k}^{\alpha_k})</math> | ||
− | = <math>(1 + {p_1} + {p_1}^{2} + ... + {p_1}^{\alpha_1} - (1 + {p_1} + {p_1}^{2} + ... + {p_1}^{\alpha_1 - 1}))</math> | + | = <math>(1 + {p_1} + {p_1}^{2} + ... + {p_1}^{\alpha_1} - (1 + {p_1} + {p_1}^{2} + ... + {p_1}^{\alpha_1 - 1}))</math> x |
− | <math>(1 + {p_2} + {p_2}^{2} + ... + {p_2}^{\alpha_2} - (1 + {p_2} + {p_2}^{2} + ... + {p_2}^{\alpha_2 - 1}))</math> | + | <math>(1 + {p_2} + {p_2}^{2} + ... + {p_2}^{\alpha_2} - (1 + {p_2} + {p_2}^{2} + ... + {p_2}^{\alpha_2 - 1}))</math> x ... |
<math>(1 + {p_k} + {p_k}^{2} + ... + {p_k}^{\alpha_k} - (1 + {p_k} + {p_k}^{2} + ... + {p_k}^{\alpha_k - 1}))</math> | <math>(1 + {p_k} + {p_k}^{2} + ... + {p_k}^{\alpha_k} - (1 + {p_k} + {p_k}^{2} + ... + {p_k}^{\alpha_k - 1}))</math> | ||
Line 41: | Line 41: | ||
= <math>n</math> | = <math>n</math> | ||
− | |||
− | |||
==See Also== | ==See Also== |
Latest revision as of 19:49, 22 August 2023
Contents
Problem
Let denote
, the number of integers
that are relatively prime with
. (For example,
and
.)
Let
, where
ranges through all positive divisors of
, including
and
. Find the remainder when
is divided by
.
Solution
The divisors of are
,
,
,
,
,
,
, and
, so the problem requires the sum of the number of numbers relatively prime to each of the eight numbers.
Using the formula (or by manually counting the numbers relatively prime to each number),
number is relatively prime to
,
number is relatively prime to
,
numbers are relatively prime to
,
numbers are relatively prime to
,
numbers are relatively prime to
,
numbers are relatively prime to
,
numbers are relatively prime to
, and
numbers are relatively prime to
. That means
, and the remainder when
is divided by
is
.
Extra Note
If all the divisors of an integer n are {,
,
, ...
}, then n =
+
+ .... +
.
This provides a shorter approach in this problem because it asks about the sum of the number of numbers co prime to 2008's divisors, as mentioned earlier. This is 2008 itself.
Proof
Let =
....
where
are prime numbers
and
{,
, ....
} is an exhaustive, mutually exclusive list of
's factors
+
+ ... +
= +
+
...
The above term represents the sum of all the values of the the totient function applied of all of n's divisors, like the problem is asking.
=
+ ....
= )
) ...
= x
x ...
= ...
=
See Also
2008 iTest (Problems) | ||
Preceded by: Problem 38 |
Followed by: Problem 40 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 • 40 • 41 • 42 • 43 • 44 • 45 • 46 • 47 • 48 • 49 • 50 • 51 • 52 • 53 • 54 • 55 • 56 • 57 • 58 • 59 • 60 • 61 • 62 • 63 • 64 • 65 • 66 • 67 • 68 • 69 • 70 • 71 • 72 • 73 • 74 • 75 • 76 • 77 • 78 • 79 • 80 • 81 • 82 • 83 • 84 • 85 • 86 • 87 • 88 • 89 • 90 • 91 • 92 • 93 • 94 • 95 • 96 • 97 • 98 • 99 • 100 |