In mathematics, **Lill's method** is a visual method of finding the real roots of polynomials of any degree. It was developed by Austrian engineer Eduard Lill in 1867. A later paper by Lill dealt with the problem of imaginary roots.

Lill's method involves expressing the coefficients of a polynomial as magnitudes of segments at right angles to each other, starting from the origin, creating a path to a terminus, then finding a non-right angle path from the start to the terminus reflecting or refracting on the lines of the first path.

To employ the method a diagram is drawn starting at the origin. A line segment is drawn rightwards by the magnitude of the first coefficient (the coefficient of the highest-power term) (so that with a negative coefficient the segment will end left of the origin). From the end of the first segment another segment is drawn upwards by the magnitude of the second coefficient, then left by the magnitude of the third, and down by the magnitude of the fourth, and so on. The sequence of directions (not turns) is always rightward, upward, leftward, downward, then repeating itself. Thus each turn is counterclockwise. The process continues for every coefficient of the polynomial including zeroes, with negative coefficients "walking backwards". The final point reached, at the end of the segment corresponding to the equation's constant term, is the terminus.

A line is then launched from the origin at some angle θ, reflected off of each line segment at a right angle (not necessarily the "natural" angle of reflection), and refracted at a right angle through the line through each segment (including a line for the zero coefficients) when the angled path does not hit the line segment on that line. The vertical and horizontal lines are reflected off or refracted through in the following sequence: the line containing the segment corresponding to the coefficient of
x
n
−
1
,
then of
x
n
−
2
,
etc. Choosing θ so that the path lands on the terminus, the negative of the tangent of θ is a root of this polynomial. For every real zero of the polynomial there will be one unique initial angle and path that will land on the terminus. A quadratic with two real roots, for example, will have exactly two angles that satisfy the above conditions.

The construction in effect evaluates the polynomial according to Horner's method. For the polynomial
a
n
x
n
+
a
n
−
1
x
n
−
1
+
a
n
−
2
x
n
−
2
+
⋯
the values of
a
n
x
,
(
a
n
x
+
a
n
−
1
)
x
,
(
(
a
n
x
+
a
n
−
1
)
x
+
a
n
−
2
)
x
,
…
are successively generated. A solution line giving a root is similar to the Lill's construction for the polynomial with that root removed.

In 1936 Margharita P. Beloch showed how Lill's method could be adapted to solve cubic equations using paper folding. If simultaneous folds are allowed then any *n*th degree equation with a real root can be solved using *n*–2 simultaneous folds.