bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 1 year, 11 months |
seen | Jan 12 '14 at 7:52 | |
stats | profile views | 18 |
Jun 25 |
awarded | Tumbleweed |
May 24 |
awarded | Scholar |
May 24 |
accepted | Updated: finding an integer $k$ that minimizes $1/(N-k) (1+1/k)$ |
May 24 |
comment |
Updated: finding an integer $k$ that minimizes $1/(N-k) (1+1/k)$
Hi Safoura, thanks for your answer. But there is some problem here. Note that I have $k^* = \lceil \sqrt{aN+a^2 + 1/4} - a - 1/2 \rceil$, where $\lceil x \rceil$ is the ceiling function, denotes the smallest integer no less than $x$. While $k^* = [\sqrt{aN+a^2} - a]$, where $[x]$ is the rounding function, the integer closest to $x$. So your proof seems do not apply ... |
May 24 |
awarded | Editor |
May 24 |
asked | Updated: finding an integer $k$ that minimizes $1/(N-k) (1+1/k)$ |