[Ihsan Kehribar] points out a clever trick you can use to quickly and efficiently compute the logarithm of a 32-bit integer. The technique relies on the CLZ instruction which counts the number of ...
Salem and Zygmund obtained an upper bound for a tail law of the iterated logarithm for sums of the form $\sum\limits{_{k=N} ^{\infty }} \ a_{k} \ cos (n_{k}x) + b_{x} \ sin(n_{k}x)$ , where n k ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback