olymmath

SCHWEITZER 2011 Problem 5

    Let n, k be positive integers. Let fa(x):=∣∣x−a∣∣2nf_a(x) := ||x - a||^{2n} , where the vectors x=(x1,...,xk),a∈Rkx = (x_1, ..., x_k) , a\in R^k , and ||·|| is the Euclidean norm. Let the vector space Qn,kQ_{n, k} be generated by the functions faf_a ( a∈Rka\in R^k ). What is the largest integer N for which Qn,kQ_{n, k} contains all polynomials of x1,...,xkx_1, ..., x_k whose total degree is at most N?

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator schweitzer/2011/p5 · Tag DAVZVBWEW4 · Edit this page on GitHub · Keys: j next, k previous