Difference between revisions of "Mock AIME 5 2005-2006 Problems/Problem 4"
m (Created page with "== Problem == == Solution == == See also == {{Mock AIME box|year=2005-2006|n=5|source=76847|num-b=3|num-a=5}} Category:Introductory Algebra Problems") |
(→Solution) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | Let <math>m</math> and <math>n</math> be integers such that <math>1 < m \le 10</math> and <math>m < n \le 100</math>. Given that <math>x = \log_m{n}</math> and <math>y = \log_n{m}</math>, find the number of ordered pairs <math>(m,n)</math> such that <math>\lfloor x \rfloor = \lceil y \rceil</math>. (<math>\lfloor a \rfloor</math> is the greatest integer less than or equal to <math>a</math> and <math>\lceil a \rceil</math> is the least integer greater than or equal to <math>a</math>). | ||
== Solution == | == Solution == | ||
Latest revision as of 19:41, 22 March 2016
Problem
Let 
and 
be integers such that 
and 
. Given that 
and 
, find the number of ordered pairs 
such that 
. (
is the greatest integer less than or equal to 
and 
is the least integer greater than or equal to ).
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 | ||
