Problem:
Find the number of pairs (m,n) of positive integers with 1β€m<nβ€30 such that there exists a real number x satisfying
sin(mx)+sin(nx)=2
Solution:
Note that the maximum of sin(mx) is 1 and is achieved when x=m360βk+90ββ for any integer k. If sin(mx)+sin(nx)=2, then there exists a real number x such that sin(mx)=sin(nx)=1. Thus x=m1β(360βk+90β)=n1β(360ββ+90β) for some integers k and β. Hence
m4k+1β=n4β+1β
which is equivalent to (4k+1)β
n=(4β+1)β
m. Because 4k+1 and 4β+1 are odd, the greatest power of 2 dividing m must be equal to the greatest power of 2 dividing n. Let m=2tβ
mβ² and n=2tβ
nβ², where mβ² and nβ² are both odd. Then (4k+1)β
nβ²=(4β+1)β
mβ² and 4β£(mβ²βnβ²).
Conversely, if mβ² and nβ² are odd positive integers satisfying mβ²β‘nβ²(mod4), then there exist positive integers k and β such that the above equation holds:
-
If mβ² and nβ² are congruent to 1 modulo 4, then setting 4k+1=mβ² and 4β+1=nβ² leads to integer values for k and β.
-
If mβ² and nβ² are congruent to 3 modulo 4, then setting 4k+1=3mβ² and 4β+1=3nβ² leads to integer values for k and β.
Therefore the required integers k and β exist if and only if mβ² and nβ² are both odd and 4β£(mβ²βnβ²), which means that either mβ²,nβ²β{1,5,9,β¦,29} or mβ²,nβ²β{3,7,11,β¦,27}. In the first case, m and n are distinct integers from {1,5,9,β¦,29}, from {2,10,18,26}, or from {4,20}. In the second case, m and n are distinct integers from {3,7,11,β¦,27}, from {6,14,22,30}, or from {12,28}. Hence there are
(82β)+(42β)+(22β)+(72β)+(42β)+(22β)=63β
ordered pairs with the required properties.