standard_description: Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ³ 1.
problem_activity: Task
Below is a picture of the functions $f(x) = \log_b{x}$ and $g(x) = b^x$. In the application below, the base b varies between 1 and 2 (by hundredths) and pressing the "play" button will run through all possible values of b.
For which values of $b$ do the two graphs appear not to meet?
For which values of $b$ do the two graphs appear to meet in two points?
Check by evaluating the functions $f$ and $g$ that the two graphs meet at $x=e$ when $b = e^{\frac{1}{e}}$.


aligns: no