A Recursive Sequence That Hides Its Product

Recursive sequences often tempt us to calculate their terms one by one. In competition problems, that can be exactly the trap.

Sometimes the recurrence itself contains a much simpler structure. Once that structure is exposed, a seemingly complicated product can collapse with almost no computation.

The Problem

Letx1=97,x_1=97,

and for n>1n>1,xn=nxn−1.x_n=\frac{n}{x_{n-1}}.

Calculatex1x2x3x4x5x6x7x88.\boxed{\frac{x_1x_2x_3x_4x_5x_6x_7x_8}{8}}.

The Hidden Structure: Pairing Adjacent Terms

The recurrence isxn=nxn−1.x_n=\frac{n}{x_{n-1}}.

Instead of calculating x2,x3,…x_2,x_3,\ldots individually, multiply both sides by xn−1x_{n-1}:xn−1xn=n.\boxed{x_{n-1}x_n=n}.

This is the key observation.

For example,x1x2=2,x_1x_2=2,x2x3=3,x_2x_3=3,x3x4=4.x_3x_4=4.

We don’t actually need the individual values of the xnx_n‘s.

The recurrence has already given us the products we need.

Pair the Terms

LetP=x1x2x3x4x5x6x7x8.P=x_1x_2x_3x_4x_5x_6x_7x_8.

Group the terms into adjacent pairs:P=(x1x2)(x3x4)(x5x6)(x7x8).P=(x_1x_2)(x_3x_4)(x_5x_6)(x_7x_8).

Now applyxn−1xn=nx_{n-1}x_n=n

to each pair:x1x2=2,x_1x_2=2,x3x4=4,x_3x_4=4,x5x6=6,x_5x_6=6,x7x8=8.x_7x_8=8.

Therefore,P=2⋅4⋅6⋅8.P=2\cdot4\cdot6\cdot8.

Hence,P=384.P=384.

The required expression isP8=3848=48.\frac{P}{8}=\frac{384}{8}=\boxed{48}.

Why Was x1=97x_1=97 Given?

This is an important part of the problem.

The value 9797 looks significant because it determines the actual sequence:

x2=297,x3=3x2\begin{aligned} x_2 &= \frac{2}{97}, \\[12pt] x_3 &= \frac{3}{x_2} \end{aligned}

and so on.

But none of those individual terms needs to be calculated.

The number 9797 is deliberate misdirection.

The requested product depends only on the paired relationships

x1x2=2,x3x4=4,x5x6=6,x7x8=8x_1x_2=2, \qquad x_3x_4=4, \qquad x_5x_6=6, \qquad x_7x_8=8

In fact, the same answer results for any nonzero starting value x1x_1.

The General Pattern

Supposexn=nxn−1.x_n=\frac{n}{x_{n-1}}.

Thenxn−1xn=n.x_{n-1}x_n=n.

For an even number 2m2m of terms,x1x2⋯x2m=(x1x2)(x3x4)⋯(x2m−1x2m).x_1x_2\cdots x_{2m} =(x_1x_2)(x_3x_4)\cdots(x_{2m-1}x_{2m}).

Therefore,x1x2⋯x2m=2⋅4⋅6⋯2m.x_1x_2\cdots x_{2m}=2\cdot4\cdot6\cdots2m.

Since2⋅4⋅6⋯2m=2mm!,2\cdot4\cdot6\cdots2m=2^m m!,

we obtainx1x2⋯x2m=2mm!.\boxed{x_1x_2\cdots x_{2m}=2^m m!}.

The individual terms may look complicated, but their product has a remarkably simple form.

The Competition Insight

When a recursive sequence appears inside a product, don’t automatically calculate the terms.

First ask:

Can the recurrence be rearranged into a useful relationship between consecutive terms?

Here,xn=nxn−1x_n=\frac{n}{x_{n-1}}

immediately becomesxn−1xn=n.x_{n-1}x_n=n.

That turns a recursive problem into a simple pairing problem.

The Takeaway

Don’t compute the sequence when the recurrence already gives you the product.

The structure is often more valuable than the arithmetic.

Scroll to Top