olymmath

SCHWEITZER 2001 Problem 2

    Let α≤−2\alpha \leq -2 be an integer. Prove that for every pair (β0,β1)(\beta_0, \beta_1) of integers there exists a uniquely determined sequence 0≤q0,…,qk<α2−α0\leq q_0, \ldots, q_k<\alpha ^ 2 - \alpha of integers, such that qk≠0q_k\neq 0 if (β0,β1)≠(0,0)(\beta_0, \beta 1)\neq (0,0) and βi=∑j=0kqj(α−i)j, for i=0,1\beta_i=\sum_{j=0}^k q_j(\alpha - i)^j,\text{ for }i=0,1

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