Recent content by Aaron Buckley
-
Undergrad Help understanding Big O notation
So, To get to 2x3, do we first ignore 5log x because x3 has a higher exponent? Then x3 < 2x3? Further do we ignore the +1 in the denominator because x4 is a higher power? But since we already have an inequality by altering the numerator we do not need to create the coefficient of 2 for the...- Aaron Buckley
- Post #22
- Forum: Set Theory, Logic, Probability, Statistics
-
Undergrad Help understanding Big O notation
Ok. So this is definitely helping me understand this better. I went ahead and answered the next few problems as follows: b) If then the least integer n is 5 Because 3x5 is greater than (log x)4 c) If then the least integer n = 0 Because dividing the two terms gives you 1+ ((x2)/(x4+1))...- Aaron Buckley
- Post #20
- Forum: Set Theory, Logic, Probability, Statistics
-
Undergrad Help understanding Big O notation
I have just seen other sources immediately jump to solving C and k when I look up guides on solving these problems so I have been under the impression this entire time that those were important parts of solving for n. So is there any significance to doing this step? Or does adding the...- Aaron Buckley
- Post #18
- Forum: Set Theory, Logic, Probability, Statistics
-
Undergrad Help understanding Big O notation
So, we can solve these specific questions without using C and k? Also, which two terms did 3 cover and in what way did it cover them? So we chose x3log x instead of 2x2 because it had the highest visible exponent correct? So if the 2x2 would have been 2x5 we would have gone with that instead...- Aaron Buckley
- Post #14
- Forum: Set Theory, Logic, Probability, Statistics
-
Undergrad Help understanding Big O notation
And now these have me lost. So i understand that ∈ is element. So ƒ∈O(xn) means the function is an element of O right? So it is asking which number is the smallest value of n that allows that function to be a element of that group? To do this you say we need to prove that 1 minus the number...- Aaron Buckley
- Post #11
- Forum: Set Theory, Logic, Probability, Statistics
-
Undergrad Help understanding Big O notation
I am currently studying computer sciences and want to do software development, so I am thinking I will probably be more in the first scenario because it mentions algorithms. So was C only 3 because that's what I thought the upper boundary would be? I understand that 100 would be too large...- Aaron Buckley
- Post #9
- Forum: Set Theory, Logic, Probability, Statistics
-
Undergrad Help understanding Big O notation
So do we just choose any number for C? Also, I still don't know how C and k are used to solve these. What do they represent? Because my answers so far are looking for the exponent n. Secondly, is n just going to be the highest exponent in the problem once log's are solved? Also where did the 3...- Aaron Buckley
- Post #5
- Forum: Set Theory, Logic, Probability, Statistics
-
Undergrad Help understanding Big O notation
I haven't seen anything mention upper bounds yet so I am not sure... Isn't the upper bound the highest exponent in terms of other mathematics? If that is the case the upper bound here would be 3 because x3?For reference this is a link to the website that made the most sense to me, but I still...- Aaron Buckley
- Post #3
- Forum: Set Theory, Logic, Probability, Statistics
-
Undergrad Help understanding Big O notation
First, I don't know if this is the right place so if not, please direct me. Thank you. As for the question, I am in a discrete mathematics class online. The instructor is practically non-existent when asking for help simply saying to "refer to the book for clarification". I have scoured google...- Aaron Buckley
- Thread
- Discrete mathematics Notation
- Replies: 23
- Forum: Set Theory, Logic, Probability, Statistics