2019 AIME I Problems/Problem 14
Find the least odd prime factor of .
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 .
Since , = or
However, if = or then clearly will be instead of , causing a contradiction.
Therefore, . Because , 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 . Euler theorem: define $\phili(p)$ (Error compiling LaTeX. ! Undefined control sequence.) as the number of positive integers less than but relatively prime to , then we have where are the prime factors of . Then, we have if .
Furthermore, for an integer relatively prime to is defined as the smallest positive integer such that . An important property of the order is that .
On The Spot STEM:
|2019 AIME I (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|