Difference between revisions of "2019 AIME I Problems/Problem 14"
(→Note to solution) |
(→Solution 2(basbhbashabsbhbasbasbhasbhsabhasbhbhasbhbash)) |
||
Line 26: | Line 26: | ||
https://youtu.be/IF88iO5keFo | https://youtu.be/IF88iO5keFo | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
==See Also== | ==See Also== | ||
{{AIME box|year=2019|n=I|num-b=13|num-a=15}} | {{AIME box|year=2019|n=I|num-b=13|num-a=15}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 16:32, 17 March 2020
Problem 14
Find the least odd prime factor of .
Solution
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
is called the Euler Totient Function of integer . Euler's Totient Theorem: define 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 .
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.