nkint
Reputation
615
Top tag
Next privilege 1,000 Rep.
Create tags
 Mar6 comment How can I prove the formula for calculating successive entries in a given row of Pascal's triangle? good tricky and mnemonic way! Mar6 accepted How can I prove the formula for calculating successive entries in a given row of Pascal's triangle? Mar4 comment How can I prove the formula for calculating successive entries in a given row of Pascal's triangle? @Arturo: thanks for editing, english is not my main language! Mar4 comment How can I prove the formula for calculating successive entries in a given row of Pascal's triangle? i didn't know exactly what are best tags for this post Mar4 asked How can I prove the formula for calculating successive entries in a given row of Pascal's triangle? Feb9 accepted how many bits to write $\sqrt x$? Feb7 awarded Critic Feb7 awarded Teacher Feb7 answered how many bits to write $\sqrt x$? Feb7 comment how many bits to write $\sqrt x$? ohu yeah ross, i've got the point and i was writing last comment while you get me the solutions! thanks to all! Feb7 comment how many bits to write $\sqrt x$? mhmmm one moment.. no! $\sqrt x$ is long..$\sqrt x$! so the formula is $log_2 \sqrt x$ = $\frac{log x}{2}$ Feb7 comment how many bits to write $\sqrt x$? @Yuval: "how big can $\sqrt x$ be" is the point :-) sure more less that $\frac{x}{2}$.. i can't see a link with exponential.. the problem is that i don't manage to solve $log^{\frac{1}{2}}x$. Feb7 awarded Editor Feb7 revised how many bits to write $\sqrt x$? added 27 characters in body Feb7 asked how many bits to write $\sqrt x$? Feb7 accepted clarification on Chernoff's inequality Feb7 comment clarification on Chernoff's inequality thanks for your response, but i'm quite new in probability.. could you be a little more verbous? Feb5 asked clarification on Chernoff's inequality Feb3 awarded Commentator Feb3 comment RSA in plain English @yuval, you mistook me for a native speaker?? ohu, this is a compliment! ; )