Find the number of distinct ordered pairs of positive integers such that the least common multiple of and is one million.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let the two numbers be x , y . We know that 1 , 0 0 0 , 0 0 0 = 2 6 ⋅ 5 6 . To make the LCM, either of x or y must be 2 6 and the same goes for 5 6 . We can make 3 cases and see as below:
\[\begin{array}{|c|c|} \hline \\ \text{Power of 2 in } x & \text{Power of 2 in } y \\ \hline \\ 6& 5,4,3,2,1,0 \\ \\ 5,4,3,2,1,0&6 \\ \\ 6&6 \\ \hline
\end{array}
\implies \lbrace{\text{13 Options}}
\quad \quad
\begin{array}{|c|c|} \hline \\ \text{Power of 5 in } x & \text{Power of 5 in } y \\ \hline \\ 6& 5,4,3,2,1,0 \\ \\ 5,4,3,2,1,0&6 \\ \\ 6&6 \\ \hline
\end{array}
\implies \lbrace{\text{13 Options}}\]
Since there are 13 options to choose for power of 2, and 13 options to choose for power 5, the total options are 1 3 × 1 3 = 1 6 9
Bonus: For any given (LCM = p 1 a 1 ⋅ p 2 a 2 ⋯ p n a n ), the unique number of pairings = ( 2 a 1 + 1 ) ⋅ ( 2 a 2 + 1 ) ⋯ ⋅ ( 2 a n + 1 )