Timeline for Making a conjecture of a closed form

14 events

when toggle format	what		by	license	comment
Aug 19, 2015 at 8:06	vote	accept	user2989280
Dec 27, 2014 at 23:53	history	tweeted			twitter.com/#!/StackCompSci/status/548990121572564992
Dec 8, 2014 at 17:50	answer	added	Rick Decker		timeline score: 2
Dec 8, 2014 at 3:13	history	edited	user2989280	CC BY-SA 3.0	edited body
S Dec 7, 2014 at 9:10	history	suggested	Jonathan Prieto-Cubides	CC BY-SA 3.0	it's more accurate use \mod that % in latex
Dec 7, 2014 at 4:57	comment	added	Jonathan Prieto-Cubides		The worst case for the euclidean algorithm could find out started with (1,1) and iterate reversing euclidean algorithm always in each step put de minimum quotation $q = 1$, and there appears Fibonacci numbers in the residues.
Dec 7, 2014 at 4:53	review	Suggested edits
S Dec 7, 2014 at 9:10
Dec 7, 2014 at 4:27	history	reopened	Rick Decker Yuval Filmus David Richerby A.Schulz Ran G.
Dec 2, 2014 at 1:48	review	Reopen votes
Dec 7, 2014 at 4:27
Dec 2, 2014 at 1:42	comment	added	Yuval Filmus		You can start by following the advice. What is $T(F(n),F(n+1))$ equal to according to the formula?
Dec 1, 2014 at 22:57	history	edited	Raphael		edited tags
Dec 1, 2014 at 22:57	history	closed	Raphael		Duplicate of Solving or approximating recurrence relations for sequences of numbers
Dec 1, 2014 at 21:38	review	First posts
Dec 1, 2014 at 22:58
Dec 1, 2014 at 21:38	history	asked	user2989280	CC BY-SA 3.0