Approximation by prime powers

The well-known Weierstrass approximation theorem says that polynomials are dense in C [0, 1]. That is, given any continuous function f on the unit interval, and any ε > 0, you can find a polynomial P such that f and P are never more than ε apart. This means that linear combinations of the polynomials 1, […] The post Approximation by prime powers first appeared on John D. Cook....

Submit