{
  "index": "1958-2-A-2",
  "type": "ANA",
  "tag": [
    "ANA",
    "ALG"
  ],
  "difficulty": "",
  "question": "2. Let\n\\[\nR_{1}=1, \\quad R_{n+1}=1+n / R_{n}, \\quad n \\geq 1\n\\]\n\nShow that for \\( n \\geq 1 \\),\n\\[\n\\sqrt{n} \\leq R_{n} \\leq \\sqrt{n}+1\n\\]",
  "solution": "Solution. We shall use induction on \\( n \\). Evidently \\( \\sqrt{1}=1=R_{1} \\leq \\sqrt{1}+1 \\), so the given formula is true for \\( n=1 \\). Suppose we know that it is true for \\( n=k \\), i.e., for \\( k \\) a positive integer\n\\[\n\\sqrt{k} \\leq R_{k} \\leq \\sqrt{k}+1\n\\]\n\nThen\n\\[\n\\sqrt{k+1}-1=\\frac{k}{\\sqrt{k+1}+1}<\\frac{k}{\\sqrt{k}+1} \\leq \\frac{k}{R_{k}} \\leq \\frac{k}{\\sqrt{k}}=\\sqrt{k}<\\sqrt{k+1} .\n\\]\n\nHence\n\\[\n\\sqrt{k+1}<1+\\frac{k}{R_{k}}=R_{k+1}<\\sqrt{k+1}+1\n\\]\nand the induction is complete.\nNote that the proof shows that the inequalities are strict for all integers, \\( n>1 \\).\n\nRemark. This problem was considered by Leo Moser and Max Wyman, \"On Solutions of \\( x^{d}=1 \\) in Symmetric Groups,\" Canadian Journal of Mathematics. vol. 7 (1955), pages 159-168.\n\nThey obtained the continued fraction expansion\n\\[\nR_{n+1}=1+\\frac{n}{1+} \\frac{n-1}{1+} \\frac{n-2}{1+} \\ldots \\frac{1}{1}\n\\]\nwhich follows directly from the recurrence, \\( R_{n+1}=1+n / R_{n} \\) and proved that\n\\[\n\\lim _{n \\rightarrow \\infty}\\left(R_{n}-\\sqrt{n}\\right)=1 / 2 .\n\\]",
  "vars": [
    "R_1",
    "R_n+1",
    "n",
    "R_n",
    "k",
    "R_k",
    "x",
    "d"
  ],
  "params": [],
  "sci_consts": [],
  "variants": {
    "descriptive_long": {
      "map": {
        "R_1": "seqfirst",
        "R_n+1": "seqnext",
        "n": "indexvar",
        "R_n": "seqcurrent",
        "k": "indextemp",
        "R_k": "seqiter",
        "x": "unknownx",
        "d": "exponent"
      },
      "question": "2. Let\n\\[\nseqfirst=1, \\quad seqnext=1+indexvar / seqcurrent, \\quad indexvar \\geq 1\n\\]\n\nShow that for \\( indexvar \\geq 1 \\),\n\\[\n\\sqrt{indexvar} \\leq seqcurrent \\leq \\sqrt{indexvar}+1\n\\]",
      "solution": "Solution. We shall use induction on \\( indexvar \\). Evidently \\( \\sqrt{1}=1=seqfirst \\leq \\sqrt{1}+1 \\), so the given formula is true for \\( indexvar=1 \\). Suppose we know that it is true for \\( indexvar=indextemp \\), i.e., for \\( indextemp \\) a positive integer\n\\[\n\\sqrt{indextemp} \\leq seqiter \\leq \\sqrt{indextemp}+1\n\\]\n\nThen\n\\[\n\\sqrt{indextemp+1}-1=\\frac{indextemp}{\\sqrt{indextemp+1}+1}<\\frac{indextemp}{\\sqrt{indextemp}+1} \\leq \\frac{indextemp}{seqiter} \\leq \\frac{indextemp}{\\sqrt{indextemp}}=\\sqrt{indextemp}<\\sqrt{indextemp+1} .\n\\]\n\nHence\n\\[\n\\sqrt{indextemp+1}<1+\\frac{indextemp}{seqiter}=seqnext<\\sqrt{indextemp+1}+1\n\\]\nand the induction is complete.\nNote that the proof shows that the inequalities are strict for all integers, \\( indexvar>1 \\).\n\nRemark. This problem was considered by Leo Moser and Max Wyman, \"On Solutions of \\( unknownx^{exponent}=1 \\) in Symmetric Groups,\" Canadian Journal of Mathematics. vol. 7 (1955), pages 159-168.\n\nThey obtained the continued fraction expansion\n\\[\nseqnext=1+\\frac{indexvar}{1+} \\frac{indexvar-1}{1+} \\frac{indexvar-2}{1+} \\ldots \\frac{1}{1}\n\\]\nwhich follows directly from the recurrence, \\( seqnext=1+indexvar / seqcurrent \\) and proved that\n\\[\n\\lim _{indexvar \\rightarrow \\infty}\\left(seqcurrent-\\sqrt{indexvar}\\right)=1 / 2 .\n\\]"
    },
    "descriptive_long_confusing": {
      "map": {
        "R_1": "mandarins",
        "R_n+1": "turntable",
        "n": "pinecone",
        "R_n": "rainstorm",
        "k": "chandelier",
        "R_k": "backspace",
        "x": "grainmill",
        "d": "marshland"
      },
      "question": "2. Let\n\\[\nmandarins=1, \\quad turntable=1+pinecone / rainstorm, \\quad pinecone \\geq 1\n\\]\n\nShow that for \\( pinecone \\geq 1 \\),\n\\[\n\\sqrt{pinecone} \\leq rainstorm \\leq \\sqrt{pinecone}+1\n\\]",
      "solution": "Solution. We shall use induction on \\( pinecone \\). Evidently \\( \\sqrt{1}=1=mandarins \\leq \\sqrt{1}+1 \\), so the given formula is true for \\( pinecone=1 \\). Suppose we know that it is true for \\( pinecone=chandelier \\), i.e., for \\( chandelier \\) a positive integer\n\\[\n\\sqrt{chandelier} \\leq backspace \\leq \\sqrt{chandelier}+1\n\\]\n\nThen\n\\[\n\\sqrt{chandelier+1}-1=\\frac{chandelier}{\\sqrt{chandelier+1}+1}<\\frac{chandelier}{\\sqrt{chandelier}+1} \\leq \\frac{chandelier}{backspace} \\leq \\frac{chandelier}{\\sqrt{chandelier}}=\\sqrt{chandelier}<\\sqrt{chandelier+1} .\n\\]\n\nHence\n\\[\n\\sqrt{chandelier+1}<1+\\frac{chandelier}{backspace}=turntable<\\sqrt{chandelier+1}+1\n\\]\nand the induction is complete.\nNote that the proof shows that the inequalities are strict for all integers, \\( pinecone>1 \\).\n\nRemark. This problem was considered by Leo Moser and Max Wyman, \"On Solutions of \\( grainmill^{marshland}=1 \\) in Symmetric Groups,\" Canadian Journal of Mathematics. vol. 7 (1955), pages 159-168.\n\nThey obtained the continued fraction expansion\n\\[\nturntable=1+\\frac{pinecone}{1+} \\frac{pinecone-1}{1+} \\frac{pinecone-2}{1+} \\ldots \\frac{1}{1}\n\\]\nwhich follows directly from the recurrence, \\( turntable=1+pinecone / rainstorm \\) and proved that\n\\[\n\\lim _{pinecone \\rightarrow \\infty}\\left(rainstorm-\\sqrt{pinecone}\\right)=1 / 2 .\n\\]"
    },
    "descriptive_long_misleading": {
      "map": {
        "R_1": "finalterm",
        "R_n+1": "previousterm",
        "n": "zeroindex",
        "R_n": "outsideterm",
        "k": "staticindex",
        "R_k": "externalterm",
        "x": "stillvalue",
        "d": "baseexpo"
      },
      "question": "2. Let\n\\[\nfinalterm=1, \\quad previousterm=1+zeroindex / outsideterm, \\quad zeroindex \\geq 1\n\\]\n\nShow that for \\( zeroindex \\geq 1 \\),\n\\[\n\\sqrt{zeroindex} \\leq outsideterm \\leq \\sqrt{zeroindex}+1\n\\]",
      "solution": "Solution. We shall use induction on \\( zeroindex \\). Evidently \\( \\sqrt{1}=1=finalterm \\leq \\sqrt{1}+1 \\), so the given formula is true for \\( zeroindex=1 \\). Suppose we know that it is true for \\( zeroindex=staticindex \\), i.e., for \\( staticindex \\) a positive integer\n\\[\n\\sqrt{staticindex} \\leq externalterm \\leq \\sqrt{staticindex}+1\n\\]\n\nThen\n\\[\n\\sqrt{staticindex+1}-1=\\frac{staticindex}{\\sqrt{staticindex+1}+1}<\\frac{staticindex}{\\sqrt{staticindex}+1} \\leq \\frac{staticindex}{externalterm} \\leq \\frac{staticindex}{\\sqrt{staticindex}}=\\sqrt{staticindex}<\\sqrt{staticindex+1} .\n\\]\n\nHence\n\\[\n\\sqrt{staticindex+1}<1+\\frac{staticindex}{externalterm}=previousterm<\\sqrt{staticindex+1}+1\n\\]\nand the induction is complete.\nNote that the proof shows that the inequalities are strict for all integers, \\( zeroindex>1 \\).\n\nRemark. This problem was considered by Leo Moser and Max Wyman, \"On Solutions of \\( stillvalue^{baseexpo}=1 \\) in Symmetric Groups,\" Canadian Journal of Mathematics. vol. 7 (1955), pages 159-168.\n\nThey obtained the continued fraction expansion\n\\[\npreviousterm=1+\\frac{zeroindex}{1+} \\frac{zeroindex-1}{1+} \\frac{zeroindex-2}{1+} \\ldots \\frac{1}{1}\n\\]\nwhich follows directly from the recurrence, \\( previousterm=1+zeroindex / outsideterm \\) and proved that\n\\[\n\\lim _{zeroindex \\rightarrow \\infty}\\left(outsideterm-\\sqrt{zeroindex}\\right)=1 / 2 .\n\\]"
    },
    "garbled_string": {
      "map": {
        "R_1": "qzxwvtnp",
        "R_n+1": "hjgrksla",
        "n": "pbrqkzvm",
        "R_n": "xldpftge",
        "k": "awfjchzu",
        "R_k": "bmtrgqas",
        "x": "kvspqrol",
        "d": "itxwznea"
      },
      "question": "2. Let\n\\[\nqzxwvtnp=1, \\quad hjgrksla=1+pbrqkzvm / xldpftge, \\quad pbrqkzvm \\geq 1\n\\]\n\nShow that for \\( pbrqkzvm \\geq 1 \\),\n\\[\n\\sqrt{pbrqkzvm} \\leq xldpftge \\leq \\sqrt{pbrqkzvm}+1\n\\]",
      "solution": "Solution. We shall use induction on \\( pbrqkzvm \\). Evidently \\( \\sqrt{1}=1=qzxwvtnp \\leq \\sqrt{1}+1 \\), so the given formula is true for \\( pbrqkzvm=1 \\). Suppose we know that it is true for \\( pbrqkzvm=awfjchzu \\), i.e., for \\( awfjchzu \\) a positive integer\n\\[\n\\sqrt{awfjchzu} \\leq bmtrgqas \\leq \\sqrt{awfjchzu}+1\n\\]\n\nThen\n\\[\n\\sqrt{awfjchzu+1}-1=\\frac{awfjchzu}{\\sqrt{awfjchzu+1}+1}<\\frac{awfjchzu}{\\sqrt{awfjchzu}+1} \\leq \\frac{awfjchzu}{bmtrgqas} \\leq \\frac{awfjchzu}{\\sqrt{awfjchzu}}=\\sqrt{awfjchzu}<\\sqrt{awfjchzu+1} .\n\\]\n\nHence\n\\[\n\\sqrt{awfjchzu+1}<1+\\frac{awfjchzu}{bmtrgqas}=hjgrksla<\\sqrt{awfjchzu+1}+1\n\\]\nand the induction is complete.\nNote that the proof shows that the inequalities are strict for all integers, \\( pbrqkzvm>1 \\).\n\nRemark. This problem was considered by Leo Moser and Max Wyman, \"On Solutions of \\( kvspqrol^{itxwznea}=1 \\) in Symmetric Groups,\" Canadian Journal of Mathematics. vol. 7 (1955), pages 159-168.\n\nThey obtained the continued fraction expansion\n\\[\nhjgrksla=1+\\frac{pbrqkzvm}{1+} \\frac{pbrqkzvm-1}{1+} \\frac{pbrqkzvm-2}{1+} \\ldots \\frac{1}{1}\n\\]\nwhich follows directly from the recurrence, \\( hjgrksla=1+pbrqkzvm / xldpftge \\) and proved that\n\\[\n\\lim _{pbrqkzvm \\rightarrow \\infty}\\left(xldpftge-\\sqrt{pbrqkzvm}\\right)=1 / 2 .\n\\]"
    },
    "kernel_variant": {
      "question": "Let $a,b$ be strictly positive real numbers such that  \n\\[\n\\boxed{\\;a\\;\\ge\\;\\sqrt{b}>0\\;}\n\\tag{H}\n\\]\n\nFor $n\\ge 1$ define the sequence $\\bigl(X_{n}\\bigr)$ recursively by  \n\\[\n\\boxed{\\;X_{1}=a,\\qquad \n        X_{\\,n+1}=a+\\dfrac{bn}{X_{n}}\\;(n\\ge 1)\\;}\n\\tag{\\mathcal R}\n\\]\n\n1.  (Two–sided first–order squeeze) Show that, for every $n\\ge 1$,\n\\[\n\\boxed{\\;\n      \\sqrt{bn}\\;\\le\\;X_{n}\\;\\le\\;\\sqrt{bn}+a\\;}\n\\tag{\\mathcal S}\n\\]\n\n2.  (Exact first–order asymptotics) Put  \n\\[\nD_{n}:=X_{n}-\\sqrt{bn},\\qquad \nE_{n}:=D_{n}-\\dfrac a2 ,\\qquad n\\ge 1 .\n\\]\nProve that  \n\\[\n\\boxed{\\;\n       \\displaystyle\\lim_{n\\to\\infty}D_{n}=\\frac a2\\;}\n\\tag{\\mathcal L}\n\\]\n\n3.  (Sharp second–order estimates)\n\n   (a) Prove that there exists a constant $C(a,b)$ such that for all $n\\ge 2$\n   \\[\n   \\boxed{\\;\n         \\Bigl|X_{n}-\\sqrt{bn}-\\tfrac a2\\Bigr|\n         \\le\\frac{C(a,b)}{\\sqrt n}\\;}\n   \\tag{$\\star$}\n   \\]\n\n   (b) Show that if $a^{2}\\neq 2b$ the exponent $-\\tfrac12$ in $(\\star)$\n   is optimal (that is, no bound of the form $Cn^{-\\alpha}$ with\n   $\\alpha>\\tfrac12$ can hold for every $n$).\n\n   (c) Treat the resonant case $a^{2}=2b$: prove that there exists\n   $C^{\\ast}(a,b)$ with  \n   \\[\n         \\bigl|X_{n}-\\sqrt{bn}-\\tfrac a2\\bigr|\n         \\le\\frac{C^{\\ast}(a,b)}{n}\\qquad(n\\ge 2),\n   \\tag{$\\star\\star$}\n   \\]\n   and that here the exponent $-1$ is best possible.\n\nOnly elementary real analysis (limits, inequalities, the mean–value\ntheorem, elementary series estimates) may be used.  \n\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%",
      "solution": "Throughout we use  \n\\[\nr_{n}:=\\sqrt{bn},\\qquad  \nD_{n}:=X_{n}-r_{n},\\qquad  \nE_{n}:=D_{n}-\\frac a2,\\qquad n\\ge 1 .\n\\tag{0.1}\n\\]\n\n--------------------------------------------------------------------\n1.  Proof of the squeeze $(\\mathcal S)$\n--------------------------------------------------------------------\nExactly as in the original inductive proof one shows that every time\n$r_{n}\\le X_{n}\\le r_{n}+a$ implies\n$r_{n+1}\\le X_{n+1}\\le r_{n+1}+a$, whence $(\\mathcal S)$ follows.\nConsequently\n\\[\n0\\le D_{n}\\le a,\\qquad |E_{n}|\\le a,\\qquad n\\ge 1 .\n\\tag{1.1}\n\\]\n\n--------------------------------------------------------------------\n2.  First–order asymptotics $(\\mathcal L)$\n--------------------------------------------------------------------\n2.1  A convenient recursion.  \nBecause $r_{n}^{2}=bn$ we have\n\\[\nX_{n+1}=a+\\frac{bn}{X_{n}}\n        =r_{n}+a-D_{n}+\\frac{D_{n}^{2}}{X_{n}},\n\\]\nhence\n\\[\nD_{n+1}=a-D_{n}+\\varepsilon_{n},\\qquad\n\\varepsilon_{n}:=\\frac{D_{n}^{2}}{X_{n}}-\\delta_{n},\\qquad\n\\delta_{n}:=r_{n+1}-r_{n}.\n\\tag{2.1}\n\\]\nSubtracting $a/2$ gives the alternating recursion\n\\[\nE_{n+1}=-E_{n}+\\varepsilon_{n}\\qquad(n\\ge 1).\n\\tag{2.2}\n\\]\n\n2.2  A \\emph{precise} expansion of $\\varepsilon_{n}$.  \nWrite $D_{n}=a/2+E_{n}$.  Since $X_{n}=r_{n}+D_{n}$,\n\\[\n\\frac{D_{n}^{2}}{X_{n}}\n     =\\frac{D_{n}^{2}}{r_{n}}\n        \\Bigl(1+\\frac{D_{n}}{r_{n}}\\Bigr)^{-1}\n     =\\frac{D_{n}^{2}}{r_{n}}\n      -\\frac{D_{n}^{3}}{r_{n}^{2}}\n      +O\\!\\bigl(n^{-3/2}\\bigr)\n      \\quad(n\\to\\infty)\n\\tag{2.3a}\n\\]\n(the remainder uses the boundedness of $D_{n}$, see (1.1)).\nBecause $r_{n}=\\sqrt{b}\\,n^{1/2}$,\n\\[\n\\frac{D_{n}^{2}}{r_{n}}\n   =\\frac{1}{\\sqrt b\\,\\sqrt n}\\Bigl(\\frac{a^{2}}{4}+aE_{n}+E_{n}^{2}\\Bigr),\n\\qquad\n\\frac{D_{n}^{3}}{r_{n}^{2}}\n   =O\\!\\bigl(n^{-1}\\bigr).\n\\tag{2.3b}\n\\]\nFurthermore\n\\[\n\\delta_{n}=r_{n+1}-r_{n}\n          =\\frac{\\sqrt b}{2\\sqrt n}-\\frac{\\sqrt b}{8\\,n^{3/2}}\n           +O\\!\\bigl(n^{-5/2}\\bigr).\n\\tag{2.3c}\n\\]\nPutting (2.3a)–(2.3c) together gives, with  \n\\[\nc_{0}:=\\frac{a^{2}-2b}{4\\sqrt b},\\qquad\nc_{1}:=-\\frac{a^{3}}{8b},\n\\]\nthe \\emph{exact} formula\n\\[\n\\boxed{\\;\n\\varepsilon_{n}\n =c_{0}\\,n^{-1/2}\n  +\\frac{a}{\\sqrt b}\\,\\frac{E_{n}}{\\sqrt n}\n  +\\frac{E_{n}^{2}}{\\sqrt b\\,\\sqrt n}\n  +c_{1}\\,n^{-1}\n  +O\\!\\bigl(n^{-3/2}\\bigr)\\;}\n\\tag{2.4}\n\\]\n\n2.3  The sequence $(E_{n})$ converges.  \nBecause of (1.1) every term on the right–hand side of (2.4) is\n$O(n^{-1/2})$; hence $\\varepsilon_{n}\\to 0$.\nFrom (2.2) we obtain\n\\[\nE_{n+2}-E_{n}\n      =\\varepsilon_{n+1}-\\varepsilon_{n}\\longrightarrow 0 ,\n\\tag{2.5}\n\\]\nso the even and odd subsequences are Cauchy and therefore\nconvergent.  Let $L:=\\lim_{n\\to\\infty}E_{n}$.  Passing to the limit in\n$E_{n+1}=-E_{n}+\\varepsilon_{n}$ yields $L=-L$, hence $L=0$.\nTherefore\n\\[\n\\lim_{n\\to\\infty}D_{n}=\\frac a2 ,\n\\]\nestablishing $(\\mathcal L)$.\n\n--------------------------------------------------------------------\n3.  Sharp second–order estimates\n--------------------------------------------------------------------\nThroughout we retain  \n\\[\nc_{0}=\\frac{a^{2}-2b}{4\\sqrt b},\\qquad\nc_{1}=-\\frac{a^{3}}{8b}.\n\\tag{3.0}\n\\]\n\n3.1  A uniform bootstrap bound for $E_{n}$.  \nFix $K\\!>\\!2\\bigl(|c_{0}|+a+1\\bigr)$.  \nWe first show that\n\\[\n|E_{n}|\\le\\frac{K}{\\sqrt n}\\qquad(n\\text{ large})\n\\tag{3.1}\n\\]\nby contradiction.  Suppose $|E_{N}|>\\dfrac{K}{\\sqrt N}$ for the {\\it\nfirst} index $N$.  Using (2.2) and (2.4) we write\n\\[\nE_{N+1}=-E_{N}+c_{0}N^{-1/2}+R_{N},\\qquad\n|R_{N}|\\le\\Bigl(\\frac{a}{\\sqrt b}+a\\Bigr)N^{-1/2}+C N^{-1},\n\\]\nwhence\n\\[\n|E_{N+1}|\n \\;\\ge\\;\n|E_{N}|-|c_{0}|N^{-1/2}-|R_{N}|\n \\;>\\;\n\\frac{K-2|c_{0}|-2a}{\\sqrt N}\n \\;>\\;\n\\frac{K}{\\sqrt{N+1}}\n\\]\n(for $N$ large enough).  This contradicts the minimality of $N$,\nproving (3.1).  Consequently every term containing $E_{n}$ in\n(2.4) is in fact $O(n^{-1})$ once $n$ is large.\n\n3.2  The \\emph{generic} case $a^{2}\\neq 2b$ ($c_{0}\\neq 0$).  \nBecause of (3.1), for large $n$\n\\[\n\\varepsilon_{n}=c_{0}n^{-1/2}+O(n^{-1}),\n\\quad\\text{and hence}\\quad\n\\varepsilon_{n+1}-\\varepsilon_{n}\n      =-\\frac{c_{0}}{2}\\,n^{-3/2}+O(n^{-3/2}).\n\\]\nSumming $\\varepsilon_{k+1}-\\varepsilon_{k}$ from a fixed index up to\n$n$ gives $\\varepsilon_{n}=O(n^{-1/2})$, so by (2.5)\n\\[\nE_{n+2}-E_{n}=O(n^{-1/2}),\n\\]\nand a simple induction shows the existence of a constant\n$C_{1}(a,b)$ with\n\\[\n|E_{n}-\\tfrac{c_{0}}{2}n^{-1/2}|\\le\\frac{C_{1}(a,b)}{n}\\qquad(n\\ge 2).\n\\]\nUsing again $|c_{0}|n^{-1/2}\\le C_{1}/\\sqrt n$ for the finitely many\nsmall indices and going back to $D_{n}=a/2+E_{n}$ yields\n\\[\n\\boxed{\\;\n      \\bigl|X_{n}-\\sqrt{bn}-\\tfrac a2\\bigr|\n      \\le\\frac{C(a,b)}{\\sqrt n}\\quad(n\\ge 2)\\;}\n\\]\nwhich is $(\\star)$.\n\n\\smallskip\n\\emph{Optimality.}  \nAssume that, for some $\\alpha>\\tfrac12$, a bound\n$|E_{n}|\\le Cn^{-\\alpha}$ held for all $n$.  Then\n$\\varepsilon_{n}=E_{n+1}+E_{n}=O(n^{-\\alpha})$, contradicting\n$\\varepsilon_{n}\\sim c_{0}n^{-1/2}$ with $c_{0}\\neq 0$.  Hence the\nexponent $-\\tfrac12$ is best possible.\n\n3.3  The \\emph{resonant} case $a^{2}=2b$ ($c_{0}=0$).  \nNow (2.4) simplifies to\n\\[\n\\varepsilon_{n}\n      =\\frac{a}{\\sqrt b}\\,\\frac{E_{n}}{\\sqrt n}\n       +\\frac{E_{n}^{2}}{\\sqrt b\\,\\sqrt n}\n       +c_{1}\\,n^{-1}+O\\!\\bigl(n^{-3/2}\\bigr).\n\\]\nWith the bootstrap bound (3.1) both terms containing $E_{n}$ are\n$O(n^{-1})$, so $\\varepsilon_{n}=c_{1}n^{-1}+O(n^{-3/2})$.  A\ncomputation completely analogous to that in 3.2 gives, for a suitable\nconstant $C_{2}(a,b)$,\n\\[\n|E_{n}-c_{1}n^{-1}|\\le\\frac{C_{2}(a,b)}{n^{3/2}}\\qquad(n\\ge 2),\n\\]\nand therefore\n\\[\n\\boxed{\\;\n      \\bigl|X_{n}-\\sqrt{bn}-\\tfrac a2\\bigr|\n      \\le\\frac{C^{\\ast}(a,b)}{n}\\quad(n\\ge 2)\\;}\n\\]\nwhich is $(\\star\\star)$.\n\n\\smallskip\n\\emph{Optimality.}  \nIf a strictly better exponent $\\alpha>1$ were attainable, then\n$\\varepsilon_{n}=E_{n+1}+E_{n}$ would be $O(n^{-\\alpha})$, contradicting\n$\\varepsilon_{n}\\sim c_{1}n^{-1}$ with $c_{1}\\neq 0$.  Thus $-1$ is\nsharp.\n\n\\hfill$\\square$\n\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%",
      "metadata": {
        "replaced_from": "harder_variant",
        "replacement_date": "2025-07-14T19:09:31.492227",
        "was_fixed": false,
        "difficulty_analysis": "• Additional Parameters:  Two free positive parameters a and b replace the fixed constants 1 and 3, enlarging the family of admissible recursions and removing scale-invariance.  \n• Asymptotic Requirement:  Besides mere inequalities, Parts 2–3 demand evaluation of an exact limit and a quantitative convergence rate, forcing the solver to perform a delicate asymptotic expansion rather than straightforward induction.  \n• Error Control:  Establishing the O(n^{-1/2}) remainder term and propagating it through the recursion introduces careful Taylor approximation, manipulation of error terms, and Cauchy-type convergence arguments.  \n• Multiple Techniques:  The complete solution combines induction, algebraic manipulation of recurrences, Taylor series, estimation of alternating perturbations, and summability of error series—considerably deeper than the single-step comparison argument that suffices for the original problem."
      }
    },
    "original_kernel_variant": {
      "question": "Let $a,b$ be strictly positive real numbers and assume  \n\\[\n\\boxed{\\;a\\;\\ge\\;\\sqrt b>0\\;}\n\\tag{H}\n\\]\n\nDefine the sequence $\\bigl(X_{n}\\bigr)_{n\\ge 1}$ recursively by  \n\\[\n\\boxed{\\;X_{1}=a,\\qquad \n        X_{\\,n+1}=a+\\dfrac{bn}{X_{n}}\\quad(n\\ge 1)\\;}\n\\tag{\\mathcal R}\n\\]\n\n1. (Two–sided first–order squeeze)  Prove that for every $n\\ge 1$\n\\[\n\\boxed{\\;\n      \\sqrt{bn}\\;\\le\\;X_{n}\\;\\le\\;\\sqrt{bn}+a\\;}\n\\tag{\\mathcal S}\n\\]\n\n2. (Exact first–order asymptotics)  Put  \n\\[\nD_{n}:=X_{n}-\\sqrt{bn},\\qquad \nE_{n}:=D_{n}-\\dfrac a2 ,\\qquad n\\ge 1 .\n\\]\nShow that  \n\\[\n\\boxed{\\;\n       \\displaystyle\\lim_{n\\to\\infty}D_{n}=\\frac a2\\;}\n\\tag{\\mathcal L}\n\\]\n\n3. (Sharp second–order estimates)\n\n   (a) Prove that there exists a finite constant $C(a,b)$ depending only on $a,b$ such that for all $n\\ge 2$\n   \\[\n   \\boxed{\\;\n         \\Bigl|X_{n}-\\sqrt{bn}-\\tfrac a2\\Bigr|\n         \\le\\frac{C(a,b)}{\\sqrt n}\\;}\n   \\tag{$\\star$}\n   \\]\n\n   (b) Show that if $a^{2}\\neq 2b$ the exponent $-\\tfrac12$ in $(\\star)$ is optimal (no bound of the form $C n^{-\\alpha}$ with $\\alpha>\\tfrac12$ can hold for all $n$).\n\n   (c) Treat the resonant case $a^{2}=2b$: prove that there exists $C^{\\ast}(a,b)$ with  \n   \\[\n         \\bigl|X_{n}-\\sqrt{bn}-\\tfrac a2\\bigr|\n         \\le\\frac{C^{\\ast}(a,b)}{n^{3/2}}\\qquad(n\\ge 2),\n   \\tag{$\\star\\star$}\n   \\]\n   and that here the exponent $-\\dfrac32$ is best possible.\n\nOnly elementary real analysis (limits, inequalities, the mean value theorem, elementary series estimates) may be used.  \n\n\n--------------------------------------------------------------------",
      "solution": "Throughout we assume $(\\mathrm H)$ and put  \n\\[\nr_{n}:=\\sqrt{bn},\\quad  \nD_{n}:=X_{n}-r_{n},\\quad  \nE_{n}:=D_{n}-\\frac a2 ,\\qquad n\\ge 1 .\n\\]\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \n1.\\;Proof of the squeeze $(\\mathcal S)$  \n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \nWe argue by induction.  For $n=1$ the required inequalities are  \n$\\sqrt b\\le a\\le\\sqrt b+a$, which follow from $(\\mathrm H)$.  \nAssume $\\sqrt{bn}\\le X_{n}\\le\\sqrt{bn}+a$ for some $n\\ge 1$.  \nBecause $x\\mapsto n/x$ is decreasing on $(0,\\infty)$,  \n\\[\n\\frac{bn}{\\sqrt{bn}+a} \\;\\le\\;\\frac{bn}{X_{n}}\n\\;\\le\\;\\frac{bn}{\\sqrt{bn}}=\\sqrt{bn}.\n\\]\nAdding $a$ shows\n\\[\n\\sqrt{bn} \\;<\\; a+\\frac{bn}{X_{n}}\n           \\;<\\; a+\\sqrt{bn}\n           =   \\sqrt{b(n+1)}+(\\underbrace{a-\\bigl(\\sqrt{b(n+1)}-\\sqrt{bn}\\bigr)}_{\\ge 0}),\n\\]\nhence\n\\[\n\\sqrt{b(n+1)}\\;\\le\\;X_{n+1}\\;\\le\\;\\sqrt{b(n+1)}+a,\n\\]\ncompleting the induction.\n\nTwo immediate corollaries will be used repeatedly:\n\\[\n0\\le D_{n}\\le a,\\qquad X_{n}\\ge r_{n}\\qquad(n\\ge 1).\n\\tag{1.1}\n\\]\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \n2.\\;First–order asymptotics $(\\mathcal L)$  \n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \nSince $r_{n}^{2}=bn$,  \n\\[\nX_{n+1}=a+\\frac{bn}{X_{n}}\n        =r_{n}+a-D_{n}+\\frac{D_{n}^{2}}{X_{n}}.\n\\]\nHence  \n\\[\nD_{n+1}=a-D_{n}+\\varepsilon_{n},\\qquad\n\\varepsilon_{n}:=\\frac{D_{n}^{2}}{X_{n}}-\\delta_{n},\\qquad\n\\delta_{n}:=r_{n+1}-r_{n}.\n\\tag{2.1}\n\\]\nSubtracting $\\tfrac a2$ yields the linear recursion  \n\\[\nE_{n+1}=-E_{n}+\\varepsilon_{n}\\qquad(n\\ge 1).\n\\tag{2.2}\n\\]\n\nBound on $\\varepsilon_{n}$.  \nUsing (1.1) and $\\delta_{n}=\\sqrt{b}/(\\sqrt{n+1}+\\sqrt n)$,\n\\[\n0\\le\\frac{D_{n}^{2}}{X_{n}}\\le\\frac{a^{2}}{r_{n}},\\qquad\n0<\\delta_{n}\\le\\frac{\\sqrt b}{2\\sqrt n},\n\\]\nwhence\n\\[\n|\\varepsilon_{n}|\n      \\le\\frac{a^{2}}{\\sqrt{bn}}+\\frac{\\sqrt b}{2\\sqrt n}\n      =:\\frac{M(a,b)}{\\sqrt n}.\n\\tag{2.3}\n\\]\n\nCauchy convergence of $(E_{n})$.  \nIterating (2.2) gives  \n\\[\nE_{n+1}+E_{n}=\\varepsilon_{n},\\qquad\nE_{m+1}-(-1)^{\\,m-n}E_{n+1}\n          =\\sum_{k=n+1}^{m}(-1)^{m-k}\\varepsilon_{k}\\quad(m>n).\n\\]\nBecause $(\\varepsilon_{k})$ is bounded by $M(a,b)k^{-1/2}$ the right–hand\nsum forms a Cauchy sequence; hence $(E_{n})_{n\\ge 1}$ is Cauchy and\ntherefore convergent.  \nBut the relation $E_{n+1}=-E_{n}+\\varepsilon_{n}\\to 0$ forces the common\nlimit to be $0$.  Consequently $D_{n}=a/2+E_{n}\\to a/2$, proving\n$(\\mathcal L)$.\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \n3.\\;Second–order estimates  \n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \n\n--------------------------------------------------------------------  \n3.1.\\;An exact representation for $E_{n}$  \n--------------------------------------------------------------------  \nIterating (2.2) and writing $\\sigma_{k}:=(-1)^{\\,k}$ we obtain the **exact**\nidentity\n\\[\nE_{n}=(-1)^{\\,n-1}E_{1}+\\sum_{k=1}^{n-1}(-1)^{\\,n-1-k}\\varepsilon_{k},\n\\qquad n\\ge 2,\n\\tag{3.1}\n\\]\nwith\n\\[\nE_{1}=D_{1}-\\frac a2=\\frac a2-\\sqrt b.\n\\tag{3.2}\n\\]\n\n--------------------------------------------------------------------  \n3.2.\\;Precise expansion of $\\varepsilon_{n}$  \n--------------------------------------------------------------------  \nWrite $D_{n}=a/2+E_{n}$ and $X_{n}=r_{n}+D_{n}$.  \nA standard Taylor expansion (details below) gives  \n\\[\n\\frac{D_{n}^{2}}{X_{n}}\n     =\\frac{a^{2}}{4r_{n}}\n       +\\frac{(a^{2}-2b)E_{n}}{4br_{n}}\n       +O\\!\\bigl(n^{-1}\\bigr),\n\\]\nso that\n\\[\n\\varepsilon_{n}\n  =\\frac{a^{2}-2b}{4\\sqrt b}\\,n^{-1/2}\n   +\\frac{\\sqrt b}{8}\\,n^{-3/2}\n   +O\\!\\bigl(n^{-5/2}\\bigr).\n\\tag{3.3}\n\\]\n(The numerical constants come from the first three terms of the binomial\nseries for $\\sqrt{n+1}-\\sqrt n$ and from cancelling the contribution of\n$E_{n}$, see the end of this subsection.)  Denote  \n\\[\nc_{0}:=\\frac{a^{2}-2b}{4\\sqrt b},\\qquad\nc_{1}:=\\frac{\\sqrt b}{8}.\n\\]\n\n--------------------------------------------------------------------  \n3.3.\\;Eventual monotonicity of $|\\varepsilon_{n}|$  \n--------------------------------------------------------------------  \nWhen $c_{0}\\neq 0$, the dominant term $c_{0}n^{-1/2}$ clearly makes\n$|\\varepsilon_{n}|$ ultimately decrease.  \nIf $c_{0}=0$ (that is, $a^{2}=2b$) the leading term is $c_{1}n^{-3/2}$,\nagain decreasing.  Consequently there exists $N_{0}=N_{0}(a,b)$ such that  \n\\[\n|\\varepsilon_{n+1}|\\le|\\varepsilon_{n}|\\qquad(n\\ge N_{0}).\n\\tag{3.4}\n\\]\n\n--------------------------------------------------------------------  \n3.4.\\;Proof of the {\\bf upper} bounds $(\\star)$ and $(\\star\\star)$  \n--------------------------------------------------------------------  \nIntroduce  \n\\[\nF_{n}:=(-1)^{\\,n-1}E_{n}=E_{1}+\\sum_{k=1}^{n-1}(-1)^{k}\\varepsilon_{k},\n\\qquad n\\ge 2.\n\\tag{3.5}\n\\]\nBecause $|\\varepsilon_{k}|$ is decreasing after $N_{0}$ and converges to\n$0$, the alternating series\n$\\sum_{k=1}^{\\infty}(-1)^{k}\\varepsilon_{k}$ converges (Leibniz criterion)\nand for $n\\ge N_{0}$\n\\[\n|E_{n}|=|F_{n}|\n       \\le|\\varepsilon_{n}|\n       \\le\\frac{|c_{0}|+1}{\\sqrt n}\\qquad\n       (a^{2}\\neq 2b),\n\\]\nrespectively\n\\[\n|E_{n}|=|F_{n}|\n       \\le|\\varepsilon_{n}|\n       \\le\\frac{|c_{1}|+1}{n^{3/2}}\\qquad\n       (a^{2}=2b).\n\\]\nEnlarging the constant finitely many times if necessary gives $(\\star)$\nand $(\\star\\star)$.\n\n--------------------------------------------------------------------  \n3.5.\\;Optimality of the exponents  \n--------------------------------------------------------------------  \n\n\\noindent\\emph{(i)  The case $a^{2}\\neq 2b$.}  \nSuppose that for some $\\alpha>\\tfrac12$ one had\n$|E_{n}|\\le Cn^{-\\alpha}$ for every $n\\ge 2$.  \nThen $|\\varepsilon_{n}|=|E_{n+1}+E_{n}|\n                      \\le C\\bigl((n+1)^{-\\alpha}+n^{-\\alpha}\\bigr)\n                      \\le 2C\\,n^{-\\alpha}$.  \nBut (3.3) shows\n$\\varepsilon_{n}=c_{0}n^{-1/2}+o\\!\\bigl(n^{-1/2}\\bigr)$ with $c_{0}\\neq 0$,\ncontradicting $\\alpha>\\tfrac12$.  Hence the exponent $-\\tfrac12$ is sharp.\n\n\\smallskip\n\\noindent\\emph{(ii)  The resonant case $a^{2}=2b$.}  \nAssume that a bound $|E_{n}|\\le Cn^{-\\alpha}$ holds for all $n$ with\nsome $\\alpha>\\tfrac32$.  As above this gives\n$|\\varepsilon_{n}|\\le 2C\\,n^{-\\alpha}$, while (3.3) now reads\n$\\varepsilon_{n}=c_{1}n^{-3/2}+o\\!\\bigl(n^{-3/2}\\bigr)$ with the\n\\emph{non–zero} constant $c_{1}=\\sqrt b/8$.  This is impossible if\n$\\alpha>\\tfrac32$.  Therefore the exponent $-\\tfrac32$ in $(\\star\\star)$\nis optimal.\n\n\\medskip\n\\noindent\\textbf{Justification of expansion (3.3).}  \nPut $h_{n}:=D_{n}/r_{n}=a/(2r_{n})+E_{n}/r_{n}$.  \nSince $r_{n+1}-r_{n}\n      =\\sqrt b/(\\sqrt{n+1}+\\sqrt n)\n      =\\sqrt b\\,n^{-1/2}/2-\\sqrt b\\,n^{-3/2}/8+O(n^{-5/2})$,\nthe difference\n\\[\n\\varepsilon_{n}\n   =\\frac{D_{n}^{2}}{X_{n}}-\\bigl(r_{n+1}-r_{n}\\bigr)\n   =\\frac{r_{n}h_{n}^{2}}{1+h_{n}}\n    -\\frac{\\sqrt b}{2}n^{-1/2}\n    +\\frac{\\sqrt b}{8}n^{-3/2}+O(n^{-5/2})\n\\]\ncan be expanded with the help of\n$r_{n}h_{n}^{2}=r_{n}(a^{2}/4r_{n}^{2}+O(n^{-1}))=\n(a^{2}/4\\sqrt b)\\,n^{-1/2}+O(n^{-1})$\nand $(1+h_{n})^{-1}=1-h_{n}+O(n^{-1})$.  Collecting all terms of order\n$n^{-1/2}$ and $n^{-3/2}$ produces (3.3).\n\n\\hfill$\\square$  \n\n--------------------------------------------------------------------",
      "metadata": {
        "replaced_from": "harder_variant",
        "replacement_date": "2025-07-14T01:37:45.411832",
        "was_fixed": false,
        "difficulty_analysis": "• Additional Parameters:  Two free positive parameters a and b replace the fixed constants 1 and 3, enlarging the family of admissible recursions and removing scale-invariance.  \n• Asymptotic Requirement:  Besides mere inequalities, Parts 2–3 demand evaluation of an exact limit and a quantitative convergence rate, forcing the solver to perform a delicate asymptotic expansion rather than straightforward induction.  \n• Error Control:  Establishing the O(n^{-1/2}) remainder term and propagating it through the recursion introduces careful Taylor approximation, manipulation of error terms, and Cauchy-type convergence arguments.  \n• Multiple Techniques:  The complete solution combines induction, algebraic manipulation of recurrences, Taylor series, estimation of alternating perturbations, and summability of error series—considerably deeper than the single-step comparison argument that suffices for the original problem."
      }
    }
  },
  "checked": true,
  "problem_type": "proof"
}