olymmath

NL-NWO 1989 Problem 5

    ∀k∈N  ∃n(k)∈N,a(k):0<a(k)<1[(1+2)2k+1=n(k)+a(k)]\forall k\in N \,\, \exists n(k) \in N, a(k):0<a(k)<1 [(1+\sqrt2)^{2k+1}=n(k)+a(k)] Prove: (n(k)+a(k))a(k)=1(n(k) + a(k))a(k) = 1 , for all k∈Nk \in N , and calculate lim⁡k→∞a(k)\lim_{k \to \infty }a(k)

    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 nl-nwo/1989/p5 · Tag MZWPKX8CXE · Edit this page on GitHub · Keys: j next, k previous