Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics and probability resit / 2 / c / i

Table of contents
- Solution i

Solution

True. For every integer

n \geq 1

,

n^{2} \leq n^{3}

and

1 \leq n^{3}

. Therefore

0 \leq n^{3} + 1000 n^{2} + 96 \leq 1097 n^{3} .

C = 1097

and

N = 1

satisfy the definition of Big O notation. Whether the chosen convention for natural numbers includes zero is immaterial to this eventual assertion.

 Ancestors (12)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version