Recurrence Relation

Algebra Level 5

Brilli the ant has thought up a diabolical sequence of integers ana_n. It has initial values a1=1a_1 = 1 and a2=3 a_2 = 3 . Subsequent terms are given by

an=(n+1)an1nan2 for n3. a_n = (n+1) a_{n-1} - n a_{n-2} \quad \mbox{ for } n\geq 3. Brilli the ant wants to know, how many integer values of nn from 1 to 1000 (inclusive) are there such that ana_n is a multiple of 11?

×

Problem Loading...

Note Loading...

Set Loading...