**Key Points**:

**1900 Hilbert’s 17th Conjecture: Non-negative Polynomial <=> sum of 2 squares (**Proved by Emile Artin in 1927)- Computing Math : approximate by optimisation with “
which are faster to compute.**Linear Programs”** - Princeton Mathematicians applied it to self – driving cars.

https://www.wired.com/story/a-classical-math-problem-gets-pulled-into-self-driving-cars/amp

**Explain****: **

Sum of 2 Squares <=> always non-negative (≥0)

$latex 13 = 4 + 9 = 2^{2} + 3^{2} $

$latex P (x) = 5x^2+16x+13 = (x+2)^{2} + (2x+3)^{2} geq 0 $

**Self – driving Car**: Trajectory = P (x)

P(x) < 0 where the car’s position in the trajectory;

Obstacles are positions where P (x) ≥ 0.