PPL 087 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.27
Prize Problem LedgerHager prize problemPPL 087Hager · Reverse-Markov quadrature conjecture

Permanent problem IDPPL 087

Reconfirm sponsorIndependentconjecture

Numerical analysis

Hager · Reverse-Markov quadrature conjecture

For a polynomial p of degree at most n at the specified Gauss or Radau nodes, prove the reverse-Markov bounds in Hager’s statement: p(−1)=0 and bounded nodal derivatives should force bounded nodal values.

quadraturepolynomial inequalitiesGauss–Radau nodes
01

The problem

For a polynomial p of degree at most n at the specified Gauss or Radau nodes, prove the reverse-Markov bounds in Hager’s statement: p(−1)=0 and bounded nodal derivatives should force bounded nodal values.

Open since2015dated prize statement
Last checked2026.07.27Catalog verification
02

Reward offers

Offer 01¥10,000William W. Hager
Personal offer

The first correct solution wins under the concise conditions in the author’s prize PDF.

The prize PDF is dated 2015. A 2026 University of Florida migration page still lists it, but the sponsor should reconfirm before reliance.

03

Sources & reading