Timeline for Updated: finding an integer $k$ that minimizes $1/(N-k) (1+1/k)$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2013 at 22:51 | vote | accept | user34318 | ||
| May 24, 2013 at 22:24 | comment | added | Gerhard Paseman | Perhaps I am also not seeing things. Why is the answer not k=N+1? Gerhard "Someone Make A Constraint Visible" Paseman, 2013.05.24 | |
| May 24, 2013 at 21:53 | comment | added | Alvin | sorry, my vision betrays me... I have edited the post accordingly to include the case you were asking for. | |
| May 24, 2013 at 21:50 | history | edited | Alvin | CC BY-SA 3.0 |
added 1023 characters in body
|
| May 24, 2013 at 20:41 | comment | added | user34318 | 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, 2013 at 13:56 | history | answered | Alvin | CC BY-SA 3.0 |