Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider the sequence $a_n$ = $a_{n-1} \cdot a_{n-2} + n$ for $n \geq 2$ with $a_0 = 1$ and $a_1 = 1$. Is $a_{2011}$ even or odd? Please justify.

share|cite|improve this question
1  
Please don't yell. Words in all caps (such as ODD and EVEN) are interpreted as if you are shouting. – Arturo Magidin Apr 21 '11 at 2:32
3  
Consider the same sequence, but mod 2. Try a few terms. Prove the pattern by induction. – lhf Apr 21 '11 at 2:36
up vote 2 down vote accepted

HINT $\rm\ \ mod\ 2\::\ \ a_{n-2}\ \equiv\ n-2,\ \ a_{n-1}\ \equiv\ n-1\ \ \Rightarrow\ \ a_n\ \equiv\ n\:.\:$ Hence once the parity of $\rm\:a_n\:$ is the same as its index $\rm\:n\:$ for two successive indices, it remains so for all larger indices (by induction).

share|cite|improve this answer

Hint: Suppose $n$ is even. The parities of $a_{n-1},a_{n-2}$ completely determine the parities of $a_{n+1},a_n$.

share|cite|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.