Recent content by drago

Hi, I would appreciate some ideas on the following problem: We are given the inequality: (1) |a| + |b| >= 2(|c| + |d|) Can we conclude that: (2) (c + a)^2 + (d + b)^2 >= c^2 + d^2 ? a, b, c, d are real. I can prove (2) if (1) is in the form: |a| + |b| >= 4max(|c|,|d|), but...

Sorry, the example should be like that: for S1: (q1, ..., qn-1) (y0,..., yn-2) //y shifted rigth and compared with the remaining of q ... for Sn-1: (qn-1) (y0) //y after the n-1st shift drago

Yes, they are. That is as if we shift right the y segment one point at a time and compute the sum of the distances between the new segments leaving out the leftmost point of q and rigthmost point of y: for S0 : (q0, q1, ..., qn-1) (y0, y1, ..., yn-1) for S1...

Hi, I would appreciate if you could point me some resources that you have seen and think could be related to the following problem: Given are the values of two polynomials Y(x) and Q(x) in n consecutive points (x0, x1,…, xn-1): (y0, y1,…,yn-1) and (q0, q1,…,qn-1) respectively. We would like...