Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2021 AIME I Problems/Problem 7"

(→‎Problem)
(→‎Problem)
Line 1: Line 1:
 
==Problem==
 
==Problem==
 
Find the number of pairs <math>(m,n)</math> of positive integers with <math>1\le m<n\le 30</math> such that there exists a real number <math>x</math> satisfying<cmath>\sin(mx)+\sin(nx)=2.</cmath>
 
Find the number of pairs <math>(m,n)</math> of positive integers with <math>1\le m<n\le 30</math> such that there exists a real number <math>x</math> satisfying<cmath>\sin(mx)+\sin(nx)=2.</cmath>
 +
 +
==Solution==
 +
Since <math>-1\leq\sin(x)\leq1</math>, <math>\sin(mx)+\sin(nx)=2</math> means that each of <math>\sin(mx)</math> and <math>\sin(nx)</math> must be exactly <math>1</math>. Then <math>m</math> and <math>n</math> must be cycles away, or the difference between them must be multiple of <math>4</math>. If <math>m</math> is <math>1</math>, then <math>n</math> can be <math>5,9,13,17,21,25,29</math>. Like this, the table below can be listed:
 +
 +
{| class="wikitable" style="text-align:center;width:100%"
 +
|-
 +
|
 +
! scope="col" | '''Range of <math>m</math>'''
 +
! scope="col" | '''Number of Possibilities'''
 +
|-
 +
! scope="row" | '''Case 1'''
 +
| <math>1 \leq m \leq 2</math>
 +
| <math>7</math>
 +
|-
 +
! scope="row" | '''Case 2'''
 +
| <math>3 \leq m \leq 6</math>
 +
| <math>6</math>
 +
|-
 +
! scope="row" | '''Case 3'''
 +
| <math>7 \leq m \leq 10</math>
 +
| <math>5</math>
 +
|-
 +
! scope="row" | '''Case 4'''
 +
| <math>11 \leq m \leq 14</math>
 +
| <math>4</math>
 +
|-
 +
! scope="row" | '''Case 5'''
 +
| <math>15 \leq m \leq 18</math>
 +
| <math>3</math>
 +
|-
 +
! scope="row" | '''Case 6'''
 +
| <math>19 \leq m \leq 22</math>
 +
| <math>2</math>
 +
|-
 +
! scope="row" | '''Case 7'''
 +
| <math>23 \leq m \leq 26</math>
 +
| <math>1</math>
 +
|-
 +
! scope="row" | '''Case 8'''
 +
| <math>27 \leq m \leq 30</math>
 +
| <math>0</math>
 +
|-
 +
|}
 +
 +
In total, there are <math>\boxed{62}</math> possible solutions.
 +
 +
However the answer is <math>63</math>, where is the last possible solution?
 +
 +
~Interstigation
  
 
==Solution==
 
==Solution==

Revision as of 18:57, 11 March 2021

Problem

Find the number of pairs $(m,n)$ of positive integers with $1\le m<n\le 30$ such that there exists a real number $x$ satisfying\[\sin(mx)+\sin(nx)=2.\]

Solution

Since $-1\leq\sin(x)\leq1$, $\sin(mx)+\sin(nx)=2$ means that each of $\sin(mx)$ and $\sin(nx)$ must be exactly $1$. Then $m$ and $n$ must be cycles away, or the difference between them must be multiple of $4$. If $m$ is $1$, then $n$ can be $5,9,13,17,21,25,29$. Like this, the table below can be listed:

Range of $m$ Number of Possibilities
Case 1 $1 \leq m \leq 2$ $7$
Case 2 $3 \leq m \leq 6$ $6$
Case 3 $7 \leq m \leq 10$ $5$
Case 4 $11 \leq m \leq 14$ $4$
Case 5 $15 \leq m \leq 18$ $3$
Case 6 $19 \leq m \leq 22$ $2$
Case 7 $23 \leq m \leq 26$ $1$
Case 8 $27 \leq m \leq 30$ $0$

In total, there are $\boxed{62}$ possible solutions.

However the answer is $63$, where is the last possible solution?

~Interstigation

Solution

See also

2021 AIME I (Problems • Answer Key • Resources)
Preceded by
Problem 6 		Followed by
Problem 8
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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2021_AIME_I_Problems/Problem_7&oldid=149114"