 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2019/discrete-mathematics-continuous-mathematics-and-probability/3/d/ii/solution

True. For every

n \geq 4

2 \leq n

, and raising both nonnegative sides to the

n

th power gives

2^{n} \leq n^{n /2} .

Thus the Big O notation condition holds with constant

C = 1

and threshold

n_{0} = 4

 New to topics? Read the docs here!