Browse · MATH
Printjmc
algebra senior
Problem
For let be the function defined as follows: Let Compute the number of points in which the graphs of and intersect.
Solution
Let be an integer, and let Then This portion of the graph is shown below.
Then for so the portion of the graph for repeats:
Note that so is the largest for which the two graphs intersect. Furthermore, for on the interval the graph of intersects the graph of twice on each subinterval of length so the total number of intersection points is
Then for so the portion of the graph for repeats:
Note that so is the largest for which the two graphs intersect. Furthermore, for on the interval the graph of intersects the graph of twice on each subinterval of length so the total number of intersection points is
Final answer
4022030