I'm studying for my discrete math class and I don't fully understand how to proof how a function is not a big O for certain questions. I understand that you have to assume that it is big O and proof by contradiction.
Please explain how you attacked these questions step by step.
1) 1 is not
2) is not
Please explain how you attacked these questions step by step.
1) 1 is not
2) is not