Recent content by aaa59

I should have been clearer. given "Big-Oh" sets O(1): constant O(log2(n)): logarithmic O(n): linear O(nlog2(n)): n log n O(n^2): quadratic O(n^3): cubic O(n^m), m>1: polynomial of order m O(c^n), c>1: exponential O(n!): factorial Prove Constant is a subset of logarithmic logarithmic is a...

O(1) is constant O(log n to the base 2) is logarithmic O(n) linear how would you prove that constant is a subset of logartihmic?

i think i got it. so: g(1) = 2 and f(2) = 3. therefore h(1)=3. am i right?

if A={1,2,3} f:A-> A = {(1,2),(2,3),(3,1)} g:A->A = {(1,2),(2,1),(3,3)} how would we calculate (f O g)?

thanks

I would say that in 1 minute there is a 90% chance that a customer may arrive, so in 10 minutes the number of customers I would expect is 9.

I have absolutely no idea

The probability of a customer arriving in a bank per minute is 0.9. How many customers will arrive in 10 minutes? Thanks Ashish