olymmath

SCHWEITZER 1995 Problem 4

    For odd numbers a1,...,aka_1 , ..., a_k and even numbers b1,...,bkb_1 , ..., b_k , we know that ∑j=1kajn=∑j=1kbjn\sum_ {j = 1}^k a_j^n = \sum_{j = 1}^k b_j^n is satisfied for n = 1,2, ..., N. Prove that k≥2Nk\geq 2^N and that for k=2Nk = 2^N there exists a solution (a1,...,b1,...)(a_1,...,b_1,...) with the above properties.

    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/1995/p4 · Tag CT6FTJB5EN · Edit this page on GitHub · Keys: j next, k previous