Difference between revisions of "2007 iTest Problems/Problem 53"

(Created page with "== Problem == Let <math>T=\text{TNFTPP}</math>. Three distinct positive Fibonacci numbers, all greater than <math>T</math>, are in arithmetic progression. Let <math>N</math> be t...")
 
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
Let <math>T=\text{TNFTPP}</math>. Three distinct positive Fibonacci numbers, all greater than <math>T</math>, are in arithmetic progression. Let <math>N</math> be the smallest possible value of their sum. Find the remainder when <math>N</math> is divided by <math>2007</math>.  
+
Let <math>T=\text{TNFTPP}</math>. Three distinct positive Fibonacci numbers, all greater than <math>T</math>, are in arithmetic progression. Let <math>N</math> be the smallest possible value of their sum. Find the remainder when <math>N</math> is divided by <math>2007</math>.
 
 
== Solution ==
 

Revision as of 20:26, 2 December 2015

Problem

Let $T=\text{TNFTPP}$. Three distinct positive Fibonacci numbers, all greater than $T$, are in arithmetic progression. Let $N$ be the smallest possible value of their sum. Find the remainder when $N$ is divided by $2007$.

Invalid username
Login to AoPS