2007 iTest Problems/Problem 53: Difference between revisions
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..." |
No edit summary |
||
| 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>. | ||
Revision as of 19:26, 2 December 2015
Problem
Let 
. Three distinct positive Fibonacci numbers, all greater than 
, are in arithmetic progression. Let 
be the smallest possible value of their sum. Find the remainder when is divided by 
.
