↳
1001 integer between 1000*lg2+1000*lg5 and 1000*lg2+1000*lg5 + 2 so the answer is 1000+1 Less
↳
The answer is 1001, but to prove it you need to note that 1000log2 is not an integer Less
↳
int(1000*lg2)+1 + int(1000*lg5)+1 = 1001
↳
basic probability, independent event
↳
There is no stopping time? Usually this type of math question has a stopping time like "the game stops if you roll a 6". Less
↳
If y = x x and x > 0 then ln y = ln (x x) Use properties of logarithmic functions to expand the right side of the above equation as follows. ln y = x ln x We now differentiate both sides with respect to x, using chain rule on the left side and the product rule on the right. y '(1 / y) = ln x + x(1 / x) = ln x + 1 , where y ' = dy/dx Multiply both sides by y y ' = (ln x + 1)y Substitute y by x x to obtain y ' = (ln x + 1)x x Less
↳
sorry, i copy pasted this, the x x is is really a x^x. Essentially this is just a logarithmic differential exercise, exploiting the fact that d/dx ln f(x) = f'(x) / f(x) so that f'(x) = d/dx ln(f(x)) * f(x) Less
↳
Have a think about it, reading the answer here isn't going to help you. Try starting from a smaller number of chips. Less
↳
Start second, always pick differently from opponent
↳
I looked at the permutations of the array of switch actions
↳
matrix mult
↳
Passed 2 questions
↳
Consider for each exercise date the effective rate over the tenor of the swaption taking into account the prevailing rate up to the exercise date and the strike rate. Would it be advantageous to wait or exercise? Less
↳
I just used my admittedly quite basic Haskell knowledge to get it working. They said they were hiring for all levels but apparently it was not enough. Less