Answer:
For values when n<32 use fb(n) else use fa(n).
See explaination for details
Explanation:
Earlier when n=1 fa(n)=2000 while fb(n)=2. for n=2 fa(n)=2000*22 =2000*4=8000 while fb(n)=2*24=2*16=32. It is observed that fa(n) requires more time than fb(n) for small values.
Now, we will see when fb(n) crosses fa(n). This can happen only when fb(n) values equals or greater than fa(n)
therefore,
2000n2<=2n4
Solving equation we get n2>=1000 which can happen when n>=32.
So for values when n<32 use fb(n) else use fa(n)
Answer:
there are 2 landscape and portrait
Explanation:
there are just 2 you can confirm using word and layout
Answer:
? is this you question true or false because i dont know the answer yet
Explanation:
Answer:
Answer explained
Explanation:
From the previous question we know that while searching for n^(1/r) we don't have to look for guesses less than 0 and greater than n. Because for less than 0 it will be an imaginary number and for rth root of a non negative number can never be greater than itself. Hence lowEnough = 0 and tooHigh = n.
we need to find 5th root of 47226. The computation of root is costlier than computing power of a number. Therefore, we will look for a number whose 5th power is 47226. lowEnough = 0 and tooHigh = 47226 + 1. Question that should be asked on each step would be "Is 5th power of number < 47227?" we will stop when we find a number whose 5th power is 47226.
Answer: The Answer is C
Explanation: This is because It is mainly controlled by genetics and we can not manipulate genetics.
