Mock AIME 5 2005-2006 Problems/Problem 4

Revision as of 19:41, 22 March 2016 by Pega969 (talk | contribs) (Solution)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $m$ and $n$ be integers such that $1 < m \le 10$ and $m < n \le 100$. Given that $x = \log_m{n}$ and $y = \log_n{m}$, find the number of ordered pairs $(m,n)$ such that $\lfloor x \rfloor = \lceil y \rceil$. ($\lfloor a \rfloor$ is the greatest integer less than or equal to $a$ and $\lceil a \rceil$ is the least integer greater than or equal to $a$).

Solution

See also

Mock AIME 5 2005-2006 (Problems, Source)
Preceded by
Problem 3
Followed by
Problem 5
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15