Lambdia

x + 1/x = 3, y la escalera hasta x⁵ + 1/x⁵

Una sola condición, una recurrencia de dos líneas, y la quinta potencia sale como un 123 limpio, sin radicales. Sube lo suficiente la misma escalera y el número áureo y los números de Lucas están escondidos debajo.

Give me one fact, that x+1x=3x + \tfrac{1}{x} = 3, and I can hand you x5+1x5x^5 + \tfrac{1}{x^5} without ever finding xx. That still feels a bit like cheating the first time you see it. The two values of xx that fit the condition are ugly, both stuffed with 5\sqrt{5}, yet the thing we actually want comes out a clean whole number: 123123. No decimals, no radicals left over. This is the engine behind a whole genre of competition problems, and it runs on a two-line rule you can do on your fingers.

Problem

Given a real number xx with x+1x=3x + \tfrac{1}{x} = 3, find x5+1x5x^5 + \tfrac{1}{x^5} without solving for xx first.

Turn the condition into two roots

Multiply x+1x=3x + \tfrac{1}{x} = 3 through by xx and you get a plain quadratic:

x23x+1=0.x^2 - 3x + 1 = 0.
(1)

Here is the move that makes everything else easy. If xx solves this, so does 1x\tfrac{1}{x}, because the product of the two roots is 11 (the constant term over the leading one). So xx and 1x\tfrac{1}{x} are the two roots of the same quadratic, and Vieta’s formulas tell us all we will ever need about them:

x+1x=3,x1x=1.x + \tfrac{1}{x} = 3, \qquad x \cdot \tfrac{1}{x} = 1.

Sum 33, product 11. We are never going to solve for xx. We are going to build everything out of those two numbers.

Name what you want, then find its rule

Give the quantity a name. Let

pn=xn+1xn,p_n = x^n + \frac{1}{x^n},

so the target is p5p_5. Two floors are free: p0=x0+x0=2p_0 = x^0 + x^0 = 2 and p1=3p_1 = 3, which is the condition itself. Now watch what happens when you multiply the given sum by one of these:

(x+1x)(xn1+1xn1)=xn+1xnpn+xn2+1xn2pn2.\Big(x + \tfrac{1}{x}\Big)\Big(x^{n-1} + \tfrac{1}{x^{n-1}}\Big) = \underbrace{x^{n} + \tfrac{1}{x^{n}}}_{p_n} + \underbrace{x^{n-2} + \tfrac{1}{x^{n-2}}}_{p_{n-2}}.

The cross terms collapse: xn11x=xn2x^{n-1}\cdot \tfrac{1}{x} = x^{n-2} and 1xn1x=1xn2\tfrac{1}{x^{n-1}}\cdot x = \tfrac{1}{x^{n-2}}. The left side is just 3pn13\,p_{n-1}, so rearranging gives the whole trick in one line:

pn=3pn1pn2.p_n = 3\,p_{n-1} - p_{n-2}.
(2)

Read equation (2) slowly, because it is the reason the radicals vanish. Every term is three times the last one minus the one before, and that is nothing but whole-number arithmetic. Start from two integers, 22 and 33, and you can never leave the integers. The 5\sqrt{5} baked into xx quietly cancels with the 5\sqrt{5} baked into 1x\tfrac{1}{x} at every single step.

Climb to the fifth floor

With the rule in hand there is no cleverness left, only bookkeeping. Each line uses the two above it:

p2=332=7,p3=373=18,p4=3187=47,p5=34718=123.\begin{aligned} p_2 &= 3\cdot 3 - 2 = 7,\\ p_3 &= 3\cdot 7 - 3 = 18,\\ p_4 &= 3\cdot 18 - 7 = 47,\\ p_5 &= 3\cdot 47 - 18 = 123. \end{aligned}
x5+1x5=123.x^5 + \frac{1}{x^5} = 123.
Fig. 1 — The ladder p₀, p₁, …, p₅. Each rung is fixed by the two below it, so the climb never leaves the integers.

The same ladder answers the question for any exponent. Want x10+1x10x^{10} + \tfrac{1}{x^{10}}? Keep climbing: p6=322p_6 = 322, and so on. One rule, as many floors as you like.

This is Newton’s identities in miniature

Equation (2) is not a coincidence of this particular puzzle. The numbers pnp_n are the power sums of the two roots x,1xx, \tfrac{1}{x}, and their elementary symmetric functions are exactly the sum and product from Vieta: e1=x+1x=3e_1 = x + \tfrac{1}{x} = 3 and e2=x1x=1e_2 = x\cdot\tfrac{1}{x} = 1. Newton’s identities say that for two variables,

pn=e1pn1e2pn2(n2),p_n = e_1\, p_{n-1} - e_2\, p_{n-2} \quad (n \ge 2),
(3)

which for e1=3, e2=1e_1 = 3,\ e_2 = 1 is our equation (2) on the nose. Change the condition to x+1x=sx + \tfrac{1}{x} = s and the recurrence just swaps the 33 for ss: pn=spn1pn2p_n = s\,p_{n-1} - p_{n-2}. That single formula quietly solves every “find xk+1/xkx^k + 1/x^k” problem you will ever be handed.

The number hiding under 123

We refused to solve for xx, but let us peek now. The quadratic (1) gives

x=3±52.x = \frac{3 \pm \sqrt{5}}{2}.

The larger root is 3+522.618\tfrac{3+\sqrt5}{2} \approx 2.618, and that is a familiar face in disguise. Writing the golden ratio as φ=1+52\varphi = \tfrac{1+\sqrt5}{2}, a one-line check using φ2=φ+1\varphi^2 = \varphi + 1 gives φ2+φ2=3\varphi^2 + \varphi^{-2} = 3. So our xx is simply φ2\varphi^2, and

pn=φ2n+φ2n=L2n,p_n = \varphi^{2n} + \varphi^{-2n} = L_{2n},

where LmL_m are the Lucas numbers 2,1,3,4,7,11,18,29,47,76,123,2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, \dots Take every other one and you get our climb exactly:

2L0, 3L2, 7L4, 18L6, 47L8, 123L10, 322L12, \underbrace{2}_{L_0},\ \underbrace{3}_{L_2},\ \underbrace{7}_{L_4},\ \underbrace{18}_{L_6},\ \underbrace{47}_{L_8},\ \underbrace{123}_{L_{10}},\ \underbrace{322}_{L_{12}},\ \dots

That sequence 2,3,7,18,47,123,322,2, 3, 7, 18, 47, 123, 322, \dots is catalogued as OEIS A005248, the even-indexed Lucas numbers, and it lists the very recurrence we derived, an=3an1an2a_n = 3a_{n-1} - a_{n-2}. So the answer to the puzzle is L10=123L_{10} = 123. The ladder that dodged every square root was counting powers of the golden ratio the whole way up. I find that a little startling: a throwaway algebra drill and one of the most over-discussed constants in mathematics turn out to be the same object, seen from two angles.

Sources and further reading

  1. Vieta's formulasthe two roots and their symmetric functions
  2. Newton's identitiesthe power-sum recurrence in general
  3. Lucas numbersthe hidden sequence and its closed form
  4. The golden ratio
  5. OEIS A005248the catalogued even-indexed Lucas numbers

Comentarios · 0

Sé el primero en comentar.