MathDB

Simple Recurrence solving

Source:

August 11, 2019

Recurrencerecursion

Problem Statement

Let

x_{1}

be a positive real number and for every integer

n \geq 1

let

x_{n+1} = 1 + x_{1}x_{2}\ldots x_{n-1}x_{n}

. If

x_{5} = 43

, what is the sum of digits of the largest prime factors of

x_{6}