Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2014/discrete-mathematics-continuous-mathematics-and-probability/3/c/iii/solution

Here are fixed integers. The term has exponential growth, whereas has fixed-degree polynomial growth and is linear. Since a fixed-base exponential eventually dominates every fixed-degree polynomial,
Hence the requested Big O notation bound, with its matching lower order, is .

New to topics? Read the docs here!