Difference between revisions of "2022 AMC 12A Problems/Problem 23"
m |
MRENTHUSIASM (talk | contribs) |
||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | Let <math>h_n</math> and <math>k_n</math> be the unique relatively prime positive integers such that | + | Let <math>h_n</math> and <math>k_n</math> be the unique relatively prime positive integers such that <cmath>\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{n}=\frac{h_n}{k_n}.</cmath> Let <math>L_n</math> denote the least common multiple of the numbers <math>1, 2, 3, \ldots, n</math>. For how many integers with <math>1\le{n}\le{22}</math> is <math>k_n<L_n</math>? |
− | < | + | <math>\textbf{(A) }0 \qquad\textbf{(B) }3 \qquad\textbf{(C) }7 \qquad\textbf{(D) }8\qquad\textbf{(E) }10</math> |
− | \ | ||
− | </ | ||
− | + | ==Solution 1== | |
+ | AIMING FOR A COMPREHENSIVE WRITTEN SOLUTION. | ||
− | ==Solution== | + | ==Solution 2== |
We will use the following lemma to solve this problem. | We will use the following lemma to solve this problem. |
Revision as of 17:46, 3 January 2023
Problem
Let and be the unique relatively prime positive integers such that Let denote the least common multiple of the numbers . For how many integers with is ?
Solution 1
AIMING FOR A COMPREHENSIVE WRITTEN SOLUTION.
Solution 2
We will use the following lemma to solve this problem.
Denote by the prime factorization of . For any , denote , where and are relatively prime. Then if and only if for any , is not a multiple of .
Now, we use the result above to solve this problem.
Following from this lemma, the list of with and is
Therefore, the answer is .
(particularly the motivation and the proof of the lemma above)
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Video Solution
~MathProblemSolvingSkills.com
See Also
2022 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 22 |
Followed by Problem 24 |
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 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.