olymmath

OBM 1986 Problem 2

    Find the number of ways that a positive integer nn can be represented as a sum of one or more consecutive positive integers.

    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 br-obm/1986/p2 · Tag NGNNZ3HGHD · Edit this page on GitHub · Keys: j next, k previous