Skip to main content
12 events
when toggle format what by license comment
S Feb 4, 2018 at 18:33 history bounty ended CommunityBot
S Feb 4, 2018 at 18:33 history notice removed CommunityBot
Jan 28, 2018 at 8:21 history edited Martin Sleziak
added top-level tag; https://meta.mathoverflow.net/questions/1457/why-are-mo-tags-formatted-as-they-are
Jan 27, 2018 at 20:41 comment added Mateusz Kwaśnicki I may have misunderstood the question completely: for any $C^* \ne 0$ the two lines $y = a x + b$ and $y = (a - (1 + |C^*|)(1 + \epsilon) / C^*) x + (b + (1 + |C^*|)(1 + \epsilon))$ intersect at a point with $x$ coordinate equal to $C^*$, and have coefficients that differ by more than $\epsilon$ – does this answer your question?
S Jan 27, 2018 at 16:34 history bounty started AspiringMat
S Jan 27, 2018 at 16:34 history notice added AspiringMat Draw attention
Jan 24, 2018 at 18:14 comment added AspiringMat A slight comment is, over all $x_i$ which don't satisfy $f(x_i)=f(x_1), g(x_i)=g(x_1)$, so that we don't have the exact same line intersecting at an infinite number of points.
Jan 24, 2018 at 18:13 comment added AspiringMat LSpice exactly what you wrote, couldn't have worded it better!
Jan 24, 2018 at 18:01 comment added LSpice You seem to use $x_2$ and $x_i$ with the same meaning. When is $x_1$ fixed? Is it correct that the question is "given $C^*$ and $x_1$, what is the minimum value, over all $f$ and $g$ satisfying the given conditions, of (the minimum distance, over all $x_i$, from $C^*$ to $x_{1 i}$)?"?
Jan 24, 2018 at 17:44 history edited AspiringMat CC BY-SA 3.0
added clarification
Jan 24, 2018 at 17:26 review First posts
Jan 24, 2018 at 17:50
Jan 24, 2018 at 17:24 history asked AspiringMat CC BY-SA 3.0