title: Discrete Math Big O Notation
body: <p>I'm studying for my discrete math class and I'm starting to grasp the idea of big O notations a little better and was successful in proofing a few question using the definition of f(x) is O(g(x)).</p>
  
  <p>How do I proof that question is not big O using the definition. Please provide step by step answer as you would on a test to receive full marks and please explain why you did each step in simple terms!</p>
  
  <p>Here are 2 example questions: </p>
  
  <p>1) 1 is not big O(1/x)</p>
  
  <p>2) e^x is not O(x^5) Big O</p>