Difference between revisions of "2019 AIME I Problems/Problem 14"
(→Solution) |
(→Note to solution 1) |
||
| Line 8: | Line 8: | ||
==Note to solution 1== | ==Note to solution 1== | ||
<math>\phi(p)</math> is called the "Euler Function" of integer <math>p</math>. | <math>\phi(p)</math> is called the "Euler Function" of integer <math>p</math>. | ||
| − | Eular theorem: define <math>\phi(p)</math> as the number of positive integers less than <math>n</math> but relatively prime to <math>n</math>, then we have <cmath>\phi(p)=p\cdot \prod^n_{i=1} | + | Eular theorem: define <math>\phi(p)</math> as the number of positive integers less than <math>n</math> but relatively prime to <math>n</math>, then we have <cmath>\phi(p)=p\cdot \prod^n_{i=1}(1-\frac{1}{p_i})</cmath> where <math>p_1,p_2,...,p_n</math> are the prime factors of <math>p</math>. Then, we have <cmath>a^{\phi(p)} \equiv 1\ (\mathrm{mod}\ p)</cmath> if <math>(a,p)=1</math>. |
==Video Solution== | ==Video Solution== | ||
Revision as of 09:35, 15 March 2019
Problem 14
Find the least odd prime factor of 
.
Solution 1
The problem tells us that 
for some prime 
. We want to find the smallest odd possible value of . By squaring both sides of the congruence, we get 
. This tells us that 
is a multiple of 16. Since we know is prime, 
or 
. Therefore, must be 
. The two smallest primes that are are 
and 
. 
, but 
, so our answer is 
.
Note to solution 1
is called the "Euler Function" of integer .
Eular theorem: define as the number of positive integers less than 
but relatively prime to , then we have ![\[\phi(p)=p\cdot \prod^n_{i=1}(1-\frac{1}{p_i})\]](http://latex.artofproblemsolving.com/3/7/9/3796cf787f69e13b3a5a060bcb1ba7d119e2150a.png)
where 
are the prime factors of . Then, we have ![\[a^{\phi(p)} \equiv 1\ (\mathrm{mod}\ p)\]](http://latex.artofproblemsolving.com/8/f/2/8f21dc4bc9438cd265fd03aadc87e1f0000e3808.png)
if 
.
Video Solution
On The Spot STEM:
See Also
| 2019 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 13 |
Followed by Problem 15 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
