Timeline for How to find a closest integer point to the intersection of two lines?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14, 2016 at 8:20 | comment | added | Don Hatch | "the size of your input is the log of the number of digits needed to specify the two lines" -- i.e. log(log(their magnitudes))? Did you really mean to say that? | |
| Apr 27, 2010 at 21:09 | history | edited | anonymous | CC BY-SA 2.5 |
added 122 characters in body
|
| Apr 27, 2010 at 21:08 | comment | added | P Shved | Sorry, it's most likey my fault that I didn't formulate the question well, but @Reid is correct: we need to find a point in a specific quarter; and of course we assume automatically (since it's MathOverflow) that the quarter is the hardest. | |
| Apr 27, 2010 at 21:05 | comment | added | Reid Barton | It seems that you didn't notice the phrase "in the same quarter [as (x, y)]" in the problem statement... | |
| Apr 27, 2010 at 21:03 | history | answered | anonymous | CC BY-SA 2.5 |